Uses of Interface
com.jgalgo.alg.common.Path

Packages that use Path

Package	Description
com.jgalgo.alg.common	Package for common classes and interfaces used by the algorithms in the JGAlgo library.
com.jgalgo.alg.cycle	Algorithms solving cycles related problems, such as iterating over cycles in a graph, findings a cycle with the minimum mean edge weight, etc.
com.jgalgo.alg.euler	Algorithms for finding Eulerian paths and cycles in graphs.
com.jgalgo.alg.hamilton	Algorithms for solving Hamiltonian path problems.
com.jgalgo.alg.shortestpath	Algorithms for finding paths in graphs, such as shortest paths, iterating over all simple paths between two vertices, computing the Voronoi cells given a set of sites, ect.

Uses of Path in com.jgalgo.alg.common

Subinterfaces of Path in com.jgalgo.alg.common

Modifier and Type	Interface	Description
interface	IPath	A path of edges in an int graph.

Methods in com.jgalgo.alg.common that return Path

Modifier and Type	Method	Description
static <V, E> Path<V,E>	Path.findPath(Graph<V,E> g, V source, V target)	Find a valid path from \(u\) to \(v\).
static <V, E> Path<V,E>	Path.pathFromIndexPath(Graph<V,E> g, IPath indexPath)	Create a path view from a path in the index graph of the given graph.
Path<V,E>	Path.subPath(int fromEdgeIndex, int toEdgeIndex)	Create a sub path of this path that contains the edges between the specified fromEdgeIndex, inclusive, and toEdgeIndex, exclusive.
static <V, E> Path<V,E>	Path.valueOf(Graph<V,E> g, V source, V target, List<E> edges)	Create a new path from an edge list, a source and a target vertices.

Uses of Path in com.jgalgo.alg.cycle

Methods in com.jgalgo.alg.cycle that return Path

Modifier and Type	Method	Description
<V, E> Path<V,E>	MinimumMeanCycle.computeMinimumMeanCycle(Graph<V,E> g, WeightFunction<E> w)	Compute the minimum mean cycle in a graph.
<V, E> Path<V,E>	MinimumMeanCycleAbstract.computeMinimumMeanCycle(Graph<V,E> g, WeightFunction<E> w)
default <V, E> Path<V,E>	ChinesePostman.computeShortestEdgeVisitorCircle(Graph<V,E> g, WeightFunction<E> w)	Compute the shortest circuit that visits all edges in the graph at least once.

Methods in com.jgalgo.alg.cycle that return types with arguments of type Path

Modifier and Type	Method	Description
<V, E> Optional<Path<V,E>>	ChinesePostman.computeShortestEdgeVisitorCircleIfExist(Graph<V,E> g, WeightFunction<E> w)	Compute the shortest circuit that visits all edges in the graph at least once, if it exist.
<V, E> Optional<Path<V,E>>	ChinesePostmanAbstract.computeShortestEdgeVisitorCircleIfExist(Graph<V,E> g, WeightFunction<E> w)
<V, E> Iterator<Path<V,E>>	CyclesEnumerator.cyclesIter(Graph<V,E> g)	Iterate over all cycles in the given graph.
<V, E> Iterator<Path<V,E>>	CyclesEnumeratorAbstract.cyclesIter(Graph<V,E> g)

Uses of Path in com.jgalgo.alg.euler

Methods in com.jgalgo.alg.euler that return Path

Modifier and Type	Method	Description
default <V, E> Path<V,E>	EulerianTourAlgo.computeEulerianTour(Graph<V,E> g)	Compute an Eulerian tour in the graph that visit all edges exactly once.

Methods in com.jgalgo.alg.euler that return types with arguments of type Path

Modifier and Type	Method	Description
<V, E> Optional<Path<V,E>>	EulerianTourAlgo.computeEulerianTourIfExist(Graph<V,E> g)	Compute an Eulerian tour in the graph that visit all edges exactly once if one exists.

Uses of Path in com.jgalgo.alg.hamilton

Methods in com.jgalgo.alg.hamilton that return types with arguments of type Path

