Uses of Interface
org.jgrapht.GraphPath

Packages that use GraphPath

Package	Description
org.jgrapht.alg.cycle	Algorithms related to graph cycles.
org.jgrapht.alg.interfaces	Algorithm related interfaces.
org.jgrapht.alg.shortestpath	Shortest-path related algorithms.
org.jgrapht.alg.tour	Graph tours related algorithms.
org.jgrapht.graph	Implementations of various graphs.

Uses of GraphPath in org.jgrapht.alg.cycle

Fields in org.jgrapht.alg.cycle declared as GraphPath

Modifier and Type	Field	Description
private GraphPath<V,E>	BergeGraphInspector.certificate
private GraphPath<V,E>	WeakChordalityInspector.certificate	Contains a hole or an anti-hole of the graph, if it isn't weakly chordal
private GraphPath<V,E>	ChordalityInspector.hole	A hole contained in the inspected graph.

Methods in org.jgrapht.alg.cycle that return GraphPath

Modifier and Type	Method	Description
private GraphPath<V,E>	HowardMinimumMeanCycle.buildPath(V bestCycleVertex, int bestCycleLength, double bestCycleWeight)	Constructs cycle with minimum mean using information in policyGraph.
private GraphPath<V,E>	WeakChordalityInspector.findHole(Graph<V,E> graph, V sourceInSeparator, V source, V target, V targetInSeparator)	Finds a hole in the specified graph.
GraphPath<V,E>	BergeGraphInspector.getCertificate()	Returns the certificate in the form of a hole or anti-hole in the inspected graph, when the BergeGraphInspector.isBerge(Graph, boolean) method is previously called with computeCertificate=true.
GraphPath<V,E>	WeakChordalityInspector.getCertificate()	Computes and returns the certificate in the form of a hole or anti-hole in the inspected graph.
GraphPath<V,E>	ChinesePostman.getCPPSolution(Graph<V,E> graph)	Solves the Chinese Postman Problem on the given graph.
GraphPath<V,E>	HowardMinimumMeanCycle.getCycle()	Computes cycle with minimum mean.
GraphPath<V,E>	HierholzerEulerianCycle.getEulerianCycle(Graph<V,E> g)	Compute an Eulerian cycle of a graph.
GraphPath<V,E>	ChordalityInspector.getHole()	A graph which is not chordal, must contain a hole (chordless cycle on 4 or more vertices).
private GraphPath<V,E>	BergeGraphInspector.getPathAvoidingX(Graph<V,E> g, V start, V end, Set<V> x)	Returns a path in g from start to end avoiding the vertices in X
private GraphPath<V,E>	BergeGraphInspector.p(Graph<V,E> g, GraphPath<V,E> pathS, GraphPath<V,E> pathT, V m, V b1, V b2, V b3, V s1, V s2, V s3)	Assembles a GraphPath of the Paths S and T.
private GraphPath<V,E>	ChinesePostman.replaceShortcutEdges(Graph<V,E> inputGraph, GraphPath<V,E> pathWithShortcuts, Map<E, GraphPath<V,E>> shortcutEdges)
static <V,E> GraphPath<V,E>	Cycles.simpleCycleToGraphPath(Graph<V,E> graph, List<E> cycle)	Transform a simple cycle from an edge set representation to a graph path.
private GraphPath<V,E>	ChinesePostman.solveCPPDirected(Graph<V,E> graph)	Solves the CPP for directed graphs
private GraphPath<V,E>	ChinesePostman.solveCPPUndirected(Graph<V,E> graph)	Solves the CPP for undirected graphs

Methods in org.jgrapht.alg.cycle with parameters of type GraphPath

Modifier and Type	Method	Description
private List<V>	BergeGraphInspector.intersectGraphPaths(GraphPath<V,E> p1, GraphPath<V,E> p2)	Lists the vertices which are covered by two paths
private GraphPath<V,E>	BergeGraphInspector.p(Graph<V,E> g, GraphPath<V,E> pathS, GraphPath<V,E> pathT, V m, V b1, V b2, V b3, V s1, V s2, V s3)	Assembles a GraphPath of the Paths S and T.
private GraphPath<V,E>	ChinesePostman.replaceShortcutEdges(Graph<V,E> inputGraph, GraphPath<V,E> pathWithShortcuts, Map<E, GraphPath<V,E>> shortcutEdges)

Method parameters in org.jgrapht.alg.cycle with type arguments of type GraphPath

