org.javanetworkanalyzer.alg
Interface TraversalAlg<V extends VPred,E extends EdgeSPT>

All Known Subinterfaces:

CentralityAlg<V,E,S>

All Known Implementing Classes:

BFS, BFSForCentrality, DFS, DFSForStrahler, Dijkstra, DijkstraForAccessibility, DijkstraForCentrality, GraphSearchAlgorithm

public interface TraversalAlg<V extends VPred,E extends EdgeSPT>

Interface for algorithms that traverse a graph.

Author:

Adam Gouge

Method Summary

void	calculate(V startNode) Performs the graph search algorithm from the given start node.
TraversalGraph<V,E>	reconstructTraversalGraph() Returns the SPT (BFS/Dijkstra) or traversal graph (DFS) from the last start node calculate(V) was called on.

Method Detail

calculate

void calculate(V startNode)

Performs the graph search algorithm from the given start node.

Parameters:

startNode - Start node

reconstructTraversalGraph

TraversalGraph<V,E> reconstructTraversalGraph()

Returns the SPT (BFS/Dijkstra) or traversal graph (DFS) from the last start node calculate(V) was called on. For BFS/Dijkstra, the shortest path "tree" we return may contain multiple shortest paths.

Returns:

The SPT/traversal graph from the last start node calculate(V) was called on