Dijkstra's Algorithm

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.

All the Best to Boston

Here is to a bit of solidarity with the people of Boston following the attack on the Boston marathon yesterday. Such a despicable, cruel crime met with honor courage and self sacrifice by those immediately effected.