karger.py reads in adjacency list as a Python list of lists
Updated karger.py with Rand Contraction Algorithm and removes self loops
Properly update adjacency list when about to merge two vertices
Spotted problem with poping list elements while removing self-loops
Added Minimum_Cut function to calculate it via Karger's algorithm
Fixed logic with selecting a random edge
More playing with logic with selecting a random edge
Split karger.py into separate functions for easier debugging
Clean up comments
Clean up comments more
Updated karger.py to not select the same vertex by accident; flaw in code to select the list index of the vertex
Turns out, having a correct test data file is important...
karger.py seems to work correctly and generate correct values, yay