The picture shows the relation between lids and bottles. If there is an edge between a lid and a bottle that means that that bottlle can be closed with that lid
How can i say that all bottles can be closed with lids using a graph traversal method?
The picture shows the relation between lids and bottles. If there is an edge between a lid and a bottle that means that that bottlle can be closed with that lid
How can i say that all bottles can be closed with lids using a graph traversal method?
Looks like the marriage/perfect matching problem.
yeah what traversal algorithm should i use to prove this?
since graph is bipartite by definition, can you just show that graph is connected?
