Posted on
22:18
by laviniutorcea
/*Sa se afiseze multimea W minus pt un varf k citit de la tastatura,
pt un graf orientat cu n varfuri.*/
#include
#include
#include
int main()
int i,j,k,n,m,a[20][20];
ifstream f("graf.in")
y>>n;y>>m;
for(i=1;i<=m;i++)
y>>x;
y>>z;
a[x][z]=1;
cin>>k;
cout<<"{";
for(i=1;i<=n;i++)
if(a[i][k]==1)
cout<<"("<<<","<<<")";
cout<<"}";
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<<" ";
cout<
}
f.close();
return 0;
Posted on
22:17
by laviniutorcea
/*Determinati varful cu cel mai mare grad intern si pt acel varf sa se
afiseze multimea gama minus.*/
#include
#include
#include
{
int main()
int i,j,k,n,m,a[20][20];
ifstream f("graf.in")
y>>n;y>>m;
for(i=1;i<=m;i++)
y>>x;
y>>z;
a[x][z]=1;
cin>>k;
cout<<"{";
for(i=1;i<=n;i++)
if(a[i][k]==1)
cout<<"("<<<","<<<")";
cout<<"}";
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<<" ";
cout<
cout<<"{";
for(i=1;i<=n;i++)
if(a[k][j]==1)
cout<<"("<<<","<<<",";
cout<<"}";
f.close();
return 0;
Posted on
22:17
by laviniutorcea
/*Din fisierul graf.txt se citesce matricea varfuri-arce.Sa se afiseze
pe ecran matricea de adiacenta.*/
#include
#include
#include
int main()
ifsteam f("graf.txt")
{
int i,b[20][20],j,n,m,b1[20][20];
f>>n;f>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{if(b[i][j]==-1)
ef=i;
if(b[i][j]==1)
ei=i;
a[ei][ef]==1;
}
int x,y;
for(i=1;i<=n;i++)
k=0;
for(j=1;j<=m;j++)
{
cin>>x;
cin>>y;
if(b1[i][j]==1 && k==0;)
{x=i;
k=1;}
else
if(b1[i][j]==-1 && k==1)
y=i;
b[x][y]==b[y][x]=1;
}
{
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cout<<<" ";
cout<
}
f.close();
return 0;}
Posted on
22:15
by laviniutorcea
/*Mat de adiacenta in mat drum*/
#include
#include
#include
int main()
ifstream f("graf.in")
{
int i,j,n,m,k,a[20][20],md[20][20];
f>>n;f>>m;
{int x,y;
cin>>x;
cin>>y;
a[x][y]=a[y][x]=1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
md[i][j]=a[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(md[i][j]==0 && i!=k && j!=k)
md[i][j]=md[i][k]*md[k][j];
f.close();
getch();
return 0;}}
Posted on
22:14
by laviniutorcea
#include
#include
#include
int main()
ifstream f("graf.in")
int viz[20],a[20][20],i,j,n,m,p,u,c[20];
cout<<"n=";cin>>n;
cout<<"m=";cin>>m;
int x,y;
for(i=1;i<=n;i++)
{cin>>x;
cin>>y;
a[x][y]=1;
a[y][x]=1;
}
p=u=1;
for(i=1;i<=n;i++)
viz[i]=0;
c[p]=1; viz[1]=1;
while(p<=u)
{x=c[p];p++;
for(y=1;y<=n;y++)
if(a[x][y]==1 && viz[y]=0)
{u++;
c[u]=y;
viz[y]=1;
}
}
{
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cout<<<" ";
cout<
}
f.close();
getch();
return 0;
Posted on
23:12
by laviniutorcea
/*Se citeste din fisierul graf.in de pe prima linie nr de varfuri si nr de muchii(n,m),iar de pe
urmatoarele m randuri perechi de varfuri reprezentand muchiile grafului.Se cere:
a)Sa se construiasca matricea de adiacenta si sa se scrie aceasta in fisierul mat.out.
b)Calculati gradul fiecarui nod si pastrati aceste gade intr-un vector.
c)Verificati daca graful are varfuri izolate.*/
#include
#include
#include
int main()
ifstream f("graf.in")
ofstream g("mat.out")
int d=0,n,m,a[20][20],i,j,k;
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{f>>a[i][j];
for(i=1;i<=m;i++)
{f>>x>>y;
a[x][y]=1;
a[y][x]=1;}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i if(a[i][j]==1) cout<<"("<cout< for (i=1;i<=n;i=i+2)
{k=0;
for(j=1;j<=n;j++)
k++;
cout<<"pentru nodul "< cout< for (i=1;i<=n;i=i+2)
{k=0;
for(j=1;j<=n;j++)
k++;
if (k==0) cout<<"nodul "< d++;
}
if (d==0) cout<<"nu exista";
getch();
f.close();
g.close();
return 0;
}
Posted on
23:12
by laviniutorcea
1.23022010
#include
#include
int k,i,j,a[20][20];
cout<<"k=";cin>>k;
cout<<"vecinii nodului"<for(i=1;i<+n;i++)
if(a[k][i]==1)
cout< int p,v[20];
cout<<"p=";cin>>p;
for(i=1;i<=p;i++)
cin>>v[i];
int ok=1;
for(i=1;i<=p-1;i++)
if(a[v[i]][v[i+1]]==0)
ok=0;
if(ok==0)
cout<<"Nodurile nu reprezinta lant";
else
{for(i=1;i<=p-1;i++)
for(j=i+1;j<=p;j++)
if(v[i]==v[j])
ok=0;
if(ok==0)
cout<<"lantul este neelementar";
else
cout<<"lantul este elementar";}
return 0;