I am trying to do as many examples as I can to practice Dijkstra's Algorithm however, I am confused with this particular problem as I do not know how to go about it. To solve questions like these, how should I go about them? I tried to follow online powerpoint presentations however the graph algorithms are only making me more confused.
This is the specific question I'd like to know how to go about step-by-step for better understanding:
Using Dijkstra’s algorithm, for the following digraph, find the shortest path from 0 to each of other four nodes.
Thank you in advance for your time and patience.