A

Admin • 828.03K Points
Coach

Q. Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called

  • (A) subgraph
  • (B) tree
  • (C) hamiltonian cycle
  • (D) grid

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.