Codes written for partial completion of the course Working with Networks at IIMA
Enter this code in the cmd prompt in the directory in which these code files are downloaded before importing the necessary libraries.>> python setup.py build_ext --inplace For the cython HTML generation type the below code.
>> cython -a algorithms.pyx
- Search Algorithms: BFS, DFS
- Shortest Path algorithms: (Modified) Bellman ford, Floyd Warshall, Dynamic programming, Second shortest path, K-Shortest path algorithm (Yen's algorithm), arbitrage algorithm.
- Heuristics algoithm: A* (Dijkstras).
- Miscellaneous: Optimal Loop, Binary search
- Maximum Flow: Ford Fulkerson (Edmonds Karp Implementation), Push-relabel, maxflow-mincut.
- Minimum cost flow: Capacity scalling, cycle cancelling.
- Demand supply algos: Northwest, minimum cost, vogel's approximation.
- Bi-Directional Dijkstra