Closed joedski closed 8 years ago
The fix for this required rewriting pathLengths to work with the reversed adjacency list, kind of like how the number-of-paths algorithm works. Kind of. Also started from 0 so that I don't have to fiddle around with subtracting the vertex's own progress.
A simple demonstrative case, as drawn up in Mermaid:
With these vertex options:
Expected Result
PreStart
will have a value of 0.5 andStart
will have a value of 1, as will the rest of the vertices after Start.Actual Result
Start
has a value less than 1, as doesA
.