Professional Documents
Culture Documents
1 6
2 7
3. Discuss about augmenting path with suitable example. Consider the given network flow 10
graph and apply Ford Fulkerson algorithm to compute the max-flow using augmenting
paths in the given network where the weighted edges indicate the capacity of the
channel. Discuss its time complexity. (Step by step solution is required).
4. i) Write kruskal’s algorithm and draw the minimum cost spanning tree for the given 5
graph using the same. (show all the stages)
ii) Arrange the vertices of the given digraph in topological ordering . If not possible then 5
justify your answer with proper explanation