Uses of Interface
org.jgrapht.GraphPath
Package
Description
Algorithms related to graph cycles.
Algorithm related interfaces.
Shortestpath related algorithms.
Graph tours related algorithms.
Implementations of various graphs.

Uses of GraphPath in org.jgrapht.alg.cycle
Modifier and TypeMethodDescriptionBergeGraphInspector.getCertificate()
Returns the certificate in the form of a hole or antihole in the inspected graph, when theBergeGraphInspector.isBerge(org.jgrapht.Graph<V, E>, boolean)
method is previously called withcomputeCertificate=true
.WeakChordalityInspector.getCertificate()
Computes and returns the certificate in the form of a hole or antihole in the inspectedgraph
.ChinesePostman.getCPPSolution
(Graph<V, E> graph) Solves the Chinese Postman Problem on the given graph.HowardMinimumMeanCycle.getCycle()
Computes cycle with minimum mean.HierholzerEulerianCycle.getEulerianCycle
(Graph<V, E> g) Compute an Eulerian cycle of a graph.ChordalityInspector.getHole()
A graph which is not chordal, must contain a hole (chordless cycle on 4 or more vertices).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. 
Uses of GraphPath in org.jgrapht.alg.interfaces
Modifier and TypeMethodDescriptionMinimumCycleMeanAlgorithm.getCycle()
Computes cycle with minimum mean.EulerianCycleAlgorithm.getEulerianCycle
(Graph<V, E> graph) Compute an Eulerian cycle of a graph.Return the path from thesource
vertex to thetarget
vertex.Get a shortest path from a source vertex to a sink vertex.Return the path from the source vertex to the sink vertex.Computes a tour.HamiltonianCycleImprovementAlgorithm.improveTour
(GraphPath<V, E> tour) Improves a tour.Modifier and TypeMethodDescriptionCycleBasisAlgorithm.CycleBasis.getCyclesAsGraphPaths()
Return the set of cycles of the cycle basis.CycleBasisAlgorithm.CycleBasisImpl.getCyclesAsGraphPaths()
Return the set of cycles of the cycle basis.Get a list of kshortest paths from a source vertex to a sink vertex.Get a shortest path from a source vertex to a sink vertex.Return the path from the source vertex to the sink vertex.TreeToPathDecompositionAlgorithm.PathDecomposition.getPaths()
Set of disjoint paths of the decompositionTreeToPathDecompositionAlgorithm.PathDecompositionImpl.getPaths()

Uses of GraphPath in org.jgrapht.alg.shortestpath
Modifier and TypeFieldDescriptionListMultiObjectiveSingleSourcePathsImpl.paths
One path per vertexListSingleSourcePathsImpl.paths
One path per vertexModifier and TypeMethodDescriptionBhandariKDisjointShortestPaths.calculateShortestPath
(V startVertex, V endVertex) SuurballeKDisjointShortestPaths.calculateShortestPath
(V startVertex, V endVertex) BaseBidirectionalShortestPathAlgorithm.createPath
(org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V, E> forwardFrontier, org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V, E> backwardFrontier, double weight, V source, V commonVertex, V sink) Builds shortest path betweensource
andsink
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.IntVertexDijkstraShortestPath.findPathBetween
(Graph<Integer, E> graph, Integer source, Integer sink) Find a path between two vertices.GraphPath<?,
?> NegativeCycleDetectedException.getCycle()
Get the actual negative cycle, or null if not provided.Calculates (and returns) the shortest path from the sourceVertex to the targetVertex.Get a shortest path from a source vertex to a sink vertex.Get a shortest path from a source vertex to a sink vertex.Get a shortest path from a source vertex to a sink vertex.Get a shortest path from a source vertex to a sink vertex.Get a shortest path from a source vertex to a sink vertex.Get a shortest path from a source vertex to a sink vertex.Get a shortest path from a source vertex to a sink vertex.Get a shortest path from a source vertex to a sink vertex.Return the path from the source vertex to the sink vertex.Get a shortest path from a source vertex to a sink vertex.Return the path from the source vertex to the sink vertex.EppsteinShortestPathIterator.next()
YenShortestPathIterator.next()
Modifier and TypeMethodDescriptionAllDirectedPaths.getAllPaths
(Set<V> sourceVertices, Set<V> targetVertices, boolean simplePathsOnly, Integer maxPathLength) Calculate (and return) all paths from the source vertices to the target vertices.AllDirectedPaths.getAllPaths
(V sourceVertex, V targetVertex, boolean simplePathsOnly, Integer maxPathLength) Calculate (and return) all paths from the source vertex to the target vertex.Computesk
shortest paths betweensource
andsink
.Computesk
shortest loopless paths betweensource
andsink
.Modifier and TypeMethodDescriptionboolean
PathValidator.isValidPath
(GraphPath<V, E> partialPath, E edge) Checks if an edge can be added to a previous path element.void
Set the negative cycle.ModifierConstructorDescriptionNegativeCycleDetectedException
(String message, GraphPath<?, ?> cycle) Constructs a new exception with the specified detail message.ModifierConstructorDescriptionListMultiObjectiveSingleSourcePathsImpl
(Graph<V, E> graph, V source, Map<V, List<GraphPath<V, E>>> paths) Construct a new instance.Construct a new instance.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 givengraph
,source
,sink
andheapSupplier
.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 givengraph
,source
,sink
,heapSupplier
andpathValidator
. 
Uses of GraphPath in org.jgrapht.alg.tour
Modifier and TypeMethodDescriptionTransform from a closed List representation (first and last vertex element are the same) to a graph path.Transform from a Set representation to a graph path.HamiltonianCycleAlgorithmBase.getSingletonTour
(Graph<V, E> graph) Creates a tour for a graph with 1 vertexComputes a $3/2$approximate tour.Computes a tour using the greedy heuristic.Computes a minimumcost Hamiltonian tour.Computes a tour using the nearest insertion heuristic.Computes a tour using the nearest neighbour heuristic.Computes a Hamiltonian tour.Computes a tour using the greedy heuristic.Computes a 2approximate tour.Computes a 2approximate tour.TwoOptHeuristicTSP.improveTour
(GraphPath<V, E> tour) Try to improve a tour by running the 2opt heuristic.Transform from a List representation to a graph path.Modifier and TypeMethodDescriptionTwoOptHeuristicTSP.improveTour
(GraphPath<V, E> tour) Try to improve a tour by running the 2opt heuristic.ModifierConstructorDescriptionNearestInsertionHeuristicTSP
(GraphPath<V, E> subtour) Constructor Specifies an existing subtour that will be augmented to form a complete tour whenNearestInsertionHeuristicTSP.getTour(org.jgrapht.Graph)
is called 
Uses of GraphPath in org.jgrapht.graph
Modifier and TypeClassDescriptionclass
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.