Uses of Class
org.jgrapht.alg.shortestpath.RankingPathElement
-
Packages that use RankingPathElement Package Description org.jgrapht.alg.shortestpath Shortest-path related algorithms. -
-
Uses of RankingPathElement in org.jgrapht.alg.shortestpath
Fields in org.jgrapht.alg.shortestpath with type parameters of type RankingPathElement Modifier and Type Field Description private java.util.Map<RankingPathElement<V,E>,java.lang.Boolean>
RankingPathElementList. path2disconnect
Methods in org.jgrapht.alg.shortestpath that return RankingPathElement Modifier and Type Method Description RankingPathElement<V,E>
RankingPathElement. getPrevPathElement()
Returns the previous path element.Methods in org.jgrapht.alg.shortestpath that return types with arguments of type RankingPathElement Modifier and Type Method Description (package private) java.util.List<RankingPathElement<V,E>>
RankingPathElementList. getPathElements()
Methods in org.jgrapht.alg.shortestpath with parameters of type RankingPathElement Modifier and Type Method Description private double
RankingPathElementList. calculatePathWeight(RankingPathElement<V,E> pathElement, E edge)
Costs taken into account are the weights stored inEdge
objects.private boolean
RankingPathElementList. isGuardVertexDisconnected(RankingPathElement<V,E> prevPathElement)
Ensures that paths of the list do not disconnect the guard-vertex.private boolean
RankingPathElementList. isNotValidPath(RankingPathElement<V,E> prevPathElement, E edge)
private boolean
RankingPathElementList. isSimplePath(RankingPathElement<V,E> prevPathElement, E edge)
Ensures that paths of the list are simple (check that the vertex was not already in the path element).Constructors in org.jgrapht.alg.shortestpath with parameters of type RankingPathElement Constructor Description PathMask(RankingPathElement<V,E> pathElement)
Creates a mask for all the edges and the vertices of the path (including the 2 extremity vertices).RankingPathElement(Graph<V,E> graph, RankingPathElement<V,E> pathElement, E edge, double weight)
Creates a path element by concatenation of an edge to a path element.RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElement<V,E> pathElement)
Creates a list with an empty path.RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElement<V,E> pathElement, PathValidator<V,E> pathValidator)
Creates a list with an empty path.
-