1. What is the difference between Array List and Linked List ?
2. Inserting a node at the beginning of linked list
3. Insert a node after a given node in linked list
4. How to insert a node at the end of a given node? - Codzify.com Tutorials
5. Bubble Sort Algorithm with practical program in C
6. Insertion Sort Algorithm with practical program in C
7. Merge Sort Algorithm with practical program in C
8. BFS and DFS in Data Structure | Inorder, Preorder and Postorder Traversal with practical example.
9. Kruskals Algorithm with practical example
10. How to calculate the complexity of Algorithms?
11. How to insert a new node after a given node in a linked list? - Codzify.com Tutorials
12. How to insert a new node after a given node in a linked list? - Codzify.com

**Article by:** Manish Methani

**Last Updated:** October 9, 2021 at 8:04am IST

Every Graph G has more than one spanning tree and all the spanning trees of a given graph have an equal number of edges and vertices. Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together.

**A minimum spanning tree (MST)** or **minimum weight spanning tree** is a subset of the edges of a connected, edge-weighted (un)directed graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. Kruskal's Algorithm is used to find the minimum spanning tree using a greedy approach.

Let's arrange all the edges in increasing order of their weights

Weight | Source, Destination |
---|---|

1 | E,C |

2 | C,D |

5 | B,C |

6 | A,B |

7 | A,E |

8 | E,D |

Given Graph G is connected and with undirected edges..

Pick the less cost weight edge from the table which is E,C with cost 1. Mark them in given graph with bold black line as shown below.

Next minimum cost is 2 with edges C,D . As it does not forms a cycle , add bold line in graph.

Next minimum cost is 5 with edges B,C . As it does not forms a cycle , add bold line in graph.

Next minimum cost is 6 with edges A,B . As it does not forms a cycle , add bold line in graph.

Next minimum cost is 7 with edges A,E . As it forms a cycle , ignore it and disconnect from the graph.

Next minimum cost is 8 with edges E,D . As it forms a cycle , ignore it and disconnect from the graph.

The given tree is a minimum cost spanning tree.

Firebase & Angular.

Looking to learn how to create the production-ready apps

from scratch? Well, you are at the right place.

₹1299 or $15.56

## Learn to create the Dating App using No-Code Tool FlutterFlow

Level: **Advanced**

Mock Tests.

Test your C Programming skills with this comprehensive mock test on C Programming.

Take TestSolve most asked Interview Questions on Flutter and Test your foundational skills in flutter.

Take TestSolve most asked GATE Questions in Operating Systems and test your Gate Score.

Take TestThis is a mock test designed to help you assess your knowledge and skills in HTML and CSS.

Take TestSolve most asked GATE Questions in Data Structures and Algorithms and test your Gate Score.

Take TestMobile App