edge list for the first entry where one vertex is accepted, and the
other is not. This is an O(V2), where V is the number of
vertices. We could also contract the list after each accepted edge, but
that doesn't change the overall time complexity.
Tips: You can preview the content of files by clicking file names^_^