Modifier and Type	Method	Description
private GraphPath<V,E>	ChinesePostman.replaceShortcutEdges(Graph<V,E> inputGraph, GraphPath<V,E> pathWithShortcuts, Map<E, GraphPath<V,E>> shortcutEdges)

Uses of GraphPath in org.jgrapht.alg.interfaces

Fields in org.jgrapht.alg.interfaces with type parameters of type GraphPath

Modifier and Type	Field	Description
private Set<GraphPath<V,E>>	CycleBasisAlgorithm.CycleBasisImpl.graphPaths
private final Set<GraphPath<V,E>>	TreeToPathDecompositionAlgorithm.PathDecompositionImpl.paths

Methods in org.jgrapht.alg.interfaces that return GraphPath

Modifier and Type	Method	Description
GraphPath<V,E>	MinimumCycleMeanAlgorithm.getCycle()	Computes cycle with minimum mean.
GraphPath<V,E>	EulerianCycleAlgorithm.getEulerianCycle(Graph<V,E> graph)	Compute an Eulerian cycle of a graph.
GraphPath<V,E>	ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths.getPath(V source, V target)	Return the path from the source vertex to the target vertex.
GraphPath<V,E>	ShortestPathAlgorithm.getPath(V source, V sink)	Get a shortest path from a source vertex to a sink vertex.
GraphPath<V,E>	ShortestPathAlgorithm.SingleSourcePaths.getPath(V sink)	Return the path from the source vertex to the sink vertex.
GraphPath<V,E>	HamiltonianCycleAlgorithm.getTour(Graph<V,E> graph)	Computes a tour.
GraphPath<V,E>	HamiltonianCycleImprovementAlgorithm.improveTour(GraphPath<V,E> tour)	Improves a tour.

Methods in org.jgrapht.alg.interfaces that return types with arguments of type GraphPath

Modifier and Type	Method	Description
Set<GraphPath<V,E>>	CycleBasisAlgorithm.CycleBasis.getCyclesAsGraphPaths()	Return the set of cycles of the cycle basis.
Set<GraphPath<V,E>>	CycleBasisAlgorithm.CycleBasisImpl.getCyclesAsGraphPaths()	Return the set of cycles of the cycle basis.
List<GraphPath<V,E>>	KShortestPathAlgorithm.getPaths(V source, V sink, int k)	Get a list of k-shortest paths from a source vertex to a sink vertex.
List<GraphPath<V,E>>	MultiObjectiveShortestPathAlgorithm.getPaths(V source, V sink)	Get a shortest path from a source vertex to a sink vertex.
List<GraphPath<V,E>>	MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths.getPaths(V sink)	Return the path from the source vertex to the sink vertex.
Set<GraphPath<V,E>>	TreeToPathDecompositionAlgorithm.PathDecomposition.getPaths()	Set of disjoint paths of the decomposition
Set<GraphPath<V,E>>	TreeToPathDecompositionAlgorithm.PathDecompositionImpl.getPaths()

Methods in org.jgrapht.alg.interfaces with parameters of type GraphPath

Modifier and Type	Method	Description
GraphPath<V,E>	HamiltonianCycleImprovementAlgorithm.improveTour(GraphPath<V,E> tour)	Improves a tour.

Uses of GraphPath in org.jgrapht.alg.shortestpath

Classes in org.jgrapht.alg.shortestpath that implement GraphPath

Modifier and Type	Class	Description
private class	EppsteinShortestPathIterator.EppsteinGraphPath	Represents a path that is generated during the computations.

Classes in org.jgrapht.alg.shortestpath that implement interfaces with type arguments of type GraphPath

Modifier and Type	Class	Description
class	EppsteinShortestPathIterator<V,E>	Iterator over the shortest paths (not required to be simple) between two vertices in a graph sorted by weight.
class	YenShortestPathIterator<V,E>	Iterator over the shortest loopless paths between two vertices in a graph sorted by weight.

Fields in org.jgrapht.alg.shortestpath declared as GraphPath

Modifier and Type	Field	Description
private GraphPath<?,?>	NegativeCycleDetectedException.cycle
private GraphPath<V,E>	TransitNodeRoutingPrecomputation.AccessVertex.path	Path between a vertex $v$ this access vertex is computed for and vertex.

Fields in org.jgrapht.alg.shortestpath with type parameters of type GraphPath

