| Function | Description |
| 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 |
| brandes.betweenness.centrality | Compute betweenness centrality for an undirected graph |
| circle.layout | Layout an undirected graph in 2D |
| connectedComp | Identify Connected Components in an Undirected Graph |
| cuthill.mckee.ordering | Compute vertex ordering for an undirected graph |
| dag.sp | DAG shortest paths using boost C++ |
| dijkstra.sp | Dijkstra's shortest paths using boost C++ |
| edgeConnectivity | computed edge connectivity and min disconnecting set for an undirected graph |
| edmunds.karp.max.flow | Compute max flow for a directed 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 |
| highlyConnSG | Compute highly connected subgraphs for an undirected graph |
| incremental.components | Compute connected components for an undirected graph |
| isomorphism | Compute isomorphism from vertices in one graph to those in another graph |
| ith.wavefront | Compute the i-th/max/average/rms wavefront for a graph |
| johnson.all.pairs.sp | compute shortest path distance matrix for all pairs of nodes |
| minCut | Compute min-cut for an undirected graph |
| mstree.kruskal | Kruskal's minimum spanning tree in boost |
| prim.minST | Compute minimum spanning tree for an undirected graph |
| RBGL.overview | RBGL.overview |
| 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 |