Draftly implement graph
Implement Randomized MinCut

Random Contraction Algorithm by Karger
Fix typo
Optimize edges' GetHashCode method
Implement real adjacency list graph
Add additional members to Graph
Implement DFS algorithm
Exclude long running test from run
Extend DFS with control over visited vertices collection
Reorder action parameter to make it more usable
Remove laziness from edges' GetHashCode method

Works faster on large graphs and memory footprint is lower.
Add debuger display attribute to AdjacencyListGraph
Implement MinPriorityQueue