Package org.javanetworkanalyzer.model

Interface Summary

DirectedG<V,E extends EdgeID>	A keyed graph whose edges are all directed.
EdgeID	Interface for edges indexed by an integer id.
EdgeSPT<E extends EdgeSPT>	Interface for edges to be used in a TraversalAlg.
KeyedGraph<V,E extends EdgeID>	An interface for adding V vertices to a graph keyed by int ids.
UndirectedG<V,E extends EdgeID>	A keyed undirected graph.
WeightedKeyedGraph<V,E extends EdgeID>	A weighted keyed graph.

Class Summary

AsUndirectedG<V extends VId,E extends EdgeID>	An undirected view of the backing directed graph specified in the constructor.
AsUnweightedDirectedG<V extends VId,E extends EdgeID>
AsUnweightedG<V extends VId,E extends EdgeID>	An unweighted view of the backing weighted graph specified in the constructor.
DirectedPseudoG<V extends VId,E extends EdgeID>	A keyed directed pseudograph.
DirectedWeightedPseudoG<V extends VId,E extends Edge>	A keyed directed weighted pseudograph.
Edge<E extends Edge>	Weighted edge for use in TraversalGraph.
EdgeCent	An Edge for calculating edge betweenness centrality.
EdgeReversedG<V extends VId,E extends EdgeID>	Provides an edge-reversed view of a directed graph.
PseudoG<V extends VId,E extends EdgeID>	A keyed pseudograph.
StrahlerTree<E>	A tree for use in the Strahler algorithm.
TraversalGraph<V,E>	A simple directed graph for shortest path "trees" (multiple shortest paths are allowed) in Dijkstra and BFS as well as DFS traversal graphs.
WeightedEdgeReversedG<V extends VId,E extends EdgeID>	Provides an edge-reversed view of a weighted directed graph.
WeightedPseudoG<V extends VId,E extends Edge>	A keyed weighted pseudograph.