Test interface to boost C++ graph lib


[Package List] [Top]

Documentation for package `RBGL' version 1.3.7

User Guides and Package Vignettes

Read overview or browse directory.

Help Pages

bfs Breadth and Depth-first search
bfs,graph,ANY,ANY-method Breadth and Depth-first search
bfs,graph,character,logical-method Breadth and Depth-first search
bfs,graph,character,missing-method Breadth and Depth-first search
bfs,graph,character-method Breadth and Depth-first search
bfs,graph,missing,missing-method Breadth and Depth-first search
bfs,graph-method Breadth and Depth-first search
connectedComp Identify Connected Components in an Undirected Graph
dfs Breadth and Depth-first search
dfs,graph,character,ANY-method Breadth and Depth-first search
dfs,graph,character,logical-method Breadth and Depth-first search
dfs,graph,character-method Breadth and Depth-first search
dfs,graph,missing,missing-method Breadth and Depth-first search
dijkstra.sp Dijkstra's shortest paths using boost C++
edgeConnectivity computed edge connectivity and min disconnecting set for an undirected graph
extractPath convert a dijkstra.sp predecessor structure into the path joining two nodes
FileDep FileDep: a graphNEL object representing a file dependency dataset example in boost graph library
johnson.all.pairs.sp compute shortest path distance matrix for all pairs of nodes
mstree.kruskal Kruskal's minimum spanning tree in boost
sp.between Dijkstra's shortest paths using boost C++
strongComp Identify Strongly Connected Components
tsort topological sort of vertices of a digraph