It's a set of exercise of implementing some alogrithm in graph theory for example breadth first search, depth first search, Dijkstra's Algorithms, topological sorting,… etc. And in the metro folder, it is a practical case of implementing a route planner of métro Paris.