Full Article - [ Ссылка ]
-Dijkstra algorithm is a greedy algorithm.
-It finds a shortest path tree for a weighted undirected graph.
-This means it finds a shortest paths between nodes in a graph, which may represent, for example, road networks
-For a given source node in the graph, the algorithm finds the shortest path between source node and every other node.
-This algorithm also used for finding the shortest paths from a single node to a single destination node by stopping the algorithm once the shortest path to the destination node has been determined.