Modifier and Type	Field	Description
private org.jheaps.AddressableHeap<Double, Pair<GraphPath<V,E>, Boolean>>	YenShortestPathIterator.candidatePaths	Heap of the candidate path generated so far and sorted my their weights.
private Map<GraphPath<V,E>, V>	YenShortestPathIterator.firstDeviations	For each path $P$, stores its deviation point.
private Map<GraphPath<V,E>, V>	YenShortestPathIterator.lastDeviations	For each path $P$ stores the vertex $u$ such that $pathValidator#isValidPath([start_vertex, u], (u,v)) = false$, where $[start_vertex, u]$ denotes the subpath of $P$ from its start to vertex $u$ and $v$ is the next vertex in $P$ after $u$.
protected Map<V, List<GraphPath<V,E>>>	ListMultiObjectiveSingleSourcePathsImpl.paths	One path per vertex
protected Map<V, GraphPath<V,E>>	ListSingleSourcePathsImpl.paths	One path per vertex
private final Map<V, Map<V, GraphPath<V,E>>>	DefaultManyToManyShortestPaths.DefaultManyToManyShortestPathsImpl.pathsMap	Map with paths between sources and targets.
private Map<V, Map<V, GraphPath<V,E>>>	TransitNodeRoutingPrecomputation.PathsUnpackingTask.pathsMap	Map where the unpacked paths will be stored.
private List<GraphPath<V,E>>	YenShortestPathIterator.resultList	List of the paths returned so far via the YenShortestPathIterator.next() method.

Methods in org.jgrapht.alg.shortestpath that return GraphPath

