Reduction Rules 1-5
1. [x] Loop deletion
2. [x] Split into strong components (@phaker)
- [x] Tarjan's algorithm `petgraph::algo::tarjan_scc`
3. [x] In neighbor shortcut (@ken_die)
4. [x] Out neighbor shortcut (@ken_die)
5. [ ] Two disjoint Cycles (@ken_die)
- [x] Implement and test Karger min-cut
- [ ] Implement and test Stör min-cut
- [x] Implement and test Edmonds-Karp min-cut
issue