Cod sursa(job #2201101)

Utilizator AndreiG23Ghiurcuta Andrei AndreiG23 Data 3 mai 2018 16:18:51
Problema Parcurgere DFS - componente conexe Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <iostream>

using namespace std;
int n,m,i,j,p,v[10],a[50][50]={0},viz[10];

void df(int k)
{
    cout<<k<<" ";
    viz[k]=1;
    for(i=1;i<=n;i++)
        if(a[k][i]==1&&viz[i]==0)df(i);
        return;
}
int main()
{
    cout<<"n=";cin>>n;
    cout<<"m=";cin>>m;
    for(i=1;i<n;i++)
        for(j=i+1;j<=n;j++)
    {
        cout<<"a["<<i<<"]["<<j<<"]=";
        cin>>a[i][j];
        a[j][i]=a[i][j];
    }
    for(i=1;i<=m;i++)
    {
        cout<<"v["<<i<<"]=";cin>>v[i];
    }
    int ok=1,y=0;
    for(i=1;i<n;i++)
        for(j=i+1;j<=n;j++)
        if(a[v[i]][v[j]]==0)ok=0;
    if(ok==0)cout<<"nu este lant";
    else
    {
        for(i=1;i<n;i++)
            for(j=i+1;j<=n;j++)
            if(v[i]==v[j])y=1;
        if(y)cout<<"neelementar";
        else cout<<"elementar";
    }
    cout<<endl<<"x=";cin>>p;
    cout<<endl;df(p);
}