KEMBAR78
Graph Theory Trees Network Flow Assignments | PDF
0% found this document useful (0 votes)
16 views3 pages

Graph Theory Trees Network Flow Assignments

Uploaded by

Yam Raj Bohara
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
0% found this document useful (0 votes)
16 views3 pages

Graph Theory Trees Network Flow Assignments

Uploaded by

Yam Raj Bohara
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
You are on page 1/ 3

Graph Theory Assignments:

6
12

13.What are the significance of Minimum Spanning Tree? Describe how Kruskal’s and prism algorithm
can be used to find the MST below graph.

14. What is network flow? Give an example of saturated edge, unsaturated edge, and slack.

15. a.

You might also like