Looking to see if Dijkstra’s algorithm can be used to calculate Derived Relations in Archi. As it is implemented now, it is possible to take a long time to calculate all possible paths between node BA1 and node BA2.
Turns out I couldn’t do it. It seems that you really do have to traverse all possible paths just in case the weakest link is on that path. Anyone else got an idea?
