38 probleme pe site
Incepand cu : 15.02.2004 Accesari : 172213
[ Statistici detaliate ]
Luna aglomerata : noiembrie 2023 (4734)
Zi aglomerata : 11 noiembrie 2021 (2711)
Ora aglomerata : 15:00 - 15:59 in data de 16 august 2022 (2539)
|
|
|
|
| | | | Enunt :
Se da un graf memorat sub forma matricei de adiacenta. Se cere sa se afiseze maticea drumurilor. Algoritmul va utiliza parcurgerea in adancime. | | | | |
| | | | Rezolvare :
#include<fstream.h>
#include<conio.h>>
int graf[100][100], nrnoduri ;
int s[1000],matdr[100][100];
void citiregraf()
{
int i,j;
fstream f("graf.txt", ios::in);
for (i=0;i<100;i++) for (j=0;j<100;j++) graf[i][j]=0;
f>>nrnoduri;
while (f>>i>>j) graf[i][j]=1;
f.close();
}
void tiparmat(int nr, int mat[100][100])
{
int i,j;
for (i=1;i<=nr;i++) { for (j=1;j<=nr;j++) cout<<mat[i][j]<<" ";
cout<<endl; }
cout<<"\n\n";
}
void matdrum (int baza, int nod)
{
int k;
if (baza!=nod) matdr[baza][nod]=1;
s[nod]=1;
for(k=1;k<=nrnoduri;k++) if (graf[nod][k]==0) matdrum(baza,k);
}
void main()
{
clrscr();
int graf[100][100], nr, x, i, j;
citiregraf();
tiparmat(nrnoduri, graf);
for (i=0;i<100;i++) for (j=0;j<100;j++) matdr[i][j]=0;
for (i=1;i<=nrnoduri;i++) { for (j=1;j<=nrnoduri;j++) s[j]=0;
matdrum(i,i); }
tiparmat(nrnoduri, matdr);
cout<<"\n\n";
getch();
} | | | | |
| | | | Opinii diverse :
Nu exista nici o opinie in baza de date. | | | | |
| |
|