GraphAL is a framework for graph algorithms visualization.
This framework shows how work the ones of the most popular graph algorithms:
- Depth First Search (DFS)
- Breadth First Search (BFS)
- Dijkstra's algorithm
- Prim's algorithm
- Kruskal's algorithm
- Floyd–Warshall algorithm
- Bellman-Ford algorithm (beta)
- Ford-Fulkerson algorithm (beta)
Beta functions does not guarantee correct execution!
First of all, you should compile two dynamic link libraries "generation.dll" and "algorithms.dll". Their source code contains in src/generation/ and src/algorithms/ folders appropriately. Those dll files should be in src/ folder. Run app.py. Have fun!
- Python v3.8+
- PySimpleGUI v4.19+
- NetworkX v2.4+
- Matplotlib v3.2+
🍭 @jswark (Graph data)
🍏 @egortrue (Graph algorithms)
🍓 @AndreyBakurskii (UI/UX design)