delafont/Genomics-and-bioinformatics — comment on commit 17c4c5d1e1d0cecdd69d9b01c710857a53483675
File:  line 0
By delafont:

Bruteforce does not return an Hamiltonian path. A sequence can be the longest possible contig without being found through an Hamiltonian path. It makes no sense in the exercise because it is not comparable to the second one. One doesn't need to build a graph to try all permutations - just permute reads and use the overlap function, although it's exactly what one wants to avoid.
That is why it has been deleted. Maybe now it is clearer, sorry for the time you lost.