Breadth-first search

[shsr04]

This solves the BFS problem for a graph G=(V,E).

• Time: O(n+m)
• Space: O(n) bits

[coveralls]

Coverage increased (+0.9%) to 77.15% when pulling 25c43db on shsr04:bfs into 368951b on thm-mni-ii:master.

[shsr04]

Did I break something?

[dppl]

Will look further into it.

[andrej-sajenko]

Hi @shsr04, can you tell me why you disabled the tests in this pull request?
Recall your last commit message: 'disable CD iterator test for now'

[shsr04]

The test is failing for unknown reasons (see #31). @dappels can not reproduce the error, so I think the test is not useful.

[dppl]

As @shsr04 said I was not able to reproduce the error locally with the current master version.
However even after cloning his branch and running the test I'm still not able to reproduce the problem.

The error also does not seem to be related to the fixed seed, which is used to shuffle the test set in order to fill the words in an unordered way.

Could the error be somehow related to different clang versions?

[shsr04]

I have tried with g++ 6.3.0 and clang++ 3.8, both give the same error.