Q. 31 A minimal spanning tree in network flow models involves
(A) all the nodes with cycle/loop allowed
(B) all the nodes with cycle/loop not allowed
(C) shortest path between start and end nodes
(D) all the nodes with directed arcs
Answer: (B)
Explanation:
