#include<stdio.h>
#include<stdlib.h>
int main()
{
    struct edges{
        int u,v,w;
    };
}
    void bellmanford(int n,int m,struct Edge edges[],int source)
    if(n <=0)
    {
        printf("Invalid input./n");
        return;
    }
    int dist;
    for(int i=0;i<n;i++)
    {
        dist[i]=INF;
    }
    dist[source]=0;
    for (int i=0;i<n-1;i++)
    for(int j=0;j<m;j++)
    {
        int u=edges[j].u;
        int v=edges[j].v;
        int w=edges[j].w;
        if(dist[u]!=INF&&dist[u]+dis[w]<dist[v]){
            printf("graph contains negative weight cycle/n");
            return;
        }
    }
    for(int i=0,i<n;i++)
    {
        if(dist[i]==INF){
            printf("path not found.\n");
        }else{
            printf("%d:%d\n",i,dist[i]);
            
        }
        }
    }
            
        }
        
    }
    }
    }