Modifier and Type	Method	Description
private GraphPath<V,E>	AStarShortestPath.buildGraphPath(V startVertex, V targetVertex, double pathLength)	Builds the graph path
protected abstract GraphPath<V,E>	BaseKDisjointShortestPathsAlgorithm.calculateShortestPath(V startVertex, V endVertex)	Calculates the shortest paths for the current iteration.
protected GraphPath<V,E>	BhandariKDisjointShortestPaths.calculateShortestPath(V startVertex, V endVertex)
protected GraphPath<V,E>	SuurballeKDisjointShortestPaths.calculateShortestPath(V startVertex, V endVertex)
private GraphPath<V,E>	BellmanFordShortestPath.computeNegativeCycle(E edge, Map<V,E> pred)	Computes a negative weight cycle assuming that the algorithm has already determined that it exists.
protected final GraphPath<V,E>	BaseMultiObjectiveShortestPathAlgorithm.createEmptyPath(V source, V sink)	Create an empty path.
protected final GraphPath<V,E>	BaseShortestPathAlgorithm.createEmptyPath(V source, V sink)	Create an empty path.
private GraphPath<V,E>	BaseKDisjointShortestPathsAlgorithm.createGraphPath(List<E> edgeList, V startVertex, V endVertex)
protected GraphPath<V,E>	BaseBidirectionalShortestPathAlgorithm.createPath(BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E> forwardFrontier, BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E> backwardFrontier, double weight, V source, V commonVertex, V sink)	Builds shortest path between source and sink based on the information provided by search frontiers and common vertex.
private GraphPath<V,E>	ContractionHierarchyBidirectionalDijkstra.createPath(ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> forwardFrontier, ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> backwardFrontier, double weight, ContractionHierarchyPrecomputation.ContractionVertex<V> source, ContractionHierarchyPrecomputation.ContractionVertex<V> commonVertex, ContractionHierarchyPrecomputation.ContractionVertex<V> sink)	Builds shortest unpacked path between source and sink based on the information provided by search frontiers and common vertex.
static <V,E> GraphPath<V,E>	BellmanFordShortestPath.findPathBetween(Graph<V,E> graph, V source, V sink)	Find a path between two vertices.
static <V,E> GraphPath<V,E>	BFSShortestPath.findPathBetween(Graph<V,E> graph, V source, V sink)	Find a path between two vertices.
static <V,E> GraphPath<V,E>	BidirectionalDijkstraShortestPath.findPathBetween(Graph<V,E> graph, V source, V sink)	Find a path between two vertices.
static <V,E> GraphPath<V,E>	DijkstraShortestPath.findPathBetween(Graph<V,E> graph, V source, V sink)	Find a path between two vertices.
static <E> GraphPath<Integer,E>	IntVertexDijkstraShortestPath.findPathBetween(Graph<Integer,E> graph, Integer source, Integer sink)	Find a path between two vertices.
private GraphPath<V,E>	YenShortestPathIterator.getCandidatePath(GraphPath<V,E> path, int recoverVertexIndex, GraphPath<V,E> spurPath)	Builds a candidate path based on the information provided in the methods parameters.
GraphPath<?,?>	NegativeCycleDetectedException.getCycle()	Get the actual negative cycle, or null if not provided.
GraphPath<V,E>	AStarShortestPath.getPath(V sourceVertex, V targetVertex)	Calculates (and returns) the shortest path from the sourceVertex to the targetVertex.
GraphPath<V,E>	BaseManyToManyShortestPaths.getPath(V source, V sink)	Get a shortest path from a source vertex to a sink vertex.
GraphPath<V,E>	BellmanFordShortestPath.getPath(V source, V sink)	Get a shortest path from a source vertex to a sink vertex.
GraphPath<V,E>	BFSShortestPath.getPath(V source, V sink)	Get a shortest path from a source vertex to a sink vertex.
GraphPath<V,E>	BidirectionalAStarShortestPath.getPath(V source, V sink)	Get a shortest path from a source vertex to a sink vertex.
GraphPath<V,E>	BidirectionalDijkstraShortestPath.getPath(V source, V sink)
GraphPath<V,E>	CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.getPath(V source, V target)	Return the path from the source vertex to the target vertex.
GraphPath<V,E>	ContractionHierarchyBidirectionalDijkstra.getPath(V source, V sink)	Get a shortest path from a source vertex to a sink vertex.
GraphPath<V,E>	DefaultManyToManyShortestPaths.DefaultManyToManyShortestPathsImpl.getPath(V source, V target)	Return the path from the source vertex to the target vertex.
GraphPath<V,E>	DeltaSteppingShortestPath.getPath(V source, V sink)	Get a shortest path from a source vertex to a sink vertex.
GraphPath<V,E>	DijkstraManyToManyShortestPaths.DijkstraManyToManyShortestPathsImpl.getPath(V source, V target)	Return the path from the source vertex to the target vertex.
GraphPath<V,E>	DijkstraShortestPath.getPath(V source, V sink)	Get a shortest path from a source vertex to a sink vertex.
GraphPath<V,E>	FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths.getPath(V sink)
GraphPath<V,E>	FloydWarshallShortestPaths.getPath(V a, V b)	Get a shortest path from a source vertex to a sink vertex.
GraphPath<Integer,E>	IntVertexDijkstraShortestPath.Algorithm.getPath(Integer source, Integer target)
GraphPath<Integer,E>	IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl.getPath(Integer targetVertex)
GraphPath<Integer,E>	IntVertexDijkstraShortestPath.getPath(Integer source, Integer sink)
GraphPath<V,E>	JohnsonShortestPaths.getPath(V source, V sink)	Get a shortest path from a source vertex to a sink vertex.
GraphPath<V,E>	JohnsonShortestPaths.JohnsonSingleSourcePaths.getPath(V sink)
GraphPath<V,E>	ListSingleSourcePathsImpl.getPath(V targetVertex)	Return the path from the source vertex to the sink vertex.
GraphPath<V,E>	TransitNodeRoutingPrecomputation.AccessVertex.getPath()	Returns path between a vertex in the graph and vertex.
GraphPath<V,E>	TransitNodeRoutingShortestPath.getPath(V source, V sink)	Get a shortest path from a source vertex to a sink vertex.
GraphPath<V,E>	TreeSingleSourcePathsImpl.getPath(V targetVertex)	Return the path from the source vertex to the sink vertex.
private GraphPath<V,E>	AllDirectedPaths.makePath(List<E> edges)	Transform an ordered list of edges into a GraphPath.
private GraphPath<V,E>	TransitNodeRoutingShortestPath.mergePaths(GraphPath<V,E> first, GraphPath<V,E> second, GraphPath<V,E> third)	Computes a path which consists of first, second and third paths.
GraphPath<V,E>	EppsteinShortestPathIterator.next()
GraphPath<V,E>	YenShortestPathIterator.next()

Methods in org.jgrapht.alg.shortestpath that return types with arguments of type GraphPath

