Products

## Holooly Rewards

We are determined to provide the latest solutions related to all subjects FREE of charge!

Enjoy Limited offers, deals & Discounts by signing up to Holooly Rewards Program

## Holooly Tables

All the data tables that you may search for.

## Holooly Arabia

For Arabic Users, find a teacher/tutor in your City or country in the Middle East.

## Holooly Sources

Find the Source, Textbook, Solution Manual that you are looking for in 1 click.

## Holooly Help Desk

Need Help? We got you covered.

## Q. 12.FAQ.1

Consider the given graph and construct a minimum spanning tree using Prim’s algorithm.

## Verified Solution

Step 1: The starting node is F.

Step 2: The lowest weighted/cost edge is (F, A), that is, 1. Hence, it is added to the tree.

Step 3: Now, the lowest weighted/cost edge is (F, D), that is, 4. Hence, it is added to the tree.

Step 4: Now, the lowest weighted/cost edge adjacent to a node in so far constructed tree to any of the leftovers nodes is (D, E), with weight, 2. Hence, it is added to the tree.

Step 5: Similarly, the lowest weighted/cost edge adjacent to a node in so far constructed tree to any of the leftovers nodes is (F, B), with weight, 5 followed by (B, C), with weight, 3 as shown in the next step. Hence, they are step by step added to the tree.

Step 6: Finally the minimum spanning tree is constructed.