Add generalized Dijkstra algorithm #9
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Also: add debug tracing to all functions that modify the state arrays
Noting that it empties the queue
TODO: test that BellmanFord and Dijkstra give the same results given a graph with non-negative weights.
Because Bellman-Ford and Dijkstra find two different shortest paths with the same weight sum. Possible solution: deterministic sorting of output paths with equal length: `map (sortOn uniquePathId) (groupBy pathWeight resultPaths)`.
Also: improve assertion failure message
Synonym for "updateEdge"
Also: remove unused HasWeight constraints
How the hell was this not caught by any tests?! TODO: Write actually useful tests
If an item with index i is popped, then decrementing `size` will make the next `pop` overwrite the previous push (assuming that i /= the index of the previous push). Use a counter that keeps incrementing indefinitely instead of `size`.
instead of shortest path also: update "level" semantics (see docs)
Tracing would produce a crash since we tried to show "bottom" elements in the "keys" array. Get around that by using `showArrayWithBottoms`.
On `insert` of item that would otherwise fail with an "index >= capacity"-error.
Also: delete unused DotGraph test
instead of just the "label" attribute
Wasn't using the dependencies defined in shell.nix
So VS Code prefers it
Let the consumer of the query function do the lookup instead of embedding this into all query functions.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Supports e.g. k shortest paths.
TODO:
DijkstramoduleDijkstramodule