Write some code in CoffeeScript and hit run. The graph will show what's going on.

Use the following methods on VG:

Try out the prewritten algorithms for syntax examples.

Notes:

Email me at thedufer at gmail dot com with comments/questions!

Use the following methods on VG:

- getNodeCount(): get number of nodes in the graph
- getAdjacentNodes(n): returns an array of objects like { node, cost } for each node adjacent to to node n
- setCost(n, m, cost): set the cost of the edge from node n to node m
- highlightEdge(n, m[, color]): highlight the edge from node n to node m with color (default: "red")
- unhighlightEdge(n, m): unhighlight the edge from node n to node m
- highlightNode(n[, color]): highlight node n with color (default: "red")
- unhighlightNode(n): unhighlight node n to node m
- addEdge(n, m, cost): add an edge from node n to node m with cost cost
- locals: A map (initially empty) where you can store primitives that you want to see as the sort animates.

Try out the prewritten algorithms for syntax examples.

Notes:

- Nothing will display if there is an infinite loop.

Email me at thedufer at gmail dot com with comments/questions!