wavefront {RBGL}R Documentation

Compute the i-th/max/average/rms wavefront for a graph

Description

Compute the i-th/max/average/rms wavefront for a graph

Usage

ith.wavefront(g, start)
max.wavefront(g)
aver.wavefront(g)
rms.wavefront(g)

Arguments

start a vertex of the graph class
g an instance of the graph class

Details

Given a graph G=(V, E),

Value

ith.wavefront the number of edges that must be severed to obtain the mincut

Author(s)

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

References

Boost Graph Library by Siek et al.

See Also

edgeConnectivity

Examples

coex <- fromGXL(file(system.file("XML/dijkex.gxl",package="RBGL")))
ss <- 1
ith.wavefront(coex, ss)
max.wavefront(coex)
aver.wavefront(coex)
rms.wavefront(coex)

[Package RBGL version 1.3.8 Index]