0 votes 0 votes How to solve such type of questions quickly.? Computer Networks computer-networks + – Ayush Upadhyaya asked Nov 7, 2018 Ayush Upadhyaya 387 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Hemanth_13 commented Nov 7, 2018 reply Follow Share 2 BG and GC I followed brute force approach similar to single source shortest path from A and then seeing if any other edges can be included. 0 votes 0 votes Srestha Sharma commented Nov 7, 2018 reply Follow Share I think BG will be used GC and EF will not be used. 0 votes 0 votes Magma commented Nov 7, 2018 reply Follow Share BC and GC 2 network will never be used 0 votes 0 votes Ayush Upadhyaya commented Nov 7, 2018 reply Follow Share Correct answer is 3. 0 votes 0 votes Hemanth_13 commented Nov 7, 2018 reply Follow Share Magma BC is the shortest path b/w B and C , so it should be included 0 votes 0 votes Ayush Upadhyaya commented Nov 7, 2018 reply Follow Share @Hemant-No. B can reach C via A, with lesser cost than 50. 0 votes 0 votes Hemanth_13 commented Nov 7, 2018 reply Follow Share Perfect Ayush Upadhyaya.. BAEDC. Thanks 0 votes 0 votes Magma commented Nov 7, 2018 reply Follow Share BC , GC and FE Yeah applying brute force consumes time for such Complex graph...but this is the only easiest way to find it 0 votes 0 votes Please log in or register to add a comment.