Uses of Class
org.graph4j.util.Path

Packages that use Path

Package	Description
org.graph4j.connectivity	Algorithms for analyzing connectivity of graphs and digraphs.
org.graph4j.hamiltonian
org.graph4j.route	Algorithms related to paths and cycles.
org.graph4j.shortestpath	Algorithms related to shortest paths, such as Dijkstra, Bellman-Ford, Floyd-Warshall, etc.
org.graph4j.support	Support algorithms for various type of graphs (bipartite, tournament, etc.).
org.graph4j.util	Utility classes, such as apecialized collection for vertices and edges.

Uses of Path in org.graph4j.connectivity

Methods in org.graph4j.connectivity that return types with arguments of type Path

Modifier and Type	Method	Description
List<Path>	EdgeConnectivityAlgorithm.getMaximumDisjointPaths(int source, int target)	Computes a maximum size set of edge disjoint paths between the source and the target.
List<Path>	VertexConnectivityAlgorithm.getMaximumDisjointPaths(int source, int target)	Computes a maximum size set of vertex disjoint paths between the source and the target.

Uses of Path in org.graph4j.hamiltonian

Methods in org.graph4j.hamiltonian that return Path

Modifier and Type	Method	Description
Path	HamiltonianPathAlgorithm.findPath()
Path	HamiltonianPathAlgorithm.findPath(int source, int target)
Path	BacktrackLongestPathAlgoritm.getLongestPath()	Returns the longest path in the graph.
Path	BacktrackLongestPathAlgoritm.getLongestPath(int source)	Returns the longest path in the graph, starting in the source vertex.
Path	BacktrackLongestPathAlgoritm.getLongestPath(int source, int target)	Returns the longest path in the graph, starting in the source vertex and ending in the target vertex.

Uses of Path in org.graph4j.route

Methods in org.graph4j.route that return Path

Modifier and Type	Method	Description
Path	MaximumInducedPath.findPath()
Path	PathFinder.findShortestPath(Graph graph, int v, int u, int[] forbiddenVertices)	Finds the path with the fewest edges connecting two vertices.

Uses of Path in org.graph4j.shortestpath

Methods in org.graph4j.shortestpath that return Path

Modifier and Type	Method	Description
Path	BFSSingleSourceShortestPath.computePath(int target)
Path	DijkstraShortestPathBase.computePath(int target)
default Path	SingleSourceShortestPath.computePath(int target)	Attempts at finding the shortest path from the source to the target without computing all the paths.
protected Path	AStarAlgorithm.createPathEndingIn(int vi)
protected Path	BFSSingleSourceShortestPath.createPathEndingIn(int vi)
protected Path	DijkstraShortestPathBase.createPathEndingIn(int vi)
Path	AllPairsShortestPath.findPath(int source, int target)	Returns the shortest path between source and target.
Path	AStarAlgorithm.findPath()
Path	BellmanFordShortestPath.findPath(int target)
Path	BFSAllPairsShortestPath.findPath(int source, int target)
Path	BFSSinglePairShortestPath.findPath()
Path	BFSSingleSourceShortestPath.findPath(int target)
Path	BidirectionalDijkstra.findPath()
Path	DijkstraShortestPathBase.findPath(int target)
Path	FloydWarshallShortestPath.findPath(int source, int target)
Path	JohnsonShortestPath.findPath(int source, int target)
Path	SinglePairShortestPath.findPath()	Returns the shortest path between source and target.
Path	SingleSourceShortestPath.findPath(int target)	Returns the shortest path between source and target.

Uses of Path in org.graph4j.support

Methods in org.graph4j.support that return Path

Modifier and Type	Method	Description
Path	TournamentSupport.getHamiltonianPath()	Determines a Hamiltonian path in the tournament.

Uses of Path in org.graph4j.util

Subclasses of Path in org.graph4j.util

Modifier and Type	Class	Description
class	Cycle	A cycle is a closed path, meaning that the last vertex of the path is connected to the first one.