Link Search Menu Expand Document

🝰 Least Nodes

Favor traversing the least amount of nodes.

The Least Nodes heuristic favor node count traversal over anything else.


Heuristics
A single heuristics definition

Table of content


The Least Node heuristic score the number of traversed nodes with an equal, constant value, favoring paths traverse the fewest amount of node.

Note that fewer nodes doesn’t means shortest paths!


Properties


Property Description
Basics Β 
Weight Factor Weight of this heuristic against other concurrent heuristics.
The higher the value, the more important it is during resolution.
Invert Whether the score of this heuristic should be inverted.
This effectively samples the score curve backwards.
Score Curve Curve over which the heuristic values will be remapped.
Local Weight Β 
Use Local Weight Multiplier If enabled, this heuristic will be using a dynamic, per-point weight factor.
Local Weight Multiplier Source Whether to read the weight from Vtx or Edges points.
Local Weight Multiplier Attribute Attribute to read the local weight from.
Roaming Β 
UVW Seed Bounds-relative roaming seed point
UVW Goal Bounds-relative roaming goal point

Roaming seed/goal points are used as fallback in contexts that are using heuristics but don’t have explicit seed/goals; such as Cluster Refineβ€˜MST or Score-based refinements.