Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <list>
- #include <utility>
- #include <algorithm>
- using namespace std;
- vector<int> tata; //declaram
- vector<int> niv;
- vector<bool> vizitat;
- typedef vector<list<int> > graf;
- void init_DF(int n) //initializam in main
- {
- tata = vector<int>(n,-1);
- niv = vector<int>(n);
- vizitat = vector<bool>(n);
- }
- void DF(int s, graf &g)
- {
- vizitat[s] = 1;
- for(list<int>::iterator it = g[s].begin(); it != g[s].end(); it++)
- if(!vizitat[*it])
- {
- tata[*it] = s;
- niv[*it] = niv[s]+1;
- DF(*it,g); //aplicam recursiv DF pentru radacina *it
- }
- }
- int main()
- {
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement