bfs判断子图是否连通

int judge() {

	int v[13] = { 0 };

	queue<int> myq;

	myq.push(ans[0]);

	v[ans[0]] = 1;

	while (!myq.empty()) {

		int t = myq.front();

		myq.pop();

		for (int i = 1; i < 5; i++) {

			if (c[t][ans[i]] == 1 && v[ans[i]] == 0) {

				myq.push(ans[i]);

				v[ans[i]] = 1;

				sum--;

			}

		}

	}

	if (sum == 0)

		return 1;

	else

		return 0;

}