#include <stdio.h>
#include <limits.h>
#include <stdbool.h>

#define INF INT_MAX

int minDistance(int dist[], bool sptSet[], int n) {
    int min = INF, min_index;
    for (int v = 0; v < n; v++) {
        if (sptSet[v] == false && dist[v] <= min) {
            min = dist[v];
            min_index = v;
        }
    }
    return min_index;
}

void dijkstra(int graph[][5], int dist[], bool sptSet[], int n, int src) {
    for (int i = 0; i < n; i++) {
        dist[i] = INF;
        sptSet[i] = false;
    }
    dist[src] = 0;

    for (int count = 0; count < n - 1; count++) {
        int u = minDistance(dist, sptSet, n);
        sptSet[u] = true;

        for (int v = 0; v < n; v++) {
            if (!sptSet[v] && graph[u][v] && dist[u] != INF && dist[u] + graph[u][v] < dist[v]) {
                dist[v] = dist[u] + graph[u][v];
            }
        }
    }
}

void printSolution(int dist[], int n) {
    printf("Vertex   Distance from Source\n");
    for (int i = 0; i < n; i++) {
        printf("%d \t\t %d\n", i, dist[i]);
    }
}

int main() {
    int graph[5][5] = {
        {0, 10, 0, 0, 0},
        {0, 0, 5, 0, 0},
        {0, 0, 0, 15, 0},
        {0, 0, 0, 0, 20},
        {0, 0, 0, 0, 0}
    };

    int dist[5];
    bool sptSet[5];
    int n = 5;

    dijkstra(graph, dist, sptSet, n, 0);
    printSolution(dist, n);

    return 0;
}