C++ implementation of Max-flow Algorithm (Ford-Fulkerson) for a game similar to the famous Baseball Elimination Problem. In this project, the flow network is built with linked lists (somewhat inefficient) and can be improved using matrix-based graph representation for readability.
