data structures - How to test efficiently Dijkstra algorithm -


i working on existing implementation of dijkstra , 1 of deliverable test whether implementation efficient solution issue @ hand or recommend alternate algorithm. question is... how should baseline existing dijkstra algorithm compare alternate? narrow scope, client using dijkstra dynamically chose best tariffs plan b2b consumers. make sense?

dijkstra algorithm find shortest path in graph. test , see how effective that, need compare other algorithms. bellman–ford algorithm, a* search algorithm , etc.

important notes

other performance, there other important issues dijkstra doesn't work negative values. why bellman-ford has been used instead in many problems.

also, dijkstra has different implementations.

dijkstra's algorithm list o(v 2) while dijkstra's algorithm modified binary heap o((e + v) log v) , dijkstra's algorithm fibonacci heap o(e + v log v). bellman–ford algorithm o(ve).

conclusion

if need see 1 better work, first see parameters matters , compare ones can suitable. if want, can test them since have been implemented other people before. need give them graph


Comments

Popular posts from this blog

javascript - Thinglink image not visible until browser resize -

firebird - Error "invalid transaction handle (expecting explicit transaction start)" executing script from Delphi -

mongodb - How to keep track of users making Stripe Payments -