top of page

Automatic routing conduit with Dynamo

Dijkstra's algorithm

The cables will follow a path starting from the panel and connecting to the device following the nearest pan system. So how do we find this best way? We will use Dijkstra's algorithm in dynamo with python.


Dijkstra's algorithm algorithm is a computer method or algorithm that determines the most efficient path between two points in a graph or network. It is primarily used to solve the challenge of determining the quickest or most efficient route from a starting point to a destination while taking into account specific limits or impediments. These algorithms investigate the graph by studying different paths and making decisions based on a variety of parameters, including distances, costs, and heuristic estimates, to discover the optimum path.

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.



The results

Finally, we now have all the channels in the model and the script also generates the plans of the channels and colors them according to their type.

bottom of page