## Define minimum cost spanning tree. Draw the minimum cost spanning follow graph using prims algorithm .

##Define minimum cost spanning tree. Draw the minimum cost spanning  follow graph using prims algorithm  .

Ans:-Minimum Cost Spanning Tree:Let G=(V,E) be a connected graph where for all (u,v) in E there is a cost vector C[u,v].

·          A graph is connected if every pair of vertices is connected by a path.

A spanning tree for G is a free tree that connects all vertices in G.

·          A connected acyclic graph is also called a free tree.

The cost of the spanning tree is the sum of the cost of all edges in the tree. We usually want to find a spanning tree of minimum cost.