Replace every edge of a tree in a cover with te shortest path between verties without increasing cost of tree
Answers
Answered by
0
P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change. (A) P only.
make me Beainlist....
make me Beainlist....
Similar questions