InterviewSolution
Saved Bookmarks
InterviewSolution
| 1. |
What is a spanning Tree? |
|
Answer» In the DOMAIN of Data Algorithms, a SPANNING TREE T is basically a SUBGRAPH of an undirected graph G that is a tree that INCLUDES all of the vertices of G(the undirected graph), with the minimum possible number of edges. |
|