Find Route
00000000-417e-4f6a-bee9-6461879d380a
Graph inputgraph · item · requiredGraph to search.Start inputinteger · item · requiredIndex of the node at the start of the route.End inputinteger · item · requiredIndex of the target node.Route outputpolyline · itemPolyline through the nodes of the cheapest route.Cost outputnumber · itemTotal cost of the cheapest route.⚠️ This content is auto-generated.
Find the cheapest route between two nodes in a graph.
- Gf → Graph to search.
- Na → Index of the node at the start of the route.
- Nb → Index of the target node.
- Vr → Variable declarations of the form 'name = Meta.Name ?? fallback', one per line.
- Ex → Expression for the cost of travelling an edge. Built-in variables are
length,run,rise,gradeandinf.length→ Distance1→ Fewest Edgesrun→ Plan Distancemax(rise, 0)→ Total Climblength * (1 + 10 * abs(grade))→ Steepness Penaltylength / (6 * exp(-3.5 * abs(grade + 0.05)))→ Hiking Timeabs(grade) > 1.0 / 12 ? inf : length→ Step-free Accesslength / speed→ Travel Timelength / speed + wait→ Time Plus Waits
- Nx → Expression for the cost of passing through a node.
0→ Freewait→ Wait