When running Dijkstra's algorithm on a weighted graph from vertex u, what following conditions are (independently) sufficient to guarantee that the Dijktra's algorithm outputs are the shortest paths from vertex u to the accessible vertices of the graph?
What following property best describes the functioning of Dijkstra's algorithm, starting from a vertex u?
The Dijkstra's algorithm maintains two data structures along the process. What are they?