Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: downloads/boost_1_33_1/libs/graph/doc/bandwidth.html @ 14

Last change on this file since 14 was 12, checked in by landauf, 18 years ago

added boost

File size: 3.0 KB
Line 
1<HTML>
2<!--
3  -- Copyright (c) Jeremy Siek 2000
4  --
5  -- Permission to use, copy, modify, distribute and sell this software
6  -- and its documentation for any purpose is hereby granted without fee,
7  -- provided that the above copyright notice appears in all copies and
8  -- that both that copyright notice and this permission notice appear
9  -- in supporting documentation.  Silicon Graphics makes no
10  -- representations about the suitability of this software for any
11  -- purpose.  It is provided "as is" without express or implied warranty.
12  -->
13<Head>
14<Title>Boost Graph Library: Bandwidth</Title>
15<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
16        ALINK="#ff0000"> 
17<IMG SRC="../../../boost.png" 
18     ALT="C++ Boost" width="277" height="86"> 
19
20<BR Clear>
21
22<H1><A NAME="sec:bandwidth">
23<TT>bandwidth</TT>
24</H1>
25
26<pre>
27  (1)
28  template &lt;typename Graph&gt;
29  typename graph_traits&lt;Graph&gt;::vertices_size_type
30  bandwidth(const Graph& g)
31
32  (2)
33  template &lt;typename Graph, typename VertexIndexMap&gt;
34  typename graph_traits&lt;Graph&gt;::vertices_size_type
35  bandwidth(const Graph& g, VertexIndexMap index_map)
36</pre>
37
38The <b><i>bandwidth</i></b> of an undirected graph is the maximum
39distance between two adjacent vertices, with distance measured on a
40line upon which the vertices have been placed at unit intervals. To
41put it another way, if the vertices of an undirected graph
42<i>G=(V,E)</i> are each assigned an index from zero to <i>|V| - 1</i>
43given by <i>index[v]</i>, then the bandwidth of <i>G</i> is<br>
44<br>
45<i>B(G) = max { |index[u] - index[v]|&nbsp;&nbsp;| (u,v) in E }</i><br>
46
47
48<h3>Defined in</h3>
49
50<a href="../../../boost/graph/bandwidth.hpp"><tt>boost/graph/bandwidth.hpp</tt></a>
51
52
53<hr>
54
55<H1><A NAME="sec:ith-bandwidth">
56<TT>ith_bandwidth</TT>
57</H1>
58
59<pre>
60  (1)
61  template &lt;typename Graph&gt;
62  typename graph_traits&lt;Graph&gt;::vertices_size_type
63  ith_bandwidth(typename graph_traits&lt;Graph&gt;::vertex_descriptor i,
64                const Graph&amp; g)
65
66  (2)
67  template &lt;typename Graph, typename VertexIndexMap&gt;
68  typename graph_traits&lt;Graph&gt;::vertices_size_type
69  ith_bandwidth(typename graph_traits&lt;Graph&gt;::vertex_descriptor i,
70                const Graph&amp; g,
71                VertexIndexMap index)
72</pre>
73
74The <b><i>i-th bandwidth</i></b> a graph is the maximum distance
75between the <i>i-th</i> vertex and any of its neighbors.<br>
76<br>
77<i>B<sub>i</sub>(G) = max { |index[i] - index[j]|&nbsp;&nbsp;| (i,j) in E }</i><br>
78<br>
79So the bandwidth <i>B(G)</i> can be expressed as the maximum
80of the i-th bandwidths <i>B<sub>i</sub>(G)</i>.<br>
81<br>
82<i>B(G) = max { B<sub>i</sub>(G) &nbsp;&nbsp;| i=0...|V|-1 }</i><br>
83
84<h3>Defined in</h3>
85
86<a href="../../../boost/graph/bandwidth.hpp"><tt>boost/graph/bandwidth.hpp</tt></a>
87
88<br>
89<HR>
90<TABLE>
91<TR valign=top>
92<TD nowrap>Copyright &copy 2000-2001</TD><TD>
93<A HREF="../../../people/jeremy_siek.htm">Jeremy Siek</A>, Indiana University (<A HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)
94</TD></TR></TABLE>
95
96</BODY>
97</HTML> 
Note: See TracBrowser for help on using the repository browser.