Search found 1 match

by karo9
Thu Jan 21, 2010 11:23 pm
Forum: Volume 109 (10900-10999)
Topic: 10959 - The Party, Part I
Replies: 37
Views: 18502

Re: 10959 - The Party, Part I

Hi Can someone help me with this task. I've tried different implementation of bfs but none worked:( here is example : #include <cstdio> #include <vector> #include <queue> std::vector<int> a[1009]; std::queue<int> Q; int D[1009]; bool color[1009]; void Bfs(int s) { int u, v; color[s] = true; D[s] = 0...

Go to advanced search