Design your own graph then run a graph algorithm on it to learn how it behaves.

+ Directed and undirected graphs with edge weights
+ Step by step explanation of the algorithm

+ Depth first search
+ Breadth first search
+ Kruskal's Algorithm for MSTs
+ Prim's Algorithm for MSTs
+ Dijkstra's Algorithm for shortest paths
+ Bellman-Ford Algorithm for shortest paths

+ More algorithms to come...

Designed by and for students at university studying algorithms