// //======================================================================= // Copyright 2002 Marc Wintermantel (wintermantel@imes.mavt.ethz.ch) // ETH Zurich, Center of Structure Technologies (www.imes.ethz.ch/st) // // This file is part of the Boost Graph Library // // You should have received a copy of the License Agreement for the // Boost Graph Library along with the software; see the file LICENSE. // If not, contact Office of Research, University of Notre Dame, Notre // Dame, IN 46556. // // Permission to modify the code and to distribute modified code is // granted, provided the text of this NOTICE is retained, a notice that // the code was modified is included with the above COPYRIGHT NOTICE and // with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE // file is distributed with the modified code. // // LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. // By way of example, but not limitation, Licensor MAKES NO // REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY // PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS // OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS // OR OTHER RIGHTS. //======================================================================= // #ifndef BOOST_GRAPH_PROFILE_HPP #define BOOST_GRAPH_PROFILE_HPP #include #include #include namespace boost { template typename graph_traits::vertices_size_type profile(const Graph& g, VertexIndexMap index) { 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 += ith_bandwidth(*i, g, index) + 1; } return b; } template typename graph_traits::vertices_size_type profile(const Graph& g) { return profile(g, get(vertex_index, g)); } } // namespace boost #endif // BOOST_GRAPH_PROFILE_HPP