Uses of Class
org.episteme.core.mathematics.discrete.ShortestPathResult

Packages that use ShortestPathResult

Package	Description
org.episteme.core.mathematics.discrete

Uses of ShortestPathResult in org.episteme.core.mathematics.discrete

Methods in org.episteme.core.mathematics.discrete that return ShortestPathResult

Modifier and Type	Method	Description
ShortestPathResult<V,W>	AStarSearch.findPath(WeightedGraph<V,W> graph, V source, V goal)	Finds shortest path from source to goal using A* search.
ShortestPathResult<V,W>	BellmanFordShortestPath.findPath(WeightedGraph<V,W> graph, V source, V target)	Computes shortest path from source to target.
static <V,W> ShortestPathResult<V,W>	ShortestPathResult.negativeCycle(V source, V target)	Creates a negative cycle result.
static <V,W> ShortestPathResult<V,W>	ShortestPathResult.noPath(V source, V target)	Creates a no-path result (unreachable).
static <V,W> ShortestPathResult<V,W>	ShortestPathResult.withPath(V source, V target, W distance, List<V> path)	Creates a successful path result.