This
C++ tool turns scientific-paper review assignment into a maximum-flow problem. Submissions and reviewers form the two sides of a bipartite network; capacities encode minimum reviews per paper, maximum workload per reviewer, and primary/secondary expertise rules.
Both Ford-Fulkerson and Edmonds-Karp are available so their behavior and complexity can be compared on the same datasets. The application supports an interactive terminal UI and deterministic batch mode, writes assignments to CSV, and can test how removing a reviewer affects coverage.
Flow-network model
