A minimal spanning tree in network flow models involves

• A. All the nodes with cycles/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 areas