This repository contains some of my COL351 coursework.
Topics covered:
-
Graphs, traversals, connectivity, strong connectivity, topological sorting, shortest path algorithms
-
Greedy algorithms
-
Backtracking, divide and conquer
-
Dynamic programming
-
Flows, bipartite matching