Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?

Quiz on minimum spanning tree, Kruskal’s and Prim’s algorithm. A minimum spanning tree (MST) is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. There are two main algorithms for finding a minimum spanning tree: Prim's algorithm and Kruskal's algorithm. Prim's algorithm works by starting at an arbitrary vertex and then iteratively adding the edge with the lowest weight that connects the current tree to an unvisited vertex. This process continues until all... Show more

Quiz on minimum spanning tree, Kruskal’s and Prim’s algorithm.

A minimum spanning tree (MST) is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.
There are two main algorithms for finding a minimum spanning tree: Prim's algorithm and Kruskal's algorithm.
Prim's algorithm works by starting at an arbitrary vertex and then iteratively adding the edge with the lowest weight that connects the current tree to an unvisited vertex. This process continues until all vertices have been added to the tree.
Kruskal's algorithm works by sorting all of the edges in the graph by weight and then iteratively adding the edges to the tree in order of increasing weight, as long as adding the edge does not create a cycle.

Show less