Semester : SEMESTER 5
Subject : Graph Theory and Combinatorics
Year : 2020
Term : SEPTEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 309
Page:5
00000CS309121902
18 a) Draw a flowchart indicating all the five conditions to find the spanning tree (10)
/spanning forest. Apply it to find the spanning tree /spanning forest for any
disconnected graph of your choice.
19 a) Write Dijkstra’s Shortest path algorithm and apply this algorithm to find the (10)
shortest path
20 a) Discuss an algorithm to find the minimum spanning tree of a graph G with वा (10)
example
بد بد ید मैप