Grasshopper Docs

Community documentation for Grasshopper add-ons & plugins

1|Mesh Graph
2|Weight Graph
3|Primary Segmentation
4|Secondary Segmentation
5|Iterative Segmentation
6|Special Segmentation
7|Fabrication
8|Mesh Info
9|Other Tools

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

NameIDDescriptionType
MeshGraphGThe MGraph object used for MST calculationAny
StartFaceSThe starting node (face) for the shortest path calculationInteger
EndFacesEThe end nodes (faces) for the shortest path calculationInteger

Outputs

NameIDDescriptionType
ShortestPathSpThe shortest path as a MGraph. Use Display Graph to visualizeAny

Video Tutorials

Site design © Robin Rodricks.   Ivy and associated data © 2020 Andrei Nejur.  
Rhinoceros and Grasshopper are registered trademarks of Robert McNeel & Associates.  Hosted by GitHub

Report an Issue  |  Terms of Service