Contains Theory and codes on problems related to network/graphs and trees
- Traveling Salesman
- Maximum Flow
- Transshipment
- Icosian Game
- Finding Eulerian circuits
- Probabilistic Graphical Models and ML
- Capacitated Facility Allocation using graph algorithms
- Genetic Algorithm and Crossover
- Dijktsra's Algorithm
- Bellman-Ford
- Floyd-Warshall
- Tarjan's Strongly connected components
- Ford-Fulkerson (Max-Flow)
- Bipartite Matching
- Edmond Karp
- Dinic's Algorithm
- Genetic Algorithm
- Dynamic Programming (Memoization and Tabulation)
- Graph Problems
- Map Networks