Awesome q2a theme
0 votes
32 views
Answer to directed weighted graph should be for every vertex the paths will be same as because  w'(u,v) will be w(u,v)+f(u)-f(v) means depednent on only source and destination and not on intermediate step as they will cancel out so paths will reamain same and values can  be different.

eg.

w(1,3)=w(1,2)+w(2,3) and let other candidate be w(1,4)+w(4,3) then

          w'(1,3)=w(1,2)+f(1)-f(2)+w(2,3)+f(2)-f(3) ==w(1,2)+w(2,3)+f(1)-f(3)

          w(1,3)=w(1,4)+f(1)-f(4)+w(3,4)+f(4)-f(3)==w(1,4)+w(4,3)+f(1)-f(3)

      so exteding similarly for any path ,the shortest path will not change  but its value can be changed.
in Algorithms by (5 points) | 32 views

Please log in or register to answer this question.

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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
9,020 questions
3,138 answers
14,456 comments
95,828 users