Potential Issue with 4.4.34 about algorithms-sedgewick-wayne HOT 3 CLOSED

Thanks for reporting this issue.

Indeed, there was a bug with paths to vertices that had different sub-paths.
And I agree that we can't retrieve all possible paths with just one edgeTo array.

I updated this exercise to keep the list of edges on the path to each vertex.
The performance won't be the same as using just one edgeTo array, but it seems to be the only way where we can retrieve all possible monotonic paths.

The updated version can be found here: 1ddd1da

from algorithms-sedgewick-wayne.

After further consideration, I updated the exercise to use an array of Path objects, in a way that we don't need to store all edges in each path.
This allows us to retrieve all possible monotonic paths and requires just references to Paths, optimizing the runtime.
This is the commit with the update: 7aa3ff7

from algorithms-sedgewick-wayne.

Ah, I think this is a nice solution.

from algorithms-sedgewick-wayne.