Found a counter example in which this algorithm doesn't work

[TiagoCavalcante]

Today I have found an example of a relatively small graph in which this algorithm can't find a path with a fixed length, even though it exists.

It seems like the algorithm doesn't handle cycles very well.

It still is a great heuristic, as it handles bigger graphs really well. I have tested it in millions of random graphs with at least 1000 vertices and density 0.1 and it worked every single time.