Graph Algorithm Visualiser
Dive into the captivating world of graph algorithms with a web application, designed to provide a visual and interactive experience. Explore the intricate elegance of algorithms on randomised nodes, offering an illuminating understanding of their real-world applications.
JavaScript
Materialize
Nearest Neighbour with 2-Opt
Project Highlights
- Comprehensive Visualisations: Immerse yourself in the graph's dynamic visualizations, revealing unvisited nodes, visited nodes, and the edges that connect them. Witness the algorithms in action as they traverse the nodes and create complex structures.
- Node Count: Tailor your exploration with the choice of a low to high number of nodes, allowing you to study algorithm behaviour and performance under varying conditions.
- Algorithm Insights: Delve into algorithm statistics, providing valuable insights such tour length, minimum spanning tree length, and convex hull nodes, helping you understand the efficiency and outcomes of each algorithm.
Algorithms
- Minimum Spanning Trees: Witness the elegance of Prim's and Kruskal's algorithms in action as they construct minimum spanning trees, connecting nodes in the most efficient way possible.
- Hamiltonian Paths: Explore the art of Hamiltonian paths with Nearest Neighbour, Nearest Neighbour with 2-Opt, and Random Tour algorithms, unraveling the mysteries of traversing all nodes once.
- Convex Hulls: Experience the mesmerising Graham Scan algorithm as it constructs convex hulls, an essential concept in computational geometry.
- Minimum Matching: Discover the power of the Greedy algorithm, a variant of Kruskal's, as it constructs minimal matchings, optimizing connections in the graph.
Screenshots
