1<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> 2<!-- saved from url=(0050)http://www.boost.org/libs/graph/doc/bandwidth.html --> 3<HTML><HEAD><TITLE>Boost Graph Library: Bandwidth</TITLE> 4<META http-equiv=Content-Type content="text/html; charset=windows-1252"><!-- 5 -- Copyright (c) Jeremy Siek 2000 6 -- 7 -- Distributed under the Boost Software License, Version 1.0. 8 -- (See accompanying file LICENSE_1_0.txt or copy at 9 -- http://www.boost.org/LICENSE_1_0.txt) 10 --> 11<META content="MSHTML 6.00.2715.400" name=GENERATOR></HEAD> 12<BODY text=#000000 vLink=#551a8b aLink=#ff0000 link=#0000ee bgColor=#ffffff> 13<IMG SRC="../../../boost.png" 14 ALT="C++ Boost" width="277" height="86"> <BR> 15<H1><A name=sec:bandwidth></a><tt>profile</tt> </H1> 16<PRE> (1) 17 template <typename Graph> 18 typename graph_traits<Graph>::vertices_size_type 19 profile(const Graph& g) 20 21 (2) 22 template <typename Graph, typename VertexIndexMap> 23 typename graph_traits<Graph>::vertices_size_type 24 profile(const Graph& g, VertexIndexMap index_map) 25</PRE> 26<p>The<b> profile</b> is the sum of all the maximum distances between the <i>i-th</i> 27 vertex and any of its neighbors with an index <i>j>i</i>.</p> 28<p><BR> 29 <I>B(G) = max { |index[u] - index[v]| | (u,v) in E }</I><BR> 30</p> 31<H3>Defined in</H3> 32<A 33href="http://www.boost.org/boost/graph/bandwidth.hpp"><TT>boost/graph/profile.hpp</TT></A> 34<BR> 35<HR> 36 37<TABLE width="677"> 38 <TBODY> 39 <TR vAlign=top> 40 <TD noWrap>Copyright � 2001-2002</TD> 41 <TD>Marc Wintermantel, ETH Zurich (<A 42 href="mailto:wintermantel@imes.mavt.ethz.ch">wintermantel@imes.mavt.ethz.ch</a>) 43 </TD> 44 </TR></TBODY></TABLE></BODY></HTML> 45
