Hello all... I have several nodes (undirected graph, bidirecional) ... Each two nodes have a distance...
1 - How can I create that network using QuickGraph? 2 - What is the right algorithm to calculate the best shortest path bettween two nodes (Considering that may pass in other nodes before, example : best path A->B, passing in C and D)
Thanks