Cod sursa(job #1850737)

Utilizator JokerOsHreceniuc Cristian JokerOs Data 18 ianuarie 2017 21:13:36
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("asd.in");
ofstream g("asd.out");
int a[101][101], viz[101], c[101], nod, n, m, start, i, q, b, ok=1, j, t[101], u[101][101], l=1;
void DF(int start)
{
    viz[start]=1; t[start]++; u[l][start]=start;
    for(int i=1; i<=n; i++)
        if(a[start][i]==1&&viz[i]==0)
                    DF(i);
}
int main()
{
    f>>n>>m;
    for(q=1;q<=m;q++)
        {
            f>>i>>j;
            a[i][j]=a[j][i]=1;
        }
    DF(1);
    t[1]=1;
    for(i=2;i<=n;i++)
        if(t[i]==0)
        {
            l++;
            DF(i);
        }
    g<<l<<"\n";
    return 0;
}