...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
(1) template <typename Graph> typename graph_traits<Graph>::vertices_size_type bandwidth(const Graph& g) (2) template <typename Graph, typename VertexIndexMap> typename graph_traits<Graph>::vertices_size_type bandwidth(const Graph& g, VertexIndexMap index_map)The bandwidth of an undirected graph is the maximum distance between two adjacent vertices, with distance measured on a line upon which the vertices have been placed at unit intervals. To put it another way, if the vertices of an undirected graph G=(V,E) are each assigned an index from zero to |V| - 1 given by index[v], then the bandwidth of G is
(1) template <typename Graph> typename graph_traits<Graph>::vertices_size_type ith_bandwidth(typename graph_traits<Graph>::vertex_descriptor i, const Graph& g) (2) template <typename Graph, typename VertexIndexMap> typename graph_traits<Graph>::vertices_size_type ith_bandwidth(typename graph_traits<Graph>::vertex_descriptor i, const Graph& g, VertexIndexMap index)The i-th bandwidth a graph is the maximum distance between the i-th vertex and any of its neighbors.
Copyright © 2000-2001 | Jeremy Siek, Indiana University (jsiek@osl.iu.edu) |