An interactive web application for visualising classical graph algorithms.
This project was developed to accompany the lecture Combinatorial Optimisation at RWTH Aachen University. It is designed to help students understand how algorithms work by showing them step-for-step on different graphs. Since the implemented algorithms are standard, the tool can also be useful for students and educators beyond RWTH.
- Step-by-step algorithm execution
- Interactive quiz-like sections where users must determine the next step themselves
- Interactive graph builder with drag-and-drop node placement
- Kruskal
- Prim
- Dijkstra
- Moore–Bellman–Ford
- Ford–Fulkerson
- Edmonds–Karp
- Dinic
- Edmonds’ Matching Algorithm
- Christofides
Setup instructions, development details, and debugging information are available in the project wiki:
https://github.com/CombiRWTH/graph-visualiser-website/wiki
Contributions are welcome! Feel free to open an issue or submit a pull request!