Open EllingOftedalKV opened 2 months ago
The problem we are facing seems to be a "Undirected Cyclic Graph" and we need to turn it into an "Directed Acyclic Graph".
The summer students had used a Depth First Search, however it could be useful to investigate closer Breadth First Search and Topological Sort.
There are also some
To properly enable calculation of hierarchy and direction of the river network small and large cycles needs to be resolved and "broken".