Lem-in is a flow maximizing algorithm for optimizing one-way unit progression in a network. It uses a specialized version of Edmonds–Karp method to calculate maximum flow for any single-source and single-sink network that only has capacities of one in all of its edges.

The analogy for this type of system would be an anthill. Inside the anthill you have rooms and between the rooms there are tunnels. The tunnels are narrow and only one ant can move through them at a time. We need to find the optimal routes any number of ants need to take to get from one end of the anthill labyrinth to the other while not bumping to each other.

(Obviously the final logic of the algorithm doesn’t consider the cute life of ants, but instead bombards the problem with rigorous mathematics and overly exact flow network notation.)

The project comes with assorted tools for random network generation, route analysis and more. For human-understandability, I have also included a visualizer for grasping the base concept of the problem and the solution algorithm.

Algorithm written in Core C.

Visualizer written using Python (DOT), JavaScript, HTML and Core C.

Public repository of the project can be found here.