When I say "Given (di)graph G as input", I mean we are given the adjacency lists for the (di)graph, i.e., Adj[v] for every vertex v in the (di)graph