Uses of Class
org.jgrapht.alg.shortestpath.BellmanFordPathElement
-
Packages that use BellmanFordPathElement Package Description org.jgrapht.alg.shortestpath Shortest-path related algorithms. -
-
Uses of BellmanFordPathElement in org.jgrapht.alg.shortestpath
Fields in org.jgrapht.alg.shortestpath with type parameters of type BellmanFordPathElement Modifier and Type Field Description private java.util.Map<V,BellmanFordPathElement<V,E>>
BellmanFordIterator. prevVertexData
private java.util.Map<V,BellmanFordPathElement<V,E>>
BellmanFordIterator. vertexData
Stores the vertices that have been seen during iteration and (optionally) some additional traversal info regarding each vertex.Methods in org.jgrapht.alg.shortestpath that return BellmanFordPathElement Modifier and Type Method Description private BellmanFordPathElement<V,E>
BellmanFordIterator. createSeenData(V vertex, E edge, double cost)
The first time we see a vertex, make up a new entry for it.BellmanFordPathElement<V,E>
BellmanFordIterator. getPathElement(V endVertex)
Returns the path element of the shortest path with less thannMaxHops
edges between the start vertex and the end vertex.protected BellmanFordPathElement<V,E>
BellmanFordIterator. getPrevSeenData(V vertex)
Access the data stored for a seen vertex in the previous pass.protected BellmanFordPathElement<V,E>
BellmanFordIterator. getSeenData(V vertex)
Access the data stored for a seen vertex in the current pass.protected BellmanFordPathElement<V,E>
BellmanFordIterator. putPrevSeenData(V vertex, BellmanFordPathElement<V,E> data)
protected BellmanFordPathElement<V,E>
BellmanFordIterator. putSeenData(V vertex, BellmanFordPathElement<V,E> data)
Stores iterator-dependent data for a vertex that has been seen during the current pass.Methods in org.jgrapht.alg.shortestpath with parameters of type BellmanFordPathElement Modifier and Type Method Description protected boolean
BellmanFordPathElement. improve(BellmanFordPathElement<V,E> candidatePrevPathElement, E candidateEdge, double candidateCost)
Returnstrue
if the path has been improved,false
otherwise.protected BellmanFordPathElement<V,E>
BellmanFordIterator. putPrevSeenData(V vertex, BellmanFordPathElement<V,E> data)
protected BellmanFordPathElement<V,E>
BellmanFordIterator. putSeenData(V vertex, BellmanFordPathElement<V,E> data)
Stores iterator-dependent data for a vertex that has been seen during the current pass.Constructors in org.jgrapht.alg.shortestpath with parameters of type BellmanFordPathElement Constructor Description BellmanFordPathElement(BellmanFordPathElement<V,E> original)
Copy constructor.BellmanFordPathElement(Graph<V,E> graph, BellmanFordPathElement<V,E> pathElement, E edge, double cost, double epsilon)
Creates a path element by concatenation of an edge to a path element.
-