Classic lem-in problem. The graph is undirected. Each edge has a max capacity of 1. Except for the start and sink nodes, no more than 1 ant can occupy a node. The goal of th
