BFS-shortest path

#1


m getting one test case wrong

#2

@imavneet
you had to do this.

for (int i = 1; i <= n; i++) {
		// T node = node_pair.first;
		dist[i] = -1;
	}

and then this

for (int i = 1; i <= n; i++) {
		if (i != src) {
			if (dist[i] == -1) {
				cout << "-1 ";
			}
			else {
				cout << (6 * dist[i]) << " ";
			}
		}
	}