3.2k views

Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$

$$W=\begin{pmatrix} 0 & 1 & 8 & 1 & 4 \\ 1 & 0 & 12 & 4 & 9 \\ 8 & 12 & 0 & 7 & 3 \\ 1 & 4 & 7 & 0 & 2 \\ 4 & 9 & 3 & 2 & 0 \end{pmatrix}$$

What is the minimum possible weight of a path $P$ from vertex $1$ to vertex $2$ in this graph such that $P$ contains at most $3$ edges?

1. $7$
2. $8$
3. $9$
4. $10$
edited | 3.2k views
0
Think this using tree approach ... Take 1 as root ... consider only those paths which has destination vertex as 2 and 3 edges between them ... This way u will get 1-0-4-2 = 8 ... So option B ...

Hence proved ... :p
0
but 3rd vertex has the minimal weight compared to 4th vertex...could you please explain which algorithm you used and how you got the answer...

Answer is (B) $8$. The possible path is: $1 - 0, 0 - 4, 4 - 2$.

answered by Junior (873 points)
edited by
+9

Is there any shortcut method for determining the mini possible wt of a path from vertex 1 to 2.

Because if we take the brute force approach it is very time consuming .Moreover, there are chances of error as well.

+8

@vidhi ....we can apply bellman ford algorithms upto 3 iterations

Start from vertex 1 as source

i=1 representing atmost 1 edge

i=2 representing atmost 2 edge

i=3 representing atmost 3 edge

Use Bellman Ford only for vertex 2, to save time.....

0
We have to apply bellmanford upto 4(5 - 1) iterations right ?
+2

@gshivam

Using bellman ford is fine, but it is very time consuming.

As first we have to convert the undirected graph to a directed one https://cs.stackexchange.com/questions/24768/shortest-path-in-weightedpositive-or-negative-undirected-graph

And then apply Bellman ford from vertex 1 as src.

I tried as below ::(may be helpful to other readers)

But, can anyone suggest any other shortcut method??

0

ravi_ssj4 no.

+2

I tried the below approach and it worked!!

We want to reach vertex 2 from 1.

What now I do is, scan the adjacency matrix in a column-wise fashion and now I determine the shortest edge by which I can reach a vertex i in the graph.

Like, to reach vertex 2, I can reach with a minimum cost from vertex 4 with cost 3.

Following the similar pattern, I build a path tree, which goes from vertex 1 to vertex 2.

Now, this path from vertex 1 to 2 consist of 4 edges but I want a path with at most 3 edges.

So, now using vertex 1 as source and other vertices 0,3,2 I multiplex them one by one and check which one will give me the shortest path.

And cost comes out to be 8.

0
1-0-3-4-2 .. By this we can get 7 as answer
0
but from 0 the minimum cost is 1 towards node 3... y u chose 4?

For getting quick answer just draw a tree of depth 3.  And compare various path. Although it is brute force, But this method will not take much time.

answered by Boss (12.4k points)
+8
Nice approach :)
0
How this tree is drawn?? Can u please explain in detail
+2
Why have you not expanded the last 1->4->0>2 and 1->4->3->2 ,although it is not shortest but why did you not find in the tree diagram?
+1

Why have you not expanded the last 1->4->0>2 and 1->4->3->2 ,although it is not shortest but why did you not find in the tree diagram?

rahul sharma 5 ji. Good point but while making tree i realized that they will not give minimum. But yes we can draw them also to make the diagram more elegant and clear.

+4
This is the best answer for me,Quick and no chances of error.

Given graph is

Path: 1 -> 0 -> 4 -> 2

So the minimum possible weight of a path from vertex 1 to vertex 2 in this graph

=4+1+3

=8

answered by Boss (38.8k points)
edited by
0
it was wrong now corrected
1 -> 0 -> 3 -> 4 -> 2
= 1 + 1 + 2 + 3
= 7
Also, this is the minimum cost spanning tree.
answered by (41 points)
0
@jai

it should be 7 right ?

what was the gate answer key ?
0
At most 3 edges should be used. Please read the question carefully.

1
2