ILP Part 64 – BFS, graph connectivity, spanning tree

This is the sixtieth 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 actually implemented BFS-like algorithm in the graph with ILP which can be also used for testing graph connectivity (if two nodes are connected … Continue reading ILP Part 64 – BFS, graph connectivity, spanning tree