An implementation of a graph ADT written in javascript along with some basic graph traversals.
This is a set of libraries I wrote to practice for my Algorithms & Data Structures final. I wanted to practice the material while improving my knowledge of javascript.
- A traversals library which implements a number of common algorithms such as Dijkstra's and Topological Sort.
- A graph library which houses constructors for vertices, edges, and a graph object.
- A visualizer using the paper.js framework.
See the demo here: http://jsnelgro.github.io/jsGraph/
Note: not everything works yet. Currently, graphs built with the visualizer can only run Dijkstra’s and Prim-Jarnik's. Edges are also always randomly weighted and undirected.