Package org.javanetworkanalyzer.analyzers

Class Summary

AccessibilityAnalyzer<E extends EdgeSPT>	Calculates, for each vertex, the (distance to the) closest destination among several possible destinations.
GeneralizedGraphAnalyzer<V,E>	Root class of all classes that do some type of analysis on graphs (centrality, connectedness, etc.).
GraphAnalyzer<V extends VCent,E extends EdgeCent,S extends PathLengthData>	Calculates various centrality measures on the given graph, assumed to be connected.
UnweightedGraphAnalyzer<E extends EdgeCent>	Calculates various centrality measures on unweighted graphs assumed to be connected using a Breadth-First Search (BFS) to calculate all possible shortest paths.
WeightedGraphAnalyzer<E extends EdgeCent>	Calculates various centrality measures on weighted graphs which are assumed to be connected.