bfs
Breadth and Depthfirst search
These functions return information on graph traversal by breadth and depth first search using routines from the BOOST library.
 Keywords
 graphs
Usage
bfs(object, node, checkConn=TRUE)
dfs(object, node, checkConn=TRUE)
Arguments
 object
 instance of class graph from Bioconductor graph class
 node
 node name where search starts; defaults to the node in first position in the node vector.
 checkConn
 logical for backwards compatibility; this parameter has no effect as of RBGL 1.7.9 and will be removed in future versions.
Details
These two functions are interfaces to the BOOST graph library functions for breadth first and depth first search. Both methods handle unconnected graphs by applying the algorithms over the connected components.
Cormen et al note (p 542) that `results of depthfirst search may depend upon the order in which the vertices are examined ... These different visitation orders tend not to cause problems in practice, as any DFS result can usually be used effectively, with essentially equivalent results'.
Value

For
bfs
a vector of node indices in order of BFS visit.For dfs
a list of two vectors of nodes, with elements discover
(order of DFS discovery), and finish
(order of DFS completion).
References
Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )
The Boost Graph Library: User Guide and Reference Manual; by Jeremy G. Siek, LieQuan Lee, and Andrew Lumsdaine; (AddisonWesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0201729148
Examples
con1 < file(system.file("XML/bfsex.gxl",package="RBGL"), open="r")
dd < fromGXL(con1)
close(con1)
bfs(dd, "r")
bfs(dd, "s")
con2 < file(system.file("XML/dfsex.gxl",package="RBGL"), open="r")
dd2 < fromGXL(con2)
close(con2)
dfs(dd2, "u")