Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int MAXNODOS = 200;
- vector<int> g[MAXNODOS];
- bool visitados[MAXNODOS];
- void dfs(int u){
- cout << u << '\n';
- visitados[u] = true;
- for(int v : g[u]){
- if(!visitados[v]){
- dfs(v);
- }
- }
- }
- int main(){
- // n: nodos
- // m: relaciones
- int n, m;
- cin >> n >> m;
- for(int i = 0; i < m; ++i){
- int a, b;
- cin >> a >> b;
- g[a].push_back(b);
- }
- memset(visitados, 0, sizeof visitados);
- dfs(0);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement