Travel Costs
00000000-db2e-4bb8-88b4-706e81434291
Graph inputgraph · item · requiredGraph to evaluate.Start inputinteger · item · optionalOptional index of the node to measure reach from.Node Costs outputnumber · listCheapest cost of reaching each node from the start node, or null for unreachable nodes.Edge Costs outputnumber · listCost of travelling each edge from its start to its end node, null for impassable edges.⚠️ This content is auto-generated.
Evaluate the travel costs of all edges in a graph, and optionally the cheapest cost of reaching every node from a start node.
- Gf → Graph to evaluate.
- S → Optional index of the node to measure reach from.
- 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