Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int n, m;
- int a[10][10];
- int viz[10];
- void DFS(int v)
- {
- cout << v << ' ';
- viz[v] = 1;
- for (int i = 1; i <= n; i++)
- if (a[v][i] == 1 && viz[i] == 0)
- DFS(i);
- }
- void citire()
- {
- ifstream f("graf.in");
- int x, y;
- f >> n >> m;
- for (int i = 1; i <= m; i++)
- {
- f >> x >> y;
- a[x][y] = a[y][x] = 1;
- }
- }
- void afisare()
- {
- for (int i = 1; i <= n; i++)
- {
- for (int j = 1; j <= n; j++)
- cout << a[i][j] << ' ';
- cout << endl;
- }
- }
- int grad(int v)
- {
- int s = 0;
- for (int i = 1; i <= n; i++)
- s += a[v][i];
- return s;
- }
- void Frunze()
- {
- for (int i = 1; i <= n; i++)
- if (grad(i) == 1)
- cout << i << ' ';
- }
- int main()
- {
- citire();
- //afisare();
- for (int i = 1; i <= n; i++)
- if (viz[i] == 0)
- {
- DFS(i);
- cout << endl;
- }
- Frunze();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement