TLD or kmj, about my Dijkstra example

[sans-hubris]

I just realized that I didn't change it from what was required for a class I wrote it for. The algorithm was written for an assignment I had and we had to repeat the algorithm 100000 times to test the speed of our algorithm. Not that it matters a great deal whether you change it or not or anything, but I thought I'd tell you guys just in case anyone was wondering. Also, I noticed that you have my name listed twice in the Contributors section. Also, when describing the cost matrix, I just realized that I said that zero represents infinite, which is clearly not true.

I'm not actually asking either of you to change it, it just made me feel better to tell you guys that.

For anyone else that's curious as to what the heck it is that I'm talking about, I wrote an implementation of Dijkstra's algorithm (http://www.codeexamples.org/cgi-bin/c2h/hl.cgi?type=HTMLdetail&filename=dijkstra.cpp).
[ 05 December 2001: Message edited by: Muad Dib --formerly ndogg ]

[ 05 December 2001: Message edited by: Muad Dib --formerly ndogg ]

[ 05 December 2001: Message edited by: Muad Dib --formerly ndogg ]

[TheLinuxDuck]

Dood...

First, thanks for the contribution to the site. (^= Every bit helps.

Second, I fixed it so that your name is only listed once (and fixed other duplicate names).

Third, I updated the source code so that it reflects the things you commented on.

(^=

w00t!

[sans-hubris]

:cool: thanx

Hmm, I got eight extra credit points for mine being one of the two fastest versions of the algorithm in the class, but I guess the other person's was better at handling larger graphs, while mine was better at handling smaller graphs?! I'm not sure how to change it to make it process larger graphs faster. That, to me, short of using a priority queue (which I tried initially, but never got working, and not entirely sure why) is the fastest I could possibly make it.