06-20-2005, 03:36 AM
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]
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]
