Grasshopper

algorithmic modeling for Rhino

0|Param
1|Create Graph
1|Mesh Graph
2|Weight Graph
3|Primary Segmentation
3|Tree Graph
4|Tools Graph
5|Iterative Segmentation
5|Split Graph
6|Special Segmentation
6|Use Graph
7|Agent Graph
7|Fabrication
8|Mesh Info
8|Visualize Graph
9|Other Tools

Shortest Paths in a weighted mesh graph

Component Index > Ivy > 3|Tree Graph > 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 calculationGoo
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 visualizeGoo

© 2018   Created by Robin Rodricks and Andrew Heumann.   Hosted by

Badges  |  Report an Issue  |  Terms of Service