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

The brute force algorithm doesn't search for a path that visits every vertex once, it simply searches for the longest contig possible, that is right. It is also true that one doesn't need to build a graph to try all permutations of the reads -- But wasn't this exactly the purpose of this algorithm ? To give a bad and computationally costly solution that they can compare with the fast one ? That's the idea I had when writing it. It was taking about 50 seconds to solve a problem with 6 reads, which was perfect.

We should probably think a bit longer about what we want to show in our exercises before coding them.

I see you added some code to reconstruct the real contig in the eulerian path part, that's good !