\HeaderA{bandwidth}{Compute bandwidth for an undirected graph}{bandwidth}
\keyword{models}{bandwidth}
\begin{Description}\relax
Compute bandwidth for an undirected graph
\end{Description}
\begin{Usage}
\begin{verbatim}
bandwidth(g)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{g}] an instance of the \code{graph} class with \code{edgemode}
\dQuote{undirected}
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
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.
\end{Details}
\begin{Value}
\begin{ldescription}
\item[\code{bandwidth}] the bandwidth of the given graph
\end{ldescription}
\end{Value}
\begin{Author}\relax
Li Long <li.long@isb-sib.ch>
\end{Author}
\begin{References}\relax
Boost Graph Library by Siek et al.
\end{References}
\begin{SeeAlso}\relax
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
coex <- fromGXL(file(system.file("XML/dijkex.gxl",package="RBGL"), open="r"))
coex <- ugraph(coex)
bandwidth(coex)
\end{ExampleCode}
\end{Examples}

