Entry: FileDep
Aliases: FileDep
Keywords: graphs
Description: FileDep: a graphNEL object representing a file dependency dataset example in boost graph library
URL: ../../../library/RBGL/html/FileDep.html

Entry: RBGL.overview
Aliases: RBGL.overview
Keywords: models
Description: RBGL.overview
URL: ../../../library/RBGL/html/RBGL.overview.html

Entry: astarSearch
Aliases: astarSearch
Keywords: models
Description: Compute astarSearch for a graph
URL: ../../../library/RBGL/html/astarSearch.html

Entry: bandwidth
Aliases: bandwidth
Keywords: models
Description: Compute bandwidth for an undirected graph
URL: ../../../library/RBGL/html/bandwidth.html

Entry: betweenness.centrality.clustering
Aliases: betweenness.centrality.clustering
Keywords: models
Description: Graph clustering based on edge betweenness centrality
URL: ../../../library/RBGL/html/bccluster.html

Entry: bellman.ford.sp
Aliases: bellman.ford.sp
Keywords: graphs
Description: Bellman-Ford shortest paths using boost C++
URL: ../../../library/RBGL/html/bellman.ford.sp.html

Entry: brandes.betweenness.centrality
Aliases: brandes.betweenness.centrality
Keywords: models
Description: Compute betweenness centrality for an undirected graph
URL: ../../../library/RBGL/html/betweenness.html

Entry: bfs
Aliases: bfs dfs dfs,graph,character,ANY-method bfs,graph,character,logical-method dfs,graph,character,logical-method bfs,graph,missing,logical-method bfs,graph,character,missing-method dfs,graph,character,missing-method bfs,graph,missing,missing-method dfs,graph,missing,missing-method bfs,graph-method bfs,graph,character-method dfs,graph,character-method bfs,graph,ANY,ANY-method
Keywords: graphs
Description: Breadth and Depth-first search
URL: ../../../library/RBGL/html/bfs.html

Entry: biConnComp
Aliases: biConnComp articulationPoints
Keywords: models
Description: Compute biconnected components for a graph
URL: ../../../library/RBGL/html/biConnComp.html

Entry: clusteringCoef
Aliases: clusteringCoef
Keywords: models
Description: Calculate clustering coefficient for an undirected graph
URL: ../../../library/RBGL/html/clusteringCoef.html

Entry: clusteringCoefAppr
Aliases: clusteringCoefAppr
Keywords: models
Description: Approximate clustering coefficient for an undirected graph
URL: ../../../library/RBGL/html/clusteringCoefAppr.html

Entry: sequential.vertex.coloring
Aliases: sequential.vertex.coloring
Keywords: models
Description: Compute a vertex coloring for a graph
URL: ../../../library/RBGL/html/coloring.html

Entry: connectedComp
Aliases: connectedComp
Keywords: models
Description: Identify Connected Components in an Undirected Graph
URL: ../../../library/RBGL/html/connectedComp.html

Entry: dag.sp
Aliases: dag.sp
Keywords: graphs
Description: DAG shortest paths using boost C++
URL: ../../../library/RBGL/html/dag.sp.html

Entry: dijkstra.sp
Aliases: dijkstra.sp
Keywords: graphs
Description: Dijkstra's shortest paths using boost C++
URL: ../../../library/RBGL/html/dijkstra.sp.html

Entry: edgeConnectivity
Aliases: edgeConnectivity
Keywords: models
Description: computed edge connectivity and min disconnecting set for an undirected graph
URL: ../../../library/RBGL/html/edgeConn.html

Entry: extractPath
Aliases: extractPath
Keywords: models
Description: convert a dijkstra.sp predecessor structure into the path joining two nodes
URL: ../../../library/RBGL/html/extractPath.html

Entry: floyd.warshall.all.pairs.sp
Aliases: floyd.warshall.all.pairs.sp
Keywords: models
Description: compute shortest paths for all pairs of nodes
URL: ../../../library/RBGL/html/floyd.warshall.all.pairs.sp.html

Entry: gprofile
Aliases: gprofile
Keywords: models
Description: Compute profile for a graph
URL: ../../../library/RBGL/html/gprofile.html

Entry: graphGenerator
Aliases: graphGenerator
Keywords: models
Description: Generate an undirected graph with adjustable clustering coefficient
URL: ../../../library/RBGL/html/graphGenerator.html

