https://gateoverflow.in/mymarks_old_2020/

Rank predictor not working till tomorrow

Dark Mode

by
shashin

Thank You @Shaik Masthan and the entire GO Team !

@Arjun sir thank you ... Sir I am writing out of context comment here sorry for that...

Sir I need your guidance for further admission process... I am getting 55 marks as per GO rank predictor.... And considering to do MS research in Machine learning..... I have 5 years of work experience in various companies including product based company as developer.... has sent you Friend request on FB...I am willing to write GRE as well if not will not get good college in India...

1

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.

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.