RBGL package - RDocumentation

brandes.betweenness.centrality

Compute betweenness centrality for an undirected graph

clusteringCoef

Calculate clustering coefficient for an undirected graph

bellman.ford.sp

Bellman-Ford shortest paths using boost C++

astarSearch

Compute astarSearch for a graph

bandwidth

Compute bandwidth for an undirected graph

bfs

Breadth and Depth-first search

chrobakPayneStraightLineDrawing

boyerMyrvoldPlanarityTest

biConnComp

Compute biconnected components for a graph

betweenness.centrality.clustering

Graph clustering based on edge betweenness centrality

dag.sp

DAG shortest paths using boost C++

edmondsMaxCardinalityMatching

dominatorTree

Compute dominator tree from a vertex in a directed graph

edgeConnectivity

computed edge connectivity and min disconnecting set for an undirected graph

RBGL-defunct

Defunct Functions in Package RBGL

connectedComp

Identify Connected Components in an Undirected Graph

dijkstra.sp

Dijkstra's shortest paths using boost C++

sequential.vertex.coloring

Compute a vertex coloring for a graph

clusteringCoefAppr

Approximate clustering coefficient for an undirected graph

edmondsOptimumBranching

incremental.components

Compute connected components for an undirected graph

is.triangulated

Decide if a graph is triangulated

graphGenerator

Generate an undirected graph with adjustable clustering coefficient

isKuratowskiSubgraph

highlyConnSG

Compute highly connected subgraphs for an undirected graph

floyd.warshall.all.pairs.sp

compute shortest paths for all pairs of nodes

isomorphism

Compute isomorphism from vertices in one graph to those in another graph

gprofile

Compute profile for a graph

FileDep

FileDep: a graphNEL object representing a file dependency dataset example in boost graph library

extractPath

convert a dijkstra.sp predecessor structure into the path joining two nodes

lambdaSets

Find all the lambda-sets in an undirected graph

layout

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

Ordering

Compute vertex ordering for an undirected graph

planarCanonicalOrdering

separates

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

removeSelfLoops

remove self loops in a graph

maximumCycleRatio

max.flow

Compute max flow for a directed graph

wavefront

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

isStraightLineDrawing

minCut

Compute min-cut for an undirected graph

johnson.all.pairs.sp

compute shortest path distance matrix for all pairs of nodes

sloanStartEndVertices

minimumCycleRatio

makeMaximalPlanar

maxClique

Find all the cliques in a graph

sp.between

Dijkstra's shortest paths using boost C++

makeBiconnectedPlanar

transitivity

Calculate transitivity for an undirected graph

tsort

topological sort of vertices of a digraph

makeConnected

mstree.kruskal

Kruskal's minimum spanning tree in boost

mstree.prim

Compute minimum spanning tree for an undirected graph

kCliques

Find all the k-cliques in an undirected graph

kCores

Find all the k-cores in a graph

planarFaceTraversal

RBGL.overview

strongComp

Identify Strongly Connected Components

transitive.closure

Compute transitive closure of a directed graph

RBGL (version 1.42.0)

An interface to the BOOST graph library

Description

Copy Link

Version

Monthly Downloads

Version

License

Maintainer

Last Published

Functions in RBGL (1.42.0)