Simple Dijkstra Implementation in JavaScript

This is a simple javascript implenetation of Dijkstra's Algorithm to find the minimum distance between two points. The edges are weighted randomly, and only exist fo 75% of the possible edges. Once the algorithm begins, "visited" vertices will turn gray, the vertex under current consideration yellow, and when complete, the path will be in red. Status messages are below, as well as info for any individual node.

Quick overview of the Algorithm: (click for description)

Created using jQuery and d3.js

Select any two vertexes to begin the calculations.

Check here for Vertex information.