Modifier and Type	Method	Description
default <V, E> Optional<Path<V,E>>	HamiltonianPathAlgo.hamiltonianCycle(Graph<V,E> g)	Find a Hamiltonian cycle in the given graph.
<V, E> Iterator<Path<V,E>>	HamiltonianPathAlgo.hamiltonianCyclesIter(Graph<V,E> g)	Iterate over all Hamiltonian cycles in the given graph.
<V, E> Iterator<Path<V,E>>	HamiltonianPathAlgoAbstract.hamiltonianCyclesIter(Graph<V,E> g)
default <V, E> Optional<Path<V,E>>	HamiltonianPathAlgo.hamiltonianPath(Graph<V,E> g)	Find a Hamiltonian path in the given graph.
default <V, E> Optional<Path<V,E>>	HamiltonianPathAlgo.hamiltonianPath(Graph<V,E> g, V source, V target)	Find a Hamiltonian path in the given graph that start and end at two given vertices.
<V, E> Iterator<Path<V,E>>	HamiltonianPathAlgo.hamiltonianPathsIter(Graph<V,E> g)	Iterate over all Hamiltonian paths in the given graph.
<V, E> Iterator<Path<V,E>>	HamiltonianPathAlgo.hamiltonianPathsIter(Graph<V,E> g, V source, V target)	Iterate over all Hamiltonian paths in the given graph that start and end at two given vertices.
<V, E> Iterator<Path<V,E>>	HamiltonianPathAlgoAbstract.hamiltonianPathsIter(Graph<V,E> g)
<V, E> Iterator<Path<V,E>>	HamiltonianPathAlgoAbstract.hamiltonianPathsIter(Graph<V,E> g, V source, V target)

Uses of Path in com.jgalgo.alg.shortestpath

Methods in com.jgalgo.alg.shortestpath that return Path

Modifier and Type	Method	Description
<V, E> Path<V,E>	ShortestPathHeuristicSt.computeShortestPath(Graph<V,E> g, WeightFunction<E> w, V source, V target, ToDoubleFunction<V> vHeuristic)	Compute the shortest path between two vertices in a graph.
<V, E> Path<V,E>	ShortestPathHeuristicStAbstract.computeShortestPath(Graph<V,E> g, WeightFunction<E> w, V source, V target, ToDoubleFunction<V> vHeuristic)
default <V, E> Path<V,E>	ShortestPathSt.computeShortestPath(Graph<V,E> g, WeightFunction<E> w, V source, V target)	Compute the shortest path from a source vertex to a target vertex.
Path<?,?>	NegativeCycleException.cycle()	Get the negative cycle that was found in the graph.
<V, E> Path<V,E>	NegativeCycleException.cycle(Graph<V,E> g)	Get the negative cycle that was found in the graph in type generic safe way.
Path<V,E>	ShortestPathAllPairs.Result.getPath(V source, V target)	Get the shortest path between vertices.
Path<V,E>	ShortestPathSingleSource.Result.getPath(V target)	Get shortest path to a target vertex.
Path<V,E>	VoronoiAlgo.Result.getPath(V target)	Get the shortest path of a vertex from its site.

Methods in com.jgalgo.alg.shortestpath that return types with arguments of type Path

Modifier and Type	Method	Description
default <V, E> List<Path<V,E>>	SimplePathsEnumerator.allSimplePaths(Graph<V,E> g, V source, V target)	Find all the simple paths between a source and a target vertices in the given graph.
<V, E> List<Path<V,E>>	KShortestPathsSt.computeKShortestPaths(Graph<V,E> g, WeightFunction<E> w, V source, V target, int k)	Compute the K shortest paths from a source vertex to a target vertex.
<V, E> List<Path<V,E>>	KShortestPathsStAbstract.computeKShortestPaths(Graph<V,E> g, WeightFunction<E> w, V source, V target, int k)
<V, E> ObjectDoublePair<Path<V,E>>	ShortestPathSt.computeShortestPathAndWeight(Graph<V,E> g, WeightFunction<E> w, V source, V target)	Compute the shortest path from a source vertex to a target vertex, and its weight.
<V, E> ObjectDoublePair<Path<V,E>>	ShortestPathStAbstract.computeShortestPathAndWeight(Graph<V,E> g, WeightFunction<E> w, V source, V target)
<V, E> Optional<Path<V,E>>	Tsp.computeShortestTour(Graph<V,E> g, WeightFunction<E> w)	Compute the shortest tour that visit all vertices.
<V, E> Optional<Path<V,E>>	TspAbstract.computeShortestTour(Graph<V,E> g, WeightFunction<E> w)
<V, E> Iterator<Path<V,E>>	SimplePathsEnumerator.simplePathsIter(Graph<V,E> g, V source, V target)	Iterate over all the simple paths between a source and a target vertices in the given graph.
<V, E> Iterator<Path<V,E>>	SimplePathsEnumeratorAbstract.simplePathsIter(Graph<V,E> g, V source, V target)

Constructors in com.jgalgo.alg.shortestpath with parameters of type Path

Modifier	Constructor	Description
	NegativeCycleException(Graph<V,E> graph, Path<V,E> cycle)	Create a new instance of the exception.