| Function | Description |
| bfs | Breadth and Depth-first search |
| connectedComp | Identify Connected Components in an Undirected Graph |
| 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 |
| johnson.all.pairs.sp | compute shortest path distance matrix for all pairs of nodes |
| mstree.kruskal | Kruskal's minimum spanning tree in boost |
| sp.between | Dijkstra's shortest paths using boost C++ |
| strongComp | Identify Strongly Connected Components |
| tsort | topological sort of vertices of a digraph |