Lem In

A graph theory project focused on finding the maximum flow through a network. Given a set of rooms and tunnels (an anthill), the goal is to move a set of ants from start to end in the fewest number of turns. It typically involves implementing algorithms like Edmonds-Karp or Dinic to find disjoint paths and optimize traffic flow.