bandwidth: Compute bandwidth for an undirected graph
Description
Compute bandwidth for an undirected graph
Usage
bandwidth(g)
Arguments
g
an instance of the graph class with edgemode
undirected
Value
bandwidth
the bandwidth of the given graph
Details
The bandwidth of an undirected graph G=(V, E) is the maximum distance between
two adjacent vertices.
See documentation on bandwidth in Boost Graph Library for more details.
The Boost Graph Library: User Guide and Reference Manual;
by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine;
(Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp.
ISBN 0-201-72914-8