search

ngocpq / adasim

Automatically exported from code.google.com/p/adasim
MIT License
0 stars 0 forks source link

Thoroughly test Dijstras Strategy #16

Closed GoogleCodeExporter closed 9 years ago

GoogleCodeExporter commented 9 years ago 
Take a known graph (for example the one from the Wikipedia page on Dijkstra's 
algorithm), translate the edge-weigthed graph into a node-weighted graph and 
write a number of test cases that check if the algorithm correctly computes the 
costs. 
Don't forget test cases for errors like asking for a path between two nodes 
that don't exist, for nodes that are not connected, etc.

Original issue reported on code.google.com by wutt...@gmail.com on 29 Nov 2011 at 11:28

GoogleCodeExporter commented 9 years ago 
Your current implementation of Dijkstras algo assumes that nodes have 
consecutive IDs starting from 0.
That is no longer true, as our configuration now allows arbitrary numbers. If 
the numbers are not consecutive (which is commonly the case with randomly 
generated simulations), then the implementation will no longer work.

Original comment by wutt...@gmail.com on 6 Dec 2011 at 11:21

GoogleCodeExporter commented 9 years ago 
This will be fixed together with the new, more general implementation of a 
shortest path strategy.

Original comment by wutt...@gmail.com on 9 Dec 2011 at 9:54