Please give me some tests

I don't use any graphs algorithms,but only DFS.
If you try to solve this problem like me do:
1) break(remove) all cycles
2)Store elements of graph,witch belong to different component's of graph.
3) Connect one of them with others. (one - to every).
Not every to every!!!

Test
6
1000000 1000000
010000
100000
000100
001000
000001
000010



Edited by author 16.10.2009 21:29

Is this one of the solutions to the above given test?

2000000
00a0a0
000000
a00000
000000
a00000
000000

thx