Uses of Interface
org.jgrapht.alg.interfaces.AStarAdmissibleHeuristic
-
Packages that use AStarAdmissibleHeuristic Package Description org.jgrapht.alg.shortestpath Shortest-path related algorithms. -
-
Uses of AStarAdmissibleHeuristic in org.jgrapht.alg.shortestpath
Classes in org.jgrapht.alg.shortestpath that implement AStarAdmissibleHeuristic Modifier and Type Class Description class
ALTAdmissibleHeuristic<V,E>
An admissible heuristic for the A* algorithm using a set of landmarks and the triangle inequality.(package private) class
BidirectionalAStarShortestPath.ReversedGraphHeuristic
Helper class for backward search, since it should operate on the reversed graph.Fields in org.jgrapht.alg.shortestpath declared as AStarAdmissibleHeuristic Modifier and Type Field Description protected AStarAdmissibleHeuristic<V>
AStarShortestPath. admissibleHeuristic
private AStarAdmissibleHeuristic<V>
BidirectionalAStarShortestPath. backwardHeuristic
Heuristic used for backward search.private AStarAdmissibleHeuristic<V>
BidirectionalAStarShortestPath. forwardHeuristic
Heuristic used for forward search.(package private) AStarAdmissibleHeuristic<V>
BidirectionalAStarShortestPath.AStarSearchFrontier. heuristic
Heuristic used in this frontier.private AStarAdmissibleHeuristic<V>
BidirectionalAStarShortestPath.ReversedGraphHeuristic. heuristic
Methods in org.jgrapht.alg.shortestpath with parameters of type AStarAdmissibleHeuristic Modifier and Type Method Description private void
AStarShortestPath. initialize(AStarAdmissibleHeuristic<V> admissibleHeuristic)
Initializes the data structures.Constructors in org.jgrapht.alg.shortestpath with parameters of type AStarAdmissibleHeuristic Constructor Description AStarSearchFrontier(Graph<V,E> graph, V endVertex, AStarAdmissibleHeuristic<V> heuristic)
AStarShortestPath(Graph<V,E> graph, AStarAdmissibleHeuristic<V> admissibleHeuristic)
Create a new instance of the A* shortest path algorithm.AStarShortestPath(Graph<V,E> graph, AStarAdmissibleHeuristic<V> admissibleHeuristic, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,V>> heapSupplier)
Create a new instance of the A* shortest path algorithm.BidirectionalAStarShortestPath(Graph<V,E> graph, AStarAdmissibleHeuristic<V> heuristic)
Constructs a new instance of the algorithm for a given graph and heuristic.BidirectionalAStarShortestPath(Graph<V,E> graph, AStarAdmissibleHeuristic<V> heuristic, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,V>> heapSupplier)
Constructs a new instance of the algorithm for a given graph, heuristic and heap supplier.ReversedGraphHeuristic(AStarAdmissibleHeuristic<V> heuristic)
-