grasshopper2 Rhinorhino3d.com
ComponentAuto-generatedMesh
Find Route
00000000-417e-4f6a-bee9-6461879d380a

⚠️ This content is auto-generated.

Find the cheapest route between two nodes in a graph.

Input parameters:

  1. Gf → Graph to search.
  2. Na → Index of the node at the start of the route.
  3. Nb → Index of the target node.
  4. Vr → Variable declarations of the form 'name = Meta.Name ?? fallback', one per line.
  5. Ex → Expression for the cost of travelling an edge. Built-in variables are length, run, rise, grade and inf.
    •                                       length → Distance
    •                                            1 → Fewest Edges
    •                                          run → Plan Distance
    •                                 max(rise, 0) → Total Climb
    •               length * (1 + 10 * abs(grade)) → Steepness Penalty
    • length / (6 * exp(-3.5 * abs(grade + 0.05))) → Hiking Time
    •         abs(grade) > 1.0 / 12 ? inf : length → Step-free Access
    •                               length / speed → Travel Time
    •                        length / speed + wait → Time Plus Waits
  6. Nx → Expression for the cost of passing through a node.
    •    0 → Free
    • wait → Wait

Output parameters:

  1. Rt → Polyline through the nodes of the cheapest route.
  2. Cs → Total cost of the cheapest route.
  3. Nd → Indices of the nodes along the route.
  4. Ed → Indices of the edges along the route.
  5. Ar → Accumulated cost on arrival at each node along the route.