KnowraSpanning treeLinked fromLinked fromThe 9 pages that link to Spanning tree, each with the reason it gives.All 9Broader topic 5Related 2Narrower topic 2Kruskal's algorithmNarrower topic: Kruskal's output must connect all vertices without forming cycles.BEST theoremNarrower topic: An in-arborescence is the directed, rooted form counted in the theorem.