• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

February 23, 2018 by Dhaval Dave

Find shortest distances between every pair of vertices in a given edge weighted directed Graph.

Input:
The first line of input contains an integer T denoting the no of test cases . Then T test cases follow . The first line of each test case contains an integer V denoting the size of the adjacency matrix  and in the next line are V*V space separated values of the matrix (graph) .

Output:
For each test case output will be V*V space separated integers where the i-jth integer denote the shortest distance of ith vertex from jth vertex.

Constraints:
1<=T<=20
1<=V<=20
-1000<=graph[][]<=1000

Example:
Input

2
2
0 25 25 0
3
0 1 43 1 0 6 43 6 0

Output
0 25 25 0
0 1 7 1 0 6 7 6 0

Explanation : –

To Find shortest distances between every pair of vertices We first initialize the solution matrix same as the input graph matrix as a first step. Then we update the solution matrix by considering all vertices as an intermediate vertex. The idea is to one by one pick all vertices and update all shortest paths which include the picked vertex as an intermediate vertex in the shortest path. When we pick vertex number k as an intermediate vertex, we already have considered vertices {0, 1, 2, .. k-1} as intermediate vertices. For every pair (i, j) of source and destination vertices respectively, there are two possible cases.
All steps are explained in below images.
1) k is not an intermediate vertex in shortest path from i to j. We keep the value of dist[i][j] as it is.
2) k is an intermediate vertex in shortest path from i to j. We update the value of dist[i][j] as dist[i][k] + dist[k][j].

Code(C++) To Find shortest distances between every pair of vertices : –

#include <stdio.h>
#define ll long long
using namespace std;

int main() {
        ll t;
        cin >> t;
        while (t--) {
            ll m;
            cin >> m;
            ll dist[m][m];
            for (ll i = 0; i < m; i++)
                for (ll j = 0; j > dist[i][j];

                    for (ll k = 0; k < m; k++)
                        for (ll i = 0; i < m; i++)
                            for (ll j = 0; j < m; j++) {
                                if (dist[i][k] + dist[k][j] < dist[i][j])
                                    dist[i][j] = dist[i][k] + dist[k][j];
                            }

                    for (ll i = 0; i < m; i++)
                        for (ll j = 0; j < m; j++)
                            cout << dist[i][j] << " "; cout << "\n";
                }
            return 0;
        }

Similar Articles

Filed Under: Amazon Interview Question, Graph, Microsoft Interview Questions Tagged With: Dynamic Programming, Graph

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Reversal of LinkedList

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Circular Linked List

Regular Expression Matching

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Given a string, find the first character which is non-repetitive

Find the kth number with prime factors 3, 5 and 7

Possible sizes of bus to carry n groups of friends

Edit Distance ( Dynamic Programming )

VMWare Openings

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Subset Sum Problem Dynamic programming

Printing Longest Common Subsequence

Password Predictor

Given Set of words or A String find whether chain is possible from these words or not

Diagonal Traversal of Binary Tree

SAP Off Campus Hiring_ March 2015 Sample Questions

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Introduction To Number Theory ( Part 1 )

Sequence Finder Dynamic Programming

How strtok() Works

Number of Islands BFS/DFS

BlueStone E-commerce Interview Experience

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Print all nodes that are at distance k from a leaf node

Difference between a LinkedList and a Binary Search Tree BST

Leetcode: Merge Intervals

Spanning Tree

strtok()

Check Binary Tree is Binary Search Tree or not

Copyright © 2026 · Genesis Framework · WordPress · Log in