Uses of Interface
org.javanetworkanalyzer.data.VPred

Packages that use VPred

org.javanetworkanalyzer.alg
org.javanetworkanalyzer.data

Uses of VPred in org.javanetworkanalyzer.alg

Classes in org.javanetworkanalyzer.alg with type parameters of type VPred

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.
interface	TraversalAlg<V extends VPred,E extends EdgeSPT> Interface for algorithms that traverse a graph.

Fields in org.javanetworkanalyzer.alg declared as VPred

protected V

GraphSearchAlgorithm.currentStartNode Current start node

Uses of VPred in org.javanetworkanalyzer.data

Classes in org.javanetworkanalyzer.data with type parameters of type VPred

interface	VPred<V extends VPred,E> Vertices which have an id and predecessor(s) on shortest paths from a source node.
class	VPredImpl<V extends VPred,E> Default implementation of the VPred interface.

Subinterfaces of VPred in org.javanetworkanalyzer.data

interface

VCent<V extends VCent,E> Vertex for centrality computations (used by graph analyzers).

Classes in org.javanetworkanalyzer.data that implement VPred

class	VAccess<E> Vertex used during accessibility analysis.
class	VBFS<V extends VBFS,E> Vertex to be used in the BFS algorithm.
class	VCentImpl Centrality vertex implementation.
class	VDFS<V extends VDFS,E> Vertex to be used in the DFS algorithm.
class	VDijkstra<V extends VDijkstra,E> Vertex to be used in the Dijkstra algorithm.
class	VPredImpl<V extends VPred,E> Default implementation of the VPred interface.
class	VStrahler<E> Vertex to be used during the Strahler stream order algorithm.
class	VUCent<E> Unweighted centrality vertex.
class	VWCent<E> Weighted centrality vertex.