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 Path
Calculates the shortest path in a network of curves
Inputs
| Name | ID | Description | Type |
|---|---|---|---|
| Curves | C | The group of curves that form the network to traverse | Curve |
| Starts | S | The point or points that form the starting point of the path | Point |
| Ends | E | The point or points that form the end point of the path | Point |
| Lengths | L | increase or decrease their traversability. If no lengths provided, they will be A manually-specified length for each curve; useful if you want to artificially manually calculated for each of the curves. | Number |
Outputs
| Name | ID | Description | Type |
|---|---|---|---|
| Shortest Path | P | The curve showing the shortest connection | Curve |
| Succession | S | The indices of the curves that form the shortest path | Integer |
| Direction | D | True if the curve in succession is walked from start to end, false otherwise | Boolean |
| Length | L | The total length, as an aggregation of the input lengths measured along the path | Number |
Site design © Robin Rodricks.
Groundhog and associated data © 2024 Philip Belesky.
Rhinoceros and Grasshopper are registered trademarks of Robert McNeel & Associates.
Hosted by GitHub