Algorithms exercise comparing three graph representations — adjacency matrix, edge list, and successor lists — by timing BFS and DFS on each. Graphs are generated randomly (acyclic, with a given saturation) or entered by hand.
Run with python3 main.py.