This repository contains the Python implementations and simulations of key Graph Algorithms which are fundamental for solving problems related to network routing, optimization, pathfinding, and spanning trees.
- Dijkstra’s Algorithm
- Dynamic Programming Approach (Bellman-Ford Algorithm)
- Floyd-Warshall Algorithm
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Prim’s Algorithm
- Kruskal’s Algorithm