Graph Algorithm Visualiser

JavaScript

Date: April 2017

A visualiser which displays the process of graph algorithms on complete graphs such as: Prim's, Kruskal's, Graham Scan, Nearest Neighbour and 2-Opt. The project was primarily a learning tool to help me improve my ability using JavaScript and better understand graph algorithms.

Graph Algorithm Visualiser

Features

  • Visualisation of the graph, unvisited nodes, visited nodes and edges connecting them.
  • Choice of low number to high number of nodes in the graph
  • Algorithm statistics such as: Tour length, Minimum Spanning Tree length, Convex Hull nodes.
  • Convex Hull Algorithms - Graham Scan
  • Minimum Spanning Tree Algorithms - Prim's, Kruskal's
  • Hamiltonian Path - Nearest Neighbour, Nearest Neighbour with 2-Opt, Random Tour
  • Minimum Matching - Greedy (variant of Kruskal's algorithm)
Graph Algorithm Visualiser

Screenshots

Graph Algorithm Visualiser
Graph Algorithm Visualiser
Graph Algorithm Visualiser
Graph Algorithm Visualiser
Graph Algorithm Visualiser
Graph Algorithm Visualiser