14,603,917 members
Rate this:
See more:
My Professor ask me to show him how Dijkstra Algorithm will be efficient to get the shortest path. He said that it needs to be apply in an application to prove that this algorithm will work. But i believe this algorithm can be efficient or can works through study and apply in different scenarios. So guys how can i test the Dijsktra's algorithm through study? Or do you know a study that already proven this or scenarios. I just need to prove my Professor that it can be efficient in getting the shortest path. Thanks in advance.
Posted
[no name] 13-Jul-14 21:39pm

So.... your "question" is "Do my research for me for my homework assignment"? It's your assignment, don't you think that you should at least attempt to do it yourself?
Kim Paulene Opulencia 13-Jul-14 21:49pm

Im not asking for you to do it for me, im asking maybe you know some studies regarding this, im doing research and i cant find thats why im asking thats why im asking help. this is a site wherein we have a freedom to ask but people here give me mean comments. btw thankyou.
George Jonsson 14-Jul-14 0:56am

Of course it is an efficient algorithm and of course it works in various scenarios.
That study has already been done by Dijkstra. (That is the reason why we still use his work today)
I guess what your professor want is for you to prove it again all by yourself.
So pick up the spoon and start learning to eat.
The reason you get mean comments is because first you ask for a suitable project, then for which algorithm is the best and now you ask where you can find finished paper on the subject.
Kim Paulene Opulencia 15-Jul-14 1:29am

Thanks Sir George! You are the first person who answer me here in a good way.

Rate this:

## Solution 1

This is step-by-step for one way to check the efficiency.
1. Implement Dijkstras algorithm in a programming language of your preference.
2. Find an existing implementation or implement a second algorithm.
3. Run the algorithms of the same input data on the same computer.
4.a Verify that the shortest path actually was found.
4.b Compare the execution time between the two algorithms.
4.c You can also check memory used, CPU time used etc.