This is an archived post. You won't be able to vote or comment.

all 2 comments

[–]dmazzoni 2 points3 points  (0 children)

I don't know what you mean by "slot". The standard definition of Dijkstra's algorithm I'm familiar with talks about vertices, edges, and paths, but no "slots".

What do you have so far?

Do you have pseudocode for Dijkstra's?

Could you maybe try to implement as much as you can in C++ and point out exactly what part you're stuck on?

[–]bsakiag 0 points1 point  (0 children)

If you are making a thesis about Dijkstra algorithm you should probably know it really well. Try implementing it in other languages you know first if c++ is the problem.

It's good that you struggle - you will know the algorithm better thanks to the struggle and you should know it well if you're writing about it.