GraphTheory
Graph Algorithms is a C++ project that implements fundamental graph algorithms like Breadth-First Search (BFS) and Depth-First Search (DFS). It focuses on clear implementations of graph representations such as Adjacency Matrix, with plans for Adjacency List and Edge List. This project serves as an educational tool for understanding graph theory.
Install / Use
/learn @Interrupt101/GraphTheoryREADME
Graph Framework: Implementation of Graph Algorithms
This repository features a robust and versatile framework for graph theory, offering implementations of a wide range of graph algorithms. Designed for both educational (and practical applications), the library includes essential algorithms for graph traversal, shortest path calculations, network flow, and more.
Implemented Algorithms in Graph Framework
This repository includes the following graph algorithms (Some of them are still in development):
- Graph Traversal
-
Depth-First Search (DFS)
-
Breadth-First Search (BFS)
- Shortest Path Algorithms
- Dijkstra's Algorithm
- Bellman-Ford Algorithm
- Floyd-Warshall Algorithm
- Minimum Spanning Tree
- Kruskal's Algorithm
- Prim's Algorithm
- Network Flow Algorithms
- Ford-Fulkerson Method
- Edmonds-Karp Algorithm
- Graph Coloring Greedy Coloring Algorithm
- Topological Sorting
- Kahn's Algorithm
- Depth-First Search-based Topological Sort
- Connected Components
- Tarjan's Algorithm for Strongly Connected Components
- Kosaraju's Algorithm
- Other Algorithms
- Eulerian Path and Circuit
- Hamiltonian Path and Circuit
