Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int bfs(int origem, int destino)
- {
- int dist[100], vis[100], pai[100];
- for(int i = 0; i < 100; i++)
- vis[i] = 0;
- queue <int> q;
- q.push(origem);
- dist[origem] = 0;
- vis[origem] = 1;
- pai[origem] = -1;
- while(!q.empty())
- {
- int u = q.front();
- q.pop();
- for(auto v : adj[u])
- {
- if(!vis[v])
- {
- q.push(v);
- vis[v] = 1;
- dist[v] = dist[u] + 1;
- pai[v] = u;
- }
- }
- }
- return dist[destino];
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement