The aim of this repository is to provide customizable components for generating structured networks using pathfinders and search algorithms as well as simple example files of the possible combinations and integration to an iterative process.
Reference: https://www.youtube.com/watch?v=yOTK81HDSqM&list=PLZF2qDQgHACyldoK3DC9HSNgmNKBbDVlW&index=21
- A-Star and Dijkstra's algorithm components to find the shortest path through topography or grid a points.
- A first version of these components that only works with grid-like quadmeshes or grid of points.
- A second version that works with all kind of mesh topologies.
Create a tree with the minimum number of segments to connect a group of points using the Prim's algorithm.
