- Clarke is a patient with multiple personality disorder. One day he turned into a learner of graph theory.
- He learned some algorithms of minimum spanning tree. Then he had a good idea, he wanted to find the maximum
- spanning tree with bit operation AND.
- A spanning tree is composed by n−1 edges. Each two points of n
- points can reach each other. The size of a spanning tree is generated by bit operation AND with values of
- n−1 edges.
- Now he wants to figure out the maximum spanning tree.