Graph Theory Playground is an under-construction tool to enable visualization of graph theory concepts and algorithms.
Try it at neerajadh.gitlab.io/graph-playground. Please be warned that the project is still very much in it's infancy and there are a lot of things missing and things that do not work.
- Undirected and directed graph creation
- Multitasking with tabs
- Curved (movable) edges
- Four auto-layout algorithms
- Save and open graph from local device
- Weighted graphs
- Editable vertex labels
- Tool-based design with tools to delete objects, add/edit and move objects
- Bookmarking of graphs to save graphs in the browswer
- Algorithm visualizations:
- Minimum Spanning Tree Algorithms:
- Kruskal'ls Algorithm
- Prim's Algorithm
- Search Algorithms:
- Breadth First Search
- Depth First Search
- Shortest Path Algorithms:
- Dijkstra's Algorithm
- Walk-Finding Algorithms:
- Fleury's Algorithm for Euler Trails and Cycles
- Bellman-Held-Karp Algorithm for Hamilton Paths and Circuits
- Decomposition Algorithms:
- Hopcroft and Tarjan's Algorithm for Biconnected Components and Articulation Points
- Traveling Salesman Problem:
- Exact Algorithms:
- Bellman-Held-Karp Algorithm
- Approximate Algorithms:
- Nearest Neighbor Heuristic
- Nearest Insert Heuristic
- Cheapest Insert Heuristic
- Exact Algorithms:
- Minimum Spanning Tree Algorithms: