ILP Part 54 — Graph connectivity
This is the fifty fourth part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra Last time we saw how to implement max flow in ILP. Today we are going to use this approach to make sure that the graph is … Continue reading ILP Part 54 — Graph connectivity