Scribd
Upload
54 views

Graphs Assignment

This document contains a 3-part assignment on graphs: 1) Find the minimum spanning tree using Kruskal's algorithm, 2) Find the minimum spanning tree using Prim's algorithm starting at vertex B, 3) Use Dijkstra's algorithm to find the shortest path from a starting vertex of B. The assignment was written by Mrs. Selva Mary G and contains 4 pages.

Uploaded by

Jitendra Singh Rauthan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
54 views

Graphs Assignment

This document contains a 3-part assignment on graphs: 1) Find the minimum spanning tree using Kruskal's algorithm, 2) Find the minimum spanning tree using Prim's algorithm starting at vertex B, 3) Use Dijkstra's algorithm to find the shortest path from a starting vertex of B. The assignment was written by Mrs. Selva Mary G and contains 4 pages.

Uploaded by

Jitendra Singh Rauthan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Topic : Graphs

Name: ___________________
Topic: Graphs

Assignment
Reg. No.: _____________________
Date:

_______________________

1. Find the minimum spanning tree using Kruskals algorithm.

Mrs. Selva Mary. G

Page 1

Topic : Graphs

Mrs. Selva Mary. G

Assignment

Page 2

Topic : Graphs

Assignment

2. Find the minimum spanning tree using prims algorithm. The starting vertex is B.

Mrs. Selva Mary. G

Page 3

Topic : Graphs

Assignment

3. Using Dijkstras algorithm, find the shortest path for the following graph with
starting vertex B.

Mrs. Selva Mary. G

Page 4

You might also like