Dijkstra's shortest path algorithm

[Lithium]

I chose to write a program to find shortest paths in a network for my applied networking technologies "exam".

you can get it at: http://www.fbtk.net/phpBB2/download.php?id=108

Dijkstra's shortest path algorithm is cool, because it finds all the shortest paths to a single vertex, in one run, and it's worst case speed is vertex_count * max_edges_for_each_vertex.

I'm still not sure if I understand fully how it works... I know how to use it, so that's good enough for now. It's a very usefull algorithm to know, espetially for game programming.[/url]

[Agamemnus]

Could you define vertex and edge please.

[rpgfan3233]

Edit: I had originally posted something really long, but I decided to shorten it.

A vertex is a point and an edge is a line made by connecting 2 vertices/points.