Community documentation for Grasshopper add-ons & plugins
Shortest Paths in a weighted mesh graph
Compute the shortest (Cheapest) path between 2 nodes in a mesh graph using Djikstra's algorithm. Calculation uses edge weight.
Inputs
| Name | ID | Description | Type |
|---|---|---|---|
| MeshGraph | G | The MGraph object used for MST calculation | Any |
| StartFace | S | The starting node (face) for the shortest path calculation | Integer |
| EndFaces | E | The end nodes (faces) for the shortest path calculation | Integer |
Outputs
| Name | ID | Description | Type |
|---|---|---|---|
| ShortestPath | Sp | The shortest path as a MGraph. Use Display Graph to visualize | Any |
Site design © Robin Rodricks.
Ivy and associated data © 2023 Andrei Nejur.
Rhinoceros and Grasshopper are registered trademarks of Robert McNeel & Associates.
Hosted by GitHub