The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
57 views

How to solve such type of questions quickly.?

asked in Computer Networks by Boss (23k points) | 57 views
0
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
I think BG will be used GC and EF will not be used.
0

BC and  GC

 2 network will never be used

0
Correct answer is 3.
0

Magma BC is the shortest path b/w B and C , so it should be included

0
@Hemant-No. B can reach C via A, with lesser cost than 50.
0

Perfect  Ayush Upadhyaya.. BAEDC. Thanks

0

BC ,  GC and FE

Yeah applying brute force consumes time for such Complex graph...but this is the only easiest way to find it

Please log in or register to answer this question.

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

47,072 questions
51,328 answers
177,568 comments
66,668 users