8 (8,8) (0,3) (0,2) a (4,5) b (4.5) (0,4) (3,3) d e 9 (0,2) (5.5) (3,6) C (3,4) (3, 3) h 1. Use Augmenting flow algorith

[answerhappygod]

8 8 8 0 3 0 2 A 4 5 B 4 5 0 4 3 3 D E 9 0 2 5 5 3 6 C 3 4 3 3 H 1 Use Augmenting Flow Algorith 1 (86.58 KiB) Viewed 140 times

8 (8,8) (0,3) (0,2) a (4,5) b (4.5) (0,4) (3,3) d e 9 (0,2) (5.5) (3,6) C (3,4) (3, 3) h 1. Use Augmenting flow algorithm to maximize the flow from source "s" to sink "t" Ignores "direction and given flow" and consider given capacities as weights of respective edges, then 2. Find chromatic number and chromatic index of above given graph. 3. Find shortest path from S to T. 4. Find minimum spanning tree taking roots vertex 's' by prims algorithm. 5. Eulerize the graph by using Chinese Postman Algorithm (using matching).