diff --git a/.changeset/board-where-the-scan-boarded.md b/.changeset/board-where-the-scan-boarded.md deleted file mode 100644 index 00f4819..0000000 --- a/.changeset/board-where-the-scan-boarded.md +++ /dev/null @@ -1,16 +0,0 @@ ---- -"connection-scan-algorithm": patch ---- - -Return the journey the scan made. A journey could change trains at a station where another trip -happened to arrive first, with less than the station's interchange time, when the passenger had -really boarded that trip at an earlier call. The arrival times were right, the legs were not. - -The scan now records the connection each trip is boarded from, and the connection index holds that -connection for each station rather than the last connection into it, so each entry is one leg. A trip -that can be boarded at more than one call is boarded where the passenger has taken the fewest legs to -reach, then at the latest call, so a passenger is not taken past a call of the trip only to ride back -through it. Reaching a station at the same time in fewer legs now replaces how it was reached, and -the footpaths from it are walked again. Where the trip before still passes a later call of the next -one in time to change there, the journey changes there. `ScanResults.setConnection` has to follow -`isReachable` for the same connection, as the scan does. diff --git a/CHANGELOG.md b/CHANGELOG.md index c3dbff0..3b3988f 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -1,5 +1,22 @@ # connection-scan-algorithm +## 3.0.1 + +### Patch Changes + +- 28cd827: Return the journey the scan made. A journey could change trains at a station where another trip + happened to arrive first, with less than the station's interchange time, when the passenger had + really boarded that trip at an earlier call. The arrival times were right, the legs were not. + + The scan now records the connection each trip is boarded from, and the connection index holds that + connection for each station rather than the last connection into it, so each entry is one leg. A trip + that can be boarded at more than one call is boarded where the passenger has taken the fewest legs to + reach, then at the latest call, so a passenger is not taken past a call of the trip only to ride back + through it. Reaching a station at the same time in fewer legs now replaces how it was reached, and + the footpaths from it are walked again. Where the trip before still passes a later call of the next + one in time to change there, the journey changes there. `ScanResults.setConnection` has to follow + `isReachable` for the same connection, as the scan does. + ## 3.0.0 ### Major Changes diff --git a/package.json b/package.json index 82532d2..7d695a4 100644 --- a/package.json +++ b/package.json @@ -1,6 +1,6 @@ { "name": "connection-scan-algorithm", - "version": "3.0.0", + "version": "3.0.1", "description": "Connection Scan Algorithm", "main": "./dist/cjs/index.js", "types": "./dist/esm/index.d.ts",