SUM[1..n]( di ) = 2m
You are to provide the file set.py. The program to run is provided, test-set.py.
Advance warning: You might be asked to use your disjoint set system in your homework two weeks from now.
Provide some nice graph, 7-10 nodes, fairly dense. We gotta show you guys DOT one of these days. Anyway, just output the transitions, or the adjacency list. Then show us each of the spanning trees.
Provide another target called prob2-view that displays your source code in a pager (like less) on stdout.