Scribd
Upload
13 views16 pages

Graph Algorithms: Minimum Spanning Tree

The document discusses graph algorithms with a focus on Minimum Spanning Trees, authored by Dr. Shahbaz Khan from the Indian Institute of Technology Roorkee. It includes sections on feedback, doubts, a comparison between Prim's and Kruskal's algorithms, and applications of Maximum Spanning Trees. The content is structured to provide insights into the theoretical and practical aspects of these algorithms.

Uploaded by

Vineet Don
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views16 pages

Graph Algorithms: Minimum Spanning Tree

The document discusses graph algorithms with a focus on Minimum Spanning Trees, authored by Dr. Shahbaz Khan from the Indian Institute of Technology Roorkee. It includes sections on feedback, doubts, a comparison between Prim's and Kruskal's algorithms, and applications of Maximum Spanning Trees. The content is structured to provide insights into the theoretical and practical aspects of these algorithms.

Uploaded by

Vineet Don
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

Graph Algorithms
(Minimum Spanning Tree)

Dr. Shahbaz Khan


Department of Computer Science and Engineering,
Indian Institute of Technology Roorkee
[Link]@[Link]
Feedback

5
Doubts

6
Comparison between Prim and Kruskal

11
Applications

Maximum Spanning Tree

12

You might also like