We need your help! 🔥
Please consider disabling your ad-blocker to support this website! 🔑
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
Shortest Route
Find the shortest route through a network between two nodes
Inputs
| Name | ID | Description | Type |
|---|---|---|---|
| Edge→Node | E→N | Edge→Node Topology. This indicates a pair of nodes that define one edge. | Integer |
| Weights | W | A list of weights coressponding to connections | Number |
| Node A | A | Index of the starting node | Integer |
| Node B | B | Index of the Ending node | Integer |
Outputs
| Name | ID | Description | Type |
|---|---|---|---|
| Nodes | N | List of step nodes(Points)' indices traversed in the result route | Integer |
| Segments | S | List of step edges(Connections)' indices traversed in the result route | Integer |
| Cost | C | Aggregated weight of the shortest path | Number |
Site design © Robin Rodricks.
Heteroptera and associated data © 2025 Amin Bahrami (Helioripple Studio).
Rhinoceros and Grasshopper are registered trademarks of Robert McNeel & Associates.
Hosted by GitHub