The used in this article may not be easy for everybody to understand. You can help Wikipedia by reading, then simplifying the article. ( April 2014)Dijkstra's algorithm is an that works on groups of things connected by distances. It finds the shortest ways to move from one first thing to each other thing in the graph.
Dijkstra's algorithm, named after its discoverer, Dutch computer scientist Edsger Dijkstra, is a greedy algorithm that solves the single-source shortest path problem for a directed graph with non negative edge weights. For example, if the vertices (nodes) of the graph represent cities and edge. Finding the shortest path, with a little help from Dijkstra! If you spend enough time reading about programming or computer science, there’s a good chance that you’ll encounter the same ideas.