bandwidth {RBGL}R Documentation

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”

Details

The bandwidth of an undirected graph G=(V, E) is the maximum distance between two adjacent vertices, with distance measured on a line upon which the vertices have been placed at unit intervals. To put it another way, if the vertices of an undirected graph G=(V,E) are each assigned an index from zero to |V| - 1 given by index[v], then the bandwidth of G is

B(G) = max { |index[u] - index[v]| | (u,v) in E }

Value

bandwidth the bandwidth of the given graph

Author(s)

Li Long <li.long@isb-sib.ch>

References

Boost Graph Library by Siek et al.

See Also

Examples

coex <- fromGXL(file(system.file("XML/dijkex.gxl",package="RBGL")))
coex@edgemode <- "undirected"
bandwidth(coex)

[Package RBGL version 1.3.8 Index]