https://bugs.kde.org/show_bug.cgi?id=355851
--- Comment #2 from Bruno Coudoin <bruno.coud...@gcompris.net> --- I confirm the bug. In the code we are looking at the first spot close enough instead of finding thte closest stop of all possible one. Need to fix the algorithm. -- You are receiving this mail because: You are watching all bug changes.