Entry: highlyConnSG
Aliases: highlyConnSG
Keywords: models
Description: Compute highly connected subgraphs for an undirected graph
URL: ../../../library/RBGL/html/highlyConnSG.html

Entry: incremental.components
Aliases: init.incremental.components incremental.components same.component
Keywords: models
Description: Compute connected components for an undirected graph
URL: ../../../library/RBGL/html/incrConnComp.html

Entry: is.triangulated
Aliases: is.triangulated
Keywords: models
Description: Decide if a graph is triangulated
URL: ../../../library/RBGL/html/is.triangulated.html

Entry: isomorphism
Aliases: isomorphism
Keywords: models
Description: Compute isomorphism from vertices in one graph to those in another graph
URL: ../../../library/RBGL/html/isomorphism.html

Entry: johnson.all.pairs.sp
Aliases: johnson.all.pairs.sp
Keywords: models
Description: compute shortest path distance matrix for all pairs of nodes
URL: ../../../library/RBGL/html/johnson.all.pairs.sp.html

Entry: kCliques
Aliases: kCliques
Keywords: models
Description: Find all the k-cliques in an undirected graph
URL: ../../../library/RBGL/html/kCliques.html

Entry: kCores
Aliases: kCores
Keywords: models
Description: Find all the k-cores in a graph
URL: ../../../library/RBGL/html/kCores.html

Entry: lambdaSets
Aliases: lambdaSets
Keywords: models
Description: Find all the lambda-sets in an undirected graph
URL: ../../../library/RBGL/html/lambdaSets.html

Entry: layout
Aliases: circle.layout kamada.kawai.spring.layout fruchtermanReingoldForceDirectedLayout gursoyAtunLayout randomGraphLayout
Keywords: models
Description: Layout an undirected graph in 2D
URL: ../../../library/RBGL/html/layout.html

Entry: maxClique
Aliases: maxClique
Keywords: models
Description: Find all the cliques in a graph
URL: ../../../library/RBGL/html/maxClique.html

Entry: max.flow
Aliases: edmunds.karp.max.flow push.relabel.max.flow
Keywords: models
Description: Compute max flow for a directed graph
URL: ../../../library/RBGL/html/maxFlow.html

Entry: minCut
Aliases: minCut
Keywords: models
Description: Compute min-cut for an undirected graph
URL: ../../../library/RBGL/html/minCut.html

Entry: mstree.kruskal
Aliases: mstree.kruskal
Keywords: graphs
Description: Kruskal's minimum spanning tree in boost
URL: ../../../library/RBGL/html/mstree.kruskal.html

Entry: mstree.prim
Aliases: mstree.prim prim.minST
Keywords: models
Description: Compute minimum spanning tree for an undirected graph
URL: ../../../library/RBGL/html/mstree.prim.html

Entry: Ordering
Aliases: cuthill.mckee.ordering minDegreeOrdering sloan.ordering kingOrdering
Keywords: models
Description: Compute vertex ordering for an undirected graph
URL: ../../../library/RBGL/html/ordering.html

Entry: removeSelfLoops
Aliases: removeSelfLoops
Keywords: models
Description: remove self loops in a graph
URL: ../../../library/RBGL/html/removeSelfLoops.html

Entry: separates
Aliases: separates
Keywords: manip
Description: A function to test whether a subset of nodes separates two other subsets of nodes.
URL: ../../../library/RBGL/html/separates.html

Entry: sp.between
Aliases: sp.between sp.between.scalar
Keywords: graphs
Description: Dijkstra's shortest paths using boost C++
URL: ../../../library/RBGL/html/sp.between.html

Entry: strongComp
Aliases: strongComp
Keywords: models
Description: Identify Strongly Connected Components
URL: ../../../library/RBGL/html/strongComp.html

Entry: transitive.closure
Aliases: transitive.closure
Keywords: models
Description: Compute transitive closure of a directed graph
URL: ../../../library/RBGL/html/transClosure.html

Entry: transitivity
Aliases: transitivity
Keywords: models
Description: Calculate transitivity for an undirected graph
URL: ../../../library/RBGL/html/transitivity.html

Entry: tsort
Aliases: tsort
Keywords: graphs
Description: topological sort of vertices of a digraph
URL: ../../../library/RBGL/html/tsort.html

Entry: wavefront
Aliases: ith.wavefront maxWavefront aver.wavefront rms.wavefront
Keywords: models
Description: Compute the i-th/max/average/rms wavefront for a graph
URL: ../../../library/RBGL/html/wavefront.html
