Dijkstra's Algorithm April 27, 2013 Dijkstra's algorithm. It picks the unvisited vertex with the lowest-distance, calculates the distance through it to each unvisited neighbor, and updates the neighbor's distance if smaller. Mark visited (set to red) when done with neighbors. Share Get link Facebook Twitter Pinterest Email Other Apps Labels Dijkstra's Algorithm network science Share Get link Facebook Twitter Pinterest Email Other Apps