Tufts Comp160 - Graphing Algorithms Simulations

Developed by RafiLabs

The following application simulates the following algorithms: Breadth First Search (BFS), Depth First Search (DFS), and Prim's Minimum Spanning Tree (MST). All the graphs in use are undirected and weighted. You can run the application in two modes: instantaneously or step-by-step. See instructions below. The implementation of these algorithms is based off of Introduction toAlgorithms, third edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.

All algorithms are coded in JavaScript (jQuery). You can view the source code here.

This application utilizes the arbor.js JavaScript graph visualization library and the JavaScript MinHeap.js data structure.


1. Select graphing algorithm:

2. Select graph type:

3. Start the algorithm - instantly or step-by-step:

Graph Explanation:

Other Notes: