Hi Guys, I am just playing with dijkstra algorithm in C# and got it working good but now I want to modify it to get all the possible paths from the start and target nodes. Any advise?

In this example, the flow can be managed by speed adjustment of the pump or position of a valve. The result of the change ordered from the controller is stable and is generally fast and repeatable.