1.

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
Answer» C. hamiltonian cycle


Discussion

No Comment Found