x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
bandwidth.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\graph\bandwidth.hpp
旋转
特效
属性
历史版本
// Copyright (c) Jeremy Siek 2001, Marc Wintermantel 2002 // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_GRAPH_BANDWIDTH_HPP #define BOOST_GRAPH_BANDWIDTH_HPP #include
// for std::min and std::max #include
#include
#include
namespace boost { template
typename graph_traits
::vertices_size_type ith_bandwidth(typename graph_traits
::vertex_descriptor i, const Graph& g, VertexIndexMap index) { BOOST_USING_STD_MAX(); typedef typename graph_traits
::vertices_size_type size_type; size_type b = 0; typename graph_traits
::out_edge_iterator e, end; for (tie(e, end) = out_edges(i, g); e != end; ++e) { int f_i = get(index, i); int f_j = get(index, target(*e, g)); using namespace std; // to call abs() unqualified if(f_i > f_j) b = max BOOST_PREVENT_MACRO_SUBSTITUTION (b, size_type(f_i - f_j)); } return b; } template
typename graph_traits
::vertices_size_type ith_bandwidth(typename graph_traits
::vertex_descriptor i, const Graph& g) { return ith_bandwidth(i, g, get(vertex_index, g)); } template
typename graph_traits
::vertices_size_type bandwidth(const Graph& g, VertexIndexMap index) { BOOST_USING_STD_MAX(); typename graph_traits
::vertices_size_type b = 0; typename graph_traits
::vertex_iterator i, end; for (tie(i, end) = vertices(g); i != end; ++i) b = max BOOST_PREVENT_MACRO_SUBSTITUTION (b, ith_bandwidth(*i, g, index)); return b; } template
typename graph_traits
::vertices_size_type bandwidth(const Graph& g) { return bandwidth(g, get(vertex_index, g)); } template
typename graph_traits
::vertices_size_type edgesum(const Graph& g, VertexIndexMap index_map) { typedef typename graph_traits
::vertices_size_type size_type; typedef typename detail::numeric_traits
::difference_type diff_t; size_type sum = 0; typename graph_traits
::edge_iterator i, end; for (tie(i, end) = edges(g); i != end; ++i) { diff_t f_u = get(index_map, source(*i, g)); diff_t f_v = get(index_map, target(*i, g)); using namespace std; // to call abs() unqualified sum += abs(f_u - f_v); } return sum; } } // namespace boost #endif // BOOST_GRAPH_BANDWIDTH_HPP
bandwidth.hpp
网页地址
文件地址
上一页
7/95
下一页
下载
( 2 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.