Uses of Interface
org.jgrapht.alg.interfaces.AStarAdmissibleHeuristic
-
Packages that use AStarAdmissibleHeuristic Package Description org.jgrapht.alg Algorithms provided with JGraphT.org.jgrapht.alg.shortestpath Shortest-path related algorithms. -
-
Uses of AStarAdmissibleHeuristic in org.jgrapht.alg
Fields in org.jgrapht.alg declared as AStarAdmissibleHeuristic Modifier and Type Field Description protected AStarAdmissibleHeuristic<V>AStarShortestPath. admissibleHeuristicDeprecated.Methods in org.jgrapht.alg with parameters of type AStarAdmissibleHeuristic Modifier and Type Method Description GraphPath<V,E>AStarShortestPath. getShortestPath(V sourceVertex, V targetVertex, AStarAdmissibleHeuristic<V> admissibleHeuristic)Deprecated.Calculates (and returns) the shortest path from the sourceVertex to the targetVertex.private voidAStarShortestPath. initialize(AStarAdmissibleHeuristic<V> admissibleHeuristic)Deprecated.Initializes the data structuresbooleanAStarShortestPath. isConsistentHeuristic(AStarAdmissibleHeuristic<V> admissibleHeuristic)Deprecated.Returns true if the provided heuristic is a consistent or monotone heuristic wrt the graph provided at construction time. -
Uses of AStarAdmissibleHeuristic in org.jgrapht.alg.shortestpath
Classes in org.jgrapht.alg.shortestpath that implement AStarAdmissibleHeuristic Modifier and Type Class Description classALTAdmissibleHeuristic<V,E>An admissible heuristic for the A* algorithm using a set of landmarks and the triangle inequality.Fields in org.jgrapht.alg.shortestpath declared as AStarAdmissibleHeuristic Modifier and Type Field Description protected AStarAdmissibleHeuristic<V>AStarShortestPath. admissibleHeuristicMethods in org.jgrapht.alg.shortestpath with parameters of type AStarAdmissibleHeuristic Modifier and Type Method Description private voidAStarShortestPath. initialize(AStarAdmissibleHeuristic<V> admissibleHeuristic)Initializes the data structuresbooleanAStarShortestPath. isConsistentHeuristic(AStarAdmissibleHeuristic<V> admissibleHeuristic)Returns true if the provided heuristic is a consistent or monotone heuristic wrt the graph provided at construction time.Constructors in org.jgrapht.alg.shortestpath with parameters of type AStarAdmissibleHeuristic Constructor Description AStarShortestPath(Graph<V,E> graph, AStarAdmissibleHeuristic<V> admissibleHeuristic)Create a new instance of the A* shortest path algorithm.
-