Test interface to boost C++ graph lib


[Package List] [Top]

Documentation for package `RBGL' version 1.3.8

User Guides and Package Vignettes

Read overview or browse directory.

Help Pages

bandwidth Compute bandwidth for an undirected graph
bellman.ford.sp Bellman-Ford shortest paths using boost C++
betweenness.centrality.clustering Graph clustering based on edge betweenness centrality
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
brandes.betweenness.centrality Compute betweenness centrality for an undirected graph
connectedComp Identify Connected Components in an Undirected Graph
dag.sp DAG shortest paths using boost C++
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
gprofile Compute profile for a graph
incremental.components Compute connected components for an undirected graph
isomorphism Compute isomorphism from vertices in one graph to those in another graph
johnson.all.pairs.sp compute shortest path distance matrix for all pairs of nodes
layout Layout an undirected graph in 2D
max.flow Compute max flow for a directed graph
minCut Compute min-cut for an undirected graph
mstree.kruskal Kruskal's minimum spanning tree in boost
Ordering Compute vertex ordering for an undirected graph
prim.minST Compute minimum spanning tree for an undirected graph
sp.between Dijkstra's shortest paths using boost C++
strongComp Identify Strongly Connected Components
transitive.closure Compute transitive closure of a graph
tsort topological sort of vertices of a digraph
wavefront Compute the i-th/max/average/rms wavefront for a graph