Q. Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called (Solved)
1. subgraph
2. tree
3. hamiltonian cycle
4. grid
- b. tree
1. subgraph
2. tree
3. hamiltonian cycle
4. grid