Q132
Every graph has only one minimum spanning tree.
A.
True
B.
False
AnswerAnswer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board
Data Structure · Q132
Graph Algorithms (DFS, BFS, Dijkstras, etc)
Programming · Data Structure · question 132