Uses of Interface
org.javanetworkanalyzer.alg.TraversalAlg

Packages that use TraversalAlg

org.javanetworkanalyzer.alg

Uses of TraversalAlg in org.javanetworkanalyzer.alg

Subinterfaces of TraversalAlg in org.javanetworkanalyzer.alg

interface

CentralityAlg<V extends VCent,E extends EdgeSPT,S extends PathLengthData> Root interface for GraphSearchAlgorithms that do centrality calculations.

Classes in org.javanetworkanalyzer.alg that implement TraversalAlg

class	BFS<V extends VBFS,E extends EdgeSPT> Root Breadth First Search (BFS) class.
class	BFSForCentrality<E extends EdgeSPT> Uses BFS to do graph analysis (calculating betweenness centrality, etc.).
class	DFS<V extends VDFS,E extends EdgeSPT> Root Depth First Search (DFS) class.
class	DFSForStrahler<E extends EdgeSPT> Calculates the Strahler numbers of the nodes in the given tree.
class	Dijkstra<V extends VDijkstra,E extends EdgeSPT> Home-brewed implementation of Dijkstra's algorithm.
class	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.
class	DijkstraForCentrality<E extends EdgeSPT> An implementation of Dijkstra's algorithm which can be used to calculate betweenness and closeness in a GraphAnalyzer.
class	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.