moore

//moore
//determina distantele minime de la un nod sursa la celelalte noduri

#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;

vector<vector<int>> g;
vector<int> dist;
vector<bool>vis;
int source,n,m;
 queue<int> q;

void read()
{
    ifstream in("file.txt");
    if(!in.is_open())
        cout<<"unable to open the file\n";
    else
    {
        in>>source;
        in>>n>>m;
        g.resize(n+1);
        dist.assign(n+1,0);
        vis.assign(n+1,false);
        for(int i=0;i<=n;i++)
            g[i].assign(n+1,0);
        int x,y,w;
        for(int i=0;i<m;i++)
        {
            in>>x>>y>>w;
            g[x][y]=w;
           // g[y][x]=w;
        }
    }
}
void moore()
{
    int curent;
    dist[source]=0;
    q.push(source);
    vis[source]=true;
    while(!q.empty())
    {
        curent=q.front();
        q.pop();
        for(int j=1;j<=n;j++)
        {
            if(!vis[j] && g[curent][j]!=0)
            {

                q.push(j);
                vis[j]=true;
                dist[j]=dist[curent]+1;
            }
        }
    }
}
void print()
{
    cout<<"distantele de la nodul sursa "<<source<<":";
    for(int i=1;i<=n;i++)
        cout<<dist[i]<<" ";
}
int main()
{
    read();
    moore();
    print();
    return 0;
}