The package provides classes for analyzing network structures.

 BetweennessCentrality Calculates betweenness centrality measures for nodes in a graph.
 LinkDistance Calculates the link distance from a source node based on a breadth-first traversal.
 MaxFlowMinCut Calculates the maximum flow along edges of a graph using the Edmonds-Karp method.
 ShortestPaths Calculates the shortest paths to a source node using Dijkstra's algorithm.
 SpanningTree Calculates a spanning tree for a graph structure.