Hey Community, I have started to learn how to code and some algorithms. I have been stuck on finding Minimum spanning trees. I know there are Kruskals and Prims to solve this type of problem but I want to know the brute force solution to this concept. Can anyone help me by coding it in CPP, so I can understand how to generate all spanning trees.