C — Getting deeper into algorithms.
Lem_in is essentially a graph and flow problem. Move x amount of "ants" Through a graph consisting of connected nodes.
We implemented the Edmonds-Karp algorithm, in which we find the shortest paths using breadth-first search while also allowing negative flow to get the optimal paths.
Dinic algorithm in Wikipedia
Article and some code on Ford-Fulkerson
Another 42 student's article on Lem_in
Adjacency matrix in Wikipedia
Pretty good video on hashtables
Code of that video
Another 42 lem_in
Edmonds-Karp theory in video