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! ❤️
Minimum Spanning Tree
It creates Minimum Spanning Tree. It is a network in which all nodes are connected without any cycle, with the minimum possible total edge weight. An alternative is to provide a pre-existing network containing all possibilities of connectivity with the points. Otherwise, it will calculate the result with all possible connections between nodes given by Delaunay-Mesh.
Inputs
| Name | ID | Description | Type |
|---|---|---|---|
| Base Points | P | Points to Create Network | Point |
| Node→Node | N→N | Node→Node Topology. It indicates all nodes which are connected to one other. | Integer |
Outputs
| Name | ID | Description | Type |
|---|---|---|---|
| Node→Node | N→N | Node→Node Topology. It indicates all nodes which are connected to one other. | Integer |
| Edge→Node | E→N | Edge→Node Topology. This indicates a pair of nodes that define one edge. | Integer |
| Lines | L | MST Network lines | Line |
Site design © Robin Rodricks.
Heteroptera and associated data © 2024 Amin Bahrami (Helioripple Studio).
Rhinoceros and Grasshopper are registered trademarks of Robert McNeel & Associates.
Hosted by GitHub