An interface to the BOOST graph library

astarSearch | Compute astarSearch for a graph |

bandwidth | Compute bandwidth for an undirected graph |

bccluster | Graph clustering based on edge betweenness centrality |

bellman.ford.sp | Bellman-Ford shortest paths using boost C++ |

betweenness | Compute betweenness centrality for an undirected graph |

bfs | Breadth and Depth-first search |

biConnComp | Compute biconnected components for a graph |

boyerMyrvoldPlanarityTest | boyerMyrvoldPlanarityTest |

chrobakPayneStraightLineDrawing | chrobakPayneStraightLineDrawing |

clusteringCoef | Calculate clustering coefficient for an undirected graph |

clusteringCoefAppr | Approximate clustering coefficient for an undirected graph |

coloring | Compute a vertex coloring for a graph |

connectedComp | Identify Connected Components in an Undirected Graph |

dag.sp | DAG shortest paths using boost C++ |

defunct | Defunct Functions in Package 'RBGL' |

dijkstra.sp | Dijkstra's shortest paths using boost C++ |

dominatorTree | Compute dominator tree from a vertex in a directed graph |

edgeConn | computed edge connectivity and min disconnecting set for an... |

edmondsMaxCardinalityMatching | edmondsMaxCardinalityMatching |

edmondsOptimumBranching | edmondsOptimumBranching |

extractPath | convert a dijkstra.sp predecessor structure into the path... |

FileDep | FileDep: a graphNEL object representing a file dependency... |

floyd.warshall.all.pairs.sp | compute shortest paths for all pairs of nodes |

gprofile | Compute profile for a graph |

graphGenerator | Generate an undirected graph with adjustable clustering... |

highlyConnSG | Compute highly connected subgraphs for an undirected graph |

incrConnComp | Compute connected components for an undirected graph |

isKuratowskiSubgraph | isKuratowskiSubgraph |

isomorphism | Compute isomorphism from vertices in one graph to those in... |

isStraightLineDrawing | isStraightLineDrawing |

is.triangulated | Decide if a graph is triangulated |

johnson.all.pairs.sp | compute shortest path distance matrix for all pairs of nodes |

kCliques | Find all the k-cliques in an undirected graph |

kCores | Find all the k-cores in a graph |

lambdaSets | Find all the lambda-sets in an undirected graph |

layout | Layout an undirected graph in 2D - suspended june 16 2012 |

makeBiconnectedPlanar | makeBiconnectedPlanar |

makeConnected | makeConnected |

makeMaximalPlanar | makeMaximalPlanar |

maxClique | Find all the cliques in a graph |

maxFlow | Compute max flow for a directed graph |

maximumCycleRatio | maximumCycleRatio |

minCut | Compute min-cut for an undirected graph |

minimumCycleRatio | minimumCycleRatio |

mstree.kruskal | Kruskal's minimum spanning tree in boost |

mstree.prim | Compute minimum spanning tree for an undirected graph |

ordering | Compute vertex ordering for an undirected graph |

planarCanonicalOrdering | planarCanonicalOrdering |

planarFaceTraversal | planarFaceTraversal |

RBGL.overview | RBGL.overview |

removeSelfLoops | remove self loops in a graph |

separates | A function to test whether a subset of nodes separates two... |

sloanStartEndVertices | sloanStartEndVertices |

sp.between | Dijkstra's shortest paths using boost C++ |

strongComp | Identify Strongly Connected Components |

transClosure | Compute transitive closure of a directed graph |

transitivity | Calculate transitivity for an undirected graph |

tsort | topological sort of vertices of a digraph |

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

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.