lem-in

In this project, I used the depth-first search algorithm to find possible paths in the graph. Then I find paths that do not overlap. I counted the minimum number of objects for each path Print data on the console. If the output is redirected to the program visual-hex We can track the motion of objects step by step using the arrows on the keyboard Esc closes the window.