Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int a[100][100], n, viz[15];
- void DFS(int nod_curent)
- {
- int i;
- cout << nod_curent << '\t';
- viz[nod_curent] = 1;
- for(i = 1; i <= n; i++)
- if(a[nod_curent][i] && !viz[i])
- DFS(i);
- }
- void citire()
- {
- cin >> n;
- for(int i = 1; i <= n; i++)
- for(int j = 1; j <= n; j++)
- cin >> a[i][j];
- }
- int main()
- {
- citire();
- int i;
- cout << "Introduceti nodul de la care va incepe parcurgerea: ";
- cin >> i;
- DFS(i);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement