Namespace AnyPath.Native.Heuristics

Classes

ALTCompute<TGraph, TNode>

Utility class to generate ALT<TNode> heuristics. This class contains static methods that run burst accelerated code for generating the ALT heuristics. The included SquareGrid example demonstrates how to use this.

ALTSerialization

LandmarkSelection<TGraph, TNode, TEnumerator>

Contains utility functions for selecting landmarks to use with ALT<TNode> heuristics. These provide a general approach to selecting landmarks.

If you know that your requests will often have the same start or goal locations, it may be benificial to manually place landmarks "behind" these locations. Strategic placement of landmarks can vastly improve the efficiency of the algorithm.

Structs

ALT<TNode>

ALT heuristic provider that works on any type of graph. This can significantly speed up A* queries on large and complex graphs. Based on this research: https://www.microsoft.com/en-us/research/publication/computing-the-shortest-path-a-search-meets-graph-theory/?from=http%3A%2F%2Fresearch.microsoft.com%2Fpubs%2F154937%2Fsoda05.pdf

To generate ALT heuristics, you must use ALTCompute<TGraph, TNode> and optionally LandmarkSelection<TGraph, TNode, TEnumerator>. The included Square grid example demonstrates this process.