These are my solutions for the problems given in the Algorithms and Graphs 2 subject at CTU FIT in 2022/2023. Both were the fastest solutions submitted in that semester.
Problem of finding strongly connected components.
Finding of the smallest cut in a flow network. Implemented using Ford-fulkerson (in fact Edmonds-Karp) algorithm, Dinitz and Push–relabel (Goldberg) algoritm.