This repository contains implementations of graph theory algorithms in Python. There is a test folder in which all the algorithms are test with testcases using Python built-in unittest module.
The main test.py file is suggested by my friend u/MannerShark (on reddit).
These algorithms are originally from William Fisets Graph Theory Algorithm Playlist
- Breadth First Search
- Depth First Search
- Finding Connected Components
- Dungeon Solver
- Topological Sort
- Lazy Dijkstra Algorithm
- Eager Dijkstra Algorithm
- Bellman Ford Algorithm
- Floyd Warshall Algorithm
- Shortest Path in Directed Acyclic Graph
- Tarjans Algorithm
- Bridges Finding Algorithm
- Eulerian Path Algorithm
- Prims Algorithm
- A* Algorithm
- Kahn's Algorithm