Search:

Type: Posts; User: matlyisk

Search: Search took 0.07 seconds.

  1. Re: [.NET 3.5+] Dijkstra's Algorithm (Shortest Path Algorithm)

    Ah, apparently your code is for undirected graphs, I see. :afrog:
    I have changed the GetNeighbors method and the item property of the edgecollection and I think it works now :)
    ...
  2. Re: [.NET 3.5+] Dijkstra's Algorithm (Shortest Path Algorithm)

    Hi, very cool program!

    I tried it with a small example and it did not work correctly though.
    Take this Graph:
    i j d(i,j)
    1 2 100
    1 3 30
    2 3 20
    3 4 10
    3 5 60
Results 1 to 2 of 2



Click Here to Expand Forum to Full Width