Modifier and Type	Method	Description
private List<GraphPath<V,E>>	BaseKDisjointShortestPathsAlgorithm.buildPaths(V startVertex, V endVertex)	After removing overlapping edges, each path is not necessarily connecting start to end vertex.
private Map<V, List<GraphPath<V,E>>>	MartinShortestPath.buildPaths(V source)	Build the actual paths from the final labels of each node.
private List<GraphPath<V,E>>	AllDirectedPaths.generatePaths(Set<V> sourceVertices, Set<V> targetVertices, boolean simplePathsOnly, Integer maxPathLength, Map<E,Integer> edgeMinDistancesFromTargets)	Generate all paths from the sources to the targets, using pre-computed minimum distances.
List<GraphPath<V,E>>	AllDirectedPaths.getAllPaths(Set<V> sourceVertices, Set<V> targetVertices, boolean simplePathsOnly, Integer maxPathLength)	Calculate (and return) all paths from the source vertices to the target vertices.
List<GraphPath<V,E>>	AllDirectedPaths.getAllPaths(V sourceVertex, V targetVertex, boolean simplePathsOnly, Integer maxPathLength)	Calculate (and return) all paths from the source vertex to the target vertex.
List<GraphPath<V,E>>	BaseKDisjointShortestPathsAlgorithm.getPaths(V startVertex, V endVertex, int k)	Returns the $k$ shortest simple paths in increasing order of weight.
List<GraphPath<V,E>>	EppsteinKShortestPath.getPaths(V source, V sink, int k)	Computes k shortest paths between source and sink.
List<GraphPath<V,E>>	ListMultiObjectiveSingleSourcePathsImpl.getPaths(V targetVertex)
List<GraphPath<V,E>>	MartinShortestPath.getPaths(V source, V sink)
List<GraphPath<V,E>>	YenKShortestPath.getPaths(V source, V sink, int k)	Computes k shortest loopless paths between source and sink.
private List<GraphPath<V,E>>	BaseKDisjointShortestPathsAlgorithm.resolvePaths(V startVertex, V endVertex)	At the end of the search we have list of intermediate paths - not necessarily disjoint and may contain reversed edges.

Methods in org.jgrapht.alg.shortestpath with parameters of type GraphPath

Modifier and Type	Method	Description
private int	YenShortestPathIterator.addDeviations(GraphPath<V,E> path)	Builds unique loopless deviations from the given path in the graph.
private GraphPath<V,E>	YenShortestPathIterator.getCandidatePath(GraphPath<V,E> path, int recoverVertexIndex, GraphPath<V,E> spurPath)	Builds a candidate path based on the information provided in the methods parameters.
private V	YenShortestPathIterator.getLastValidDeviation(GraphPath<V,E> path, V firstDeviation)	Computes vertex $u$ such that $pathValidator#isValidPath([start_vertex, u], (u,v)) = false$, where $[start_vertex, u]$ denotes the subpath of $P$ from its start to vertex $u$ and $v$ is the next vertex in $P$ after $u$.
private Pair<Set<V>,Set<E>>	YenShortestPathIterator.getMaskedVerticesAndEdges(GraphPath<V,E> path, V pathDeviation, int pathDeviationIndex)	For the given path builds sets of vertices and edges to be masked.
boolean	PathValidator.isValidPath(GraphPath<V,E> partialPath, E edge)	Checks if an edge can be added to a previous path element.
private GraphPath<V,E>	TransitNodeRoutingShortestPath.mergePaths(GraphPath<V,E> first, GraphPath<V,E> second, GraphPath<V,E> third)	Computes a path which consists of first, second and third paths.
void	NegativeCycleDetectedException.setCycle(GraphPath<?,?> cycle)	Set the negative cycle.

Constructors in org.jgrapht.alg.shortestpath with parameters of type GraphPath

Modifier	Constructor	Description
	AccessVertex(V vertex, GraphPath<V,E> path)	Constructs a new instance for the given vertex and path.
	NegativeCycleDetectedException(String message, GraphPath<?,?> cycle)	Constructs a new exception with the specified detail message.

Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type GraphPath

Modifier	Constructor	Description
(package private)	DefaultManyToManyShortestPathsImpl(Set<V> sources, Set<V> targets, Map<V, Map<V, GraphPath<V,E>>> pathsMap)	Constructs an instance of the algorithm for the given sources, targets and pathsMap.
	ListMultiObjectiveSingleSourcePathsImpl(Graph<V,E> graph, V source, Map<V, List<GraphPath<V,E>>> paths)	Construct a new instance.
	ListSingleSourcePathsImpl(Graph<V,E> graph, V source, Map<V, GraphPath<V,E>> paths)	Construct a new instance.
	PathsUnpackingTask(int taskId, List<V> transitVertices, Map<V, Map<V, GraphPath<V,E>>> pathsMap, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> shortestPaths)	Constructs a new instance for the given taskId, transitVertices, pathsMap and shortestPaths.
	YenShortestPathIterator(Graph<V,E> graph, V source, V sink, Supplier<org.jheaps.AddressableHeap<Double, Pair<GraphPath<V,E>, Boolean>>> heapSupplier)	Constructs an instance of the algorithm for given graph, source, sink and heapSupplier.
	YenShortestPathIterator(Graph<V,E> graph, V source, V sink, Supplier<org.jheaps.AddressableHeap<Double, Pair<GraphPath<V,E>, Boolean>>> heapSupplier, PathValidator<V,E> pathValidator)	Constructs an instance of the algorithm for given graph, source, sink, heapSupplier and pathValidator.

Uses of GraphPath in org.jgrapht.alg.tour

Fields in org.jgrapht.alg.tour declared as GraphPath

Modifier and Type	Field	Description
private GraphPath<V,E>	NearestInsertionHeuristicTSP.subtour

Methods in org.jgrapht.alg.tour that return GraphPath

Modifier and Type	Method	Description
protected GraphPath<V,E>	HamiltonianCycleAlgorithmBase.closedVertexListToTour(List<V> tour, Graph<V,E> graph)	Transform from a closed List representation (first and last vertex element are the same) to a graph path.
protected GraphPath<V,E>	HamiltonianCycleAlgorithmBase.edgeSetToTour(Set<E> tour, Graph<V,E> graph)	Transform from a Set representation to a graph path.
protected GraphPath<V,E>	HamiltonianCycleAlgorithmBase.getSingletonTour(Graph<V,E> graph)	Creates a tour for a graph with 1 vertex
GraphPath<V,E>	ChristofidesThreeHalvesApproxMetricTSP.getTour(Graph<V,E> graph)	Computes a $3/2$-approximate tour.
GraphPath<V,E>	GreedyHeuristicTSP.getTour(Graph<V,E> graph)	Computes a tour using the greedy heuristic.
GraphPath<V,E>	HeldKarpTSP.getTour(Graph<V,E> graph)	Computes a minimum-cost Hamiltonian tour.
GraphPath<V,E>	NearestInsertionHeuristicTSP.getTour(Graph<V,E> graph)	Computes a tour using the nearest insertion heuristic.
GraphPath<V,E>	NearestNeighborHeuristicTSP.getTour(Graph<V,E> graph)	Computes a tour using the nearest neighbour heuristic.
GraphPath<V,E>	PalmerHamiltonianCycle.getTour(Graph<V,E> graph)	Computes a Hamiltonian tour.
GraphPath<V,E>	RandomTourTSP.getTour(Graph<V,E> graph)	Computes a tour using the greedy heuristic.
GraphPath<V,E>	TwoApproxMetricTSP.getTour(Graph<V,E> graph)	Computes a 2-approximate tour.
GraphPath<V,E>	TwoOptHeuristicTSP.getTour(Graph<V,E> graph)	Computes a 2-approximate tour.
GraphPath<V,E>	TwoOptHeuristicTSP.improveTour(GraphPath<V,E> tour)	Try to improve a tour by running the 2-opt heuristic.
private GraphPath<V,E>	TwoOptHeuristicTSP.tourToPath(int[] tour)	Transform from an array representation to a graph path.
protected GraphPath<V,E>	HamiltonianCycleAlgorithmBase.vertexListToTour(List<V> tour, Graph<V,E> graph)	Transform from a List representation to a graph path.

Methods in org.jgrapht.alg.tour with parameters of type GraphPath

Modifier and Type	Method	Description
GraphPath<V,E>	TwoOptHeuristicTSP.improveTour(GraphPath<V,E> tour)	Try to improve a tour by running the 2-opt heuristic.
private int[]	TwoOptHeuristicTSP.pathToTour(GraphPath<V,E> path)	Transform from a path representation to an array representation.

Constructors in org.jgrapht.alg.tour with parameters of type GraphPath

Modifier	Constructor	Description
	NearestInsertionHeuristicTSP(GraphPath<V,E> subtour)	Constructor Specifies an existing sub-tour that will be augmented to form a complete tour when NearestInsertionHeuristicTSP.getTour(org.jgrapht.Graph) is called

Uses of GraphPath in org.jgrapht.graph

Classes in org.jgrapht.graph that implement GraphPath

Modifier and Type	Class	Description
class	GraphWalk<V,E>	A walk in a graph is an alternating sequence of vertices and edges, starting and ending at a vertex, in which each edge is adjacent in the sequence to its two endpoints.