Comments on: Dijkstra’s algorithm in C#

By: Diogo

Diogo — Sat, 05 Nov 2011 22:49:42 +0000

First of all, thank you so much! It’s the most simple implemenation that I’ve seen for C#. But I just didn’t understand how to obtain the shortest path between 2 nodes, could anybody explain me in details? I’m new on programming and need it to do a college work. Thanks in advance.

By: sadik

sadik — Wed, 12 Oct 2011 05:57:37 +0000

hi…

i am new to c#….i want to ask you what to do after i run the program…i donk know where to put the input data…could you tell me how to run a small example please…

By: Stefan

Stefan — Tue, 04 Oct 2011 10:48:01 +0000

Very useful thanks.

By: Pedro

Pedro — Fri, 06 May 2011 15:13:46 +0000

Very nice implemention, clean and effective.

By: Mehri

Mehri — Mon, 10 May 2010 17:22:40 +0000

Thanks, It was useful;)

By: Jeppe Andersen

Jeppe Andersen — Tue, 05 Jan 2010 11:44:55 +0000

Im glad you found it useful!

- Jeppe

By: shideh

shideh — Tue, 05 Jan 2010 07:54:27 +0000

thank you,thank you
i am working on my thesis for transportation engineering MS degree.
I am not very good at programming and finding even a small part of my long and troublesome code makes me very happy!
i require to find shortest path approximately 2000 times in a part of my program to solve my whole network.
it is ready here!
thank you…….
I Love Denmark:)