|
Class Summary |
| BFS<V extends VBFS,E extends EdgeSPT> |
Root Breadth First Search (BFS) class. |
| BFSForCentrality<E extends EdgeSPT> |
Uses BFS to do graph analysis (calculating betweenness centrality, etc.). |
| DFS<V extends VDFS,E extends EdgeSPT> |
Root Depth First Search (DFS) class. |
| DFSForStrahler<E extends EdgeSPT> |
Calculates the Strahler numbers of the nodes in the given tree. |
| Dijkstra<V extends VDijkstra,E extends EdgeSPT> |
Home-brewed implementation of Dijkstra's algorithm. |
| DijkstraForAccessibility<E extends EdgeSPT> |
An implementation of Dijkstra's algorithm which can be used to calculate, for
each vertex, the (distance to the) closest destination among several possible
destinations in an AccessibilityAnalyzer. |
| DijkstraForCentrality<E extends EdgeSPT> |
An implementation of Dijkstra's algorithm which can be used to calculate
betweenness and closeness in a GraphAnalyzer. |
| GraphSearchAlgorithm<V extends VPred,E extends EdgeSPT> |
Root class for graph search algorithms, including BFS, DFS, Dijkstra, etc.,
and their modified versions for centrality and connectedness calculations. |