Long range dijkstra #93
Draft
Conversation
This file contains hidden or 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
|
For the records, this solution already allows cost of type |
A custom Network for our needs. Assumes a regular grid and edges are stored with the node, so that when pop a node, the associated nodes are removed with it.
It was initially fixed to ArrayIndex, but we don't need to restrict to that.
castelao
force-pushed
the
long_range_dijkstra
branch
from
cc04234 to
0c48f95
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
We already reduced the size and optimized the memory usage related to input fields and cost calculation, but we still consume too much memory to run in a regular computer. This PR is an MVP to reduce the memory footprint on the searching process itself to accommodate in a regular computer memory.
The core idea here is on using an active searching cache and an archive to dump processed nodes that can be written to disk to be recovered only in the end of the process.