2. Greedy Method ???
A greedy method is an method that follows
the problem solving technique of making the
locally optimal choice at each stage with the
hope of finding a global optimum.
3. Prim’s Algorithm
Prim's algorithm is a greedy algorithm that
finds a minimum spanning tree for
a connected weighted undirected graph. This
means it finds a subset of the edges that forms
a tree that includes every vertex, where the
total weight of all the edges in the tree is
minimized.
4. Spanning Tree ???
A spanning tree of a connected graph G can
be defined as a maximal set of edges of G that
contains no cycle, or as a minimal set of edges
that connect all vertices.
5.
6. Minimum Spanning Tree ???
A minimum spanning tree is a subgraph of an
undirected weighted graph G, such that
• it is a tree (i.e., it is acyclic)
• it covers all the vertices V
– contains |V| - 1 edges
• the total cost associated with tree edges is the
minimum among all possible spanning trees
• not necessarily unique