Programming Exercises - May 29, 2026

Quick Jump

Program	File	Link
Exercise 1 : Floyd–Warshall Algorithm	FloyedWarshall.cpp	Open on GitHub

Exercise 1 : Floyd–Warshall Algorithm

Open original file on GitHub

Algorithm

1. Input the number of vertices n and the adjacency matrix dist[n][n] where a large sentinel (e.g., 999) represents infinity/no direct edge.
2. For each intermediate vertex k from 0 to n-1:
   • For each pair of vertices (i, j) update dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]).
3. After processing all intermediate vertices, dist[i][j] holds the length of the shortest path from i to j (or the sentinel if no path exists).
4. Print the resulting shortest-distance matrix, displaying INF for sentinel values.

Code

#include <stdio.h>

int main()
{
    int n;

    printf("Enter Number Of Vertices : ");
    scanf("%d", &n);

    int dist[n][n];

    printf("Enter Adjacency Matrix :\n");
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            scanf("%d", &dist[i][j]);
        }
    }

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

    printf("\nShortest Distance Matrix :\n");

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (dist[i][j] == 999)
                printf("INF ");
            else
                printf("%3d ", dist[i][j]);
        }
        printf("\n");
    }

    return 0;
}

Compile command

g++ FloyedWarshall.cpp -o FloyedWarshall && ./FloyedWarshall

---

Compile All Files

g++ FloyedWarshall.cpp -o FloyedWarshall && ./FloyedWarshall

Turbo C++ compatibility notes

// Change function signature
int main()  ->  void main()

// Change the final line
return 0;  ->  getch();