FileDep: a graphNEL object representing a file dependency dataset
example in boost graph library
Compute bandwidth for an undirected graph
Graph clustering based on edge betweenness centrality
Bellman-Ford shortest paths using boost C++
Compute betweenness centrality for an undirected graph
Compute biconnected components for a graph
Calculate clustering coefficient for an undirected graph
Approximate clustering coefficient for an undirected graph
Identify Connected Components in an Undirected Graph
Dijkstra's shortest paths using boost C++
Compute dominator tree from a vertex in a directed graph
computed edge connectivity and min disconnecting set
for an undirected graph
convert a dijkstra.sp predecessor structure into the path joining two nodes
compute shortest paths for all pairs of nodes
Generate an undirected graph with adjustable clustering coefficient
Compute highly connected subgraphs for an undirected graph
Compute connected components for an undirected graph
Compute isomorphism from vertices in one graph to those in another graph
compute shortest path distance matrix for all pairs of nodes
Find all the k-cliques in an undirected graph
Find all the lambda-sets in an undirected graph
Kruskal's minimum spanning tree in boost
Compute minimum spanning tree for an undirected graph
Compute vertex ordering for an undirected graph
A function to test whether a subset of nodes separates
 two other subsets of nodes.
Compute transitive closure of a directed graph
Calculate transitivity for an undirected graph
topological sort of vertices of a digraph
Compute the i-th/max/average/rms wavefront for a graph