###
Graph Traversal /
Dijkstra's Algorithm
»

The algorithm finds the shortes paths between nodes.
It is used for weighted graphs.
It maintains two sets, visited and unvisited vertices.

How is Dijkstra's algorithm used in graphs?
Is the algorithm used for weighted graphs?
What sets is the algorithm maintaining?