a0sEBw - Online C++ Compiler & Debugging Tool

#include <iostream>
#include <climits>
using namespace std;

#define INF 99999

void floydWarshall(int graph[][10], int V) {

    int dist[V][V];


    for (int i = 0; i < V; i++) {
        for (int j = 0; j < V; j++) {
            if (graph[i][j] == 0 && i != j) {
                dist[i][j] = INF;
            } else {
                dist[i][j] = graph[i][j];
            }
        }
    }


    for (int k = 0; k < V; k++) {
        for (int i = 0; i < V; i++) {
            for (int j = 0; j < V; j++) {
                if (dist[i][k] != INF && dist[k][j] != INF && dist[i][j] > dist[i][k] + dist[k][j]) {
                    dist[i][j] = dist[i][k] + dist[k][j];
                }
            }
        }
    }


    cout << "The shortest distance matrix is: \n";
    for (int i = 0; i < V; i++) {
        for (int j = 0; j < V; j++) {
            if (dist[i][j] == INF) {
                cout << "INF" << "\t";
            } else {
                cout << dist[i][j] << "\t";
            }
        }
        cout << endl;
    }
}

int main() {
    int V;


    cout << "Enter the number of vertices: ";
    cin >> V;


    int graph[10][10];


    cout << "Enter the adjacency matrix (enter 0 for no edge, non-zero values for edge weights):\n";
    for (int i = 0; i < V; i++) {
        for (int j = 0; j < V; j++) {
            cin >> graph[i][j];
        }
    }


    floydWarshall(graph, V);

    return 0;
}