#include<stdio.h>
#define INF 99999
#define MAX 100
void dijkstra(int graph[MAX][MAX],int n,int src) {
    int dist[MAX],visited[MAX];
    int i,j,u,v,min;
    for(i=0;i<n;i++) {
        dist[i]=INF;
        visited[i]=0;
    }
    dist[src]=0;
    for(i=0;i<n-1;i++) {
        min=INF;
        u=-1;
        for(j=0;j<n;j++) {
            if(!visited[j]&&dist[j]<min) {
                min=dist[j];
                u=j;
            }
        }
        if(u==-1)
          break;
        visited[u]=1;
        for(v=0;v<n;v++) {
            if(graph[u][v]&& !visited[v]&&dist[u]+graph[u][v]<dist[v]) {
                dist[v]=dist[u]+graph[u][v];
            }
        }
    }
    for(i=0;i<n;i++) {
        if(dist[i]==INF)
          printf("%d INF\n",i);
        else
          printf("%d %d\n",i,dist[i]);
    }
}