Fundamental Algorithms Course & Labs
1.BFS & DFS
- minimum cycles / circuits / roads in unweighted graphs
- determination of the connected components, of a partial shaft of a given graph
- edges and critical points, biconnected components
- topological sort v1 & v2
2.Bipartite graph
3.Shortest path: Bellman Ford algorithm (v1 & v2(optimized)) && Dijkstra && Floyd-Warshall algorithm
- critical path
- detect negative cycle
- DAG algorithm shortest path
4.Edmonds Karp (v1 & v2) && Ford-Fulkerson
- flux
- minimum cut
5.Optimal Spanning Trees: Kruskal (v1 & v2) && Prim's algorithm
- Second Best
- Reverse Delete
- Clustering
6.Eulerian path