dabasajay/bfs.cpp

## bfs.cpp
vector<vector<int>> adj;  // adjacency list representation
int n; // number of nodes
int src; // source vertex

queue<int> q;
vector<bool> vis(n);
vector<int> dist(n), par(n);

q.push(src);
vis[src] = true;
par[src] = -1;
while (!q.empty()) {
  int u = q.front();
  q.pop();
  for (int v : adj[u]) {
    if (!vis[v]) {
      vis[v] = true;
      q.push(v);
      dist[v] = dist[u] + 1;
      par[v] = u;
    }
  }
}
	vector<vector<int>> adj; // adjacency list representation
	int n; // number of nodes
	int src; // source vertex

	queue<int> q;
	vector<bool> vis(n);
	vector<int> dist(n), par(n);

	q.push(src);
	vis[src] = true;
	par[src] = -1;
	while (!q.empty()) {
	int u = q.front();
	q.pop();
	for (int v : adj[u]) {
	if (!vis[v]) {
	vis[v] = true;
	q.push(v);
	dist[v] = dist[u] + 1;
	par[v] = u;
	}
	}
	}