What is a spanning Tree in data structure

Question

Give an efficient algorithm.

Answer 1

1. A spanning tree is a tree associated with a graph.
2. All the nodes of the graph appear in the tree exctly once.

You would like to know "A minimum spanning tree" - it is a spanning tree such that the total edge weight between nodes is minumum.