Module org.jhotdraw8.graph

Package org.jhotdraw8.graph.path.algo

package org.jhotdraw8.graph.path.algo

Related Packages

Package	Description
org.jhotdraw8.graph.path
org.jhotdraw8.graph.path.backlink

Class	Description
AllWalksSpliterator<V,A,C extends Number & Comparable<C>,E>	Iterates over all walks from a set of start vertices to a set of goal vertices using a breadth-first search.
AnyArcPathSearchAlgo<V,A,C extends Number & Comparable<C>>	Searches an arbitrary path from a set of start vertices to a set of goal vertices using a breadth-first search algorithm.
AnyIndexedVertexPathSearchAlgo<C extends Number & Comparable<C>>	See AnyArcPathSearchAlgo for a description of this algorithm.
AnyIndexedVertexReachabilityAlgo<C extends Number & Comparable<C>>	See AnyArcPathSearchAlgo for a description of this algorithm.
AnyShortestArcPathSearchAlgo<V,A,C extends Number & Comparable<C>>	Searches an arbitrary shortest path from a set of start vertices to a set of goal vertices using Dijkstra's algorithm.
AnyShortestVertexPathSearchAlgo<V,C extends Number & Comparable<C>>	See AnyShortestArcPathSearchAlgo for a description of this algorithm.
AnyVertexPathSearchAlgo<V,C extends Number & Comparable<C>>	See AnyArcPathSearchAlgo for a description of this algorithm.
ArcPathSearchAlgo<V,A,C extends Number & Comparable<C>>	Interface for an arc path search algorithm over a directed graph.
ArcReachabilityAlgo<V,A,C extends Number & Comparable<C>>	Interface for a reachability checker algorithm over a directed graph.
IndexedVertexPathSearchAlgo<C extends Number & Comparable<C>>	Interface for a vertex path search algorithm over an indexed directed graph.
IndexedVertexReachabilityAlgo<C extends Number & Comparable<C>>	Interface for a reachability checker algorithm over a directed graph.
UniqueArcPathSearchAlgo<V,A,C extends Number & Comparable<C>>	Searches a globally unique vertex path from a set of start vertices to a set of goal vertices using a breadth-first search algorithm on a directed (potentially cyclic) graph (DIG).
UniqueOnAcyclicGraphArcPathSearchAlgo<V,A,C extends Number & Comparable<C>>	Searches a globally unique vertex path from a set of start vertices to a set of goal vertices using a breadth-first search algorithm on a directed acyclic graph.
UniqueOnAcyclicGraphVertexPathSearchAlgo<V,C extends Number & Comparable<C>>	See UniqueOnAcyclicGraphArcPathSearchAlgo for a description of this algorithm.
UniqueOrOneHopVertexPathSearchAlgo<V,C extends Number & Comparable<C>>	Builder for creating unique paths from a directed graph.
UniqueShortestArcPathSearchAlgo<V,A,C extends Number & Comparable<C>>	Searches a unique shortest path from a set of start vertices to a set of goal vertices using Dijkstra's algorithm.
UniqueShortestVertexPathSearchAlgo<V,C extends Number & Comparable<C>>	See UniqueShortestArcPathSearchAlgo for a description of this algorithm.
UniqueVertexPathSearchAlgo<V,C extends Number & Comparable<C>>	See UniqueArcPathSearchAlgo for a description of this algorithm.
VertexPathSearchAlgo<V,C extends Number & Comparable<C>>	Interface for a vertex path search algorithm.
VertexReachabilityAlgo<V,C extends Number & Comparable<C>>	Interface for a reachability test algorithm.