You are given the shortest path matrix S of a graph where Sij denotes the shortest path cost from it…
Click here to read the complete problem statement.
If you need help solving this problem, mention your approach and ask specific questions. Please avoid sharing your code and asking the Community to figure out “what’s wrong”.