Spannning
TREES
Made By – Sanskar Sharma
BSc. 3rd Sem
Submitted to Mr. Jitendra Gupta
, 01. ABOUT THE PROJECT 04. The Kruskal’s Algorithm
02. A Little Example 05. The Prim’s Algorithm
03. Minimum Spanning Tree
, What is a
Spanning
Tree
For any undirected connected graph
G(V,E), there exist a sub-graph such
that –
• Number of Vertices are equal
• Number of Edges is always = V – 1
Let it be S(V`,E`) where E` = V` - 1.
TREES
Made By – Sanskar Sharma
BSc. 3rd Sem
Submitted to Mr. Jitendra Gupta
, 01. ABOUT THE PROJECT 04. The Kruskal’s Algorithm
02. A Little Example 05. The Prim’s Algorithm
03. Minimum Spanning Tree
, What is a
Spanning
Tree
For any undirected connected graph
G(V,E), there exist a sub-graph such
that –
• Number of Vertices are equal
• Number of Edges is always = V – 1
Let it be S(V`,E`) where E` = V` - 1.
