Package org.geotools.graph.traverse.standard
package org.geotools.graph.traverse.standard
-
ClassDescriptionA path iterator that uses a function (usually denoted f(x)) to determine the order in which the algorithm visits nodes, f(x) is a sum of two functions: The path-cost function (usually denoted g(x), which may or may not be a heuristic) An admissible "heuristic estimate" (usually denoted h(x)).Defines the functions needed by A Star.Internal data structure used to track node costs, and parent nodes.Iterates over the nodes of a graph in a Breadth First Search pattern starting from a specified node.Iterates over the nodes of a graph in Breadth First Topological Sort pattern.Iterates over the nodes of a graph in a Depth First Search pattern starting from a specified node.Iterates over the nodes of a graph in Depth First Topological Sort pattern.Iterates over the nodes of a graph in pattern using Dijkstra's Shortest Path Algorithm.Internal data structure used to track node costs, and parent nodes.Supplies a weight for each edge in the graph to be used by the iteration when calculating node costs.Supplies a weight for each pair of adjacent edges.Iterates over the nodes of a graph starting from a specified node, stopping at a bifurcation.