Comments (3)
I would think that you would want to limit the number of steps rather than the cost. You can already do that by incrementing a variable in the success function and returning true
if it reaches a given value. You would then have to check the return of astar to see if this is a true, or you could also set an additional boolean in the success function to reflect the fact that you have aborted the search.
Another way, as you suggest, would be to pass a state to the success function (with the cost, number of steps, etc.), and let it return either Success, Failure, or Abort. It you have a signature to suggest, that might be useful for what you want to do.
from pathfinding.
Ah yes, steps would be ideal, good point. Using a counter in the success function worked great, I had tried incrementing in the successors and heuristic callbacks and was running into BC issues, didnt realize i could increment inside the success function too, that makes a lot more sense!
I think as i thought about it more, i might still need to do some extra work before calling astar to detect if the target is in a separate "island" using a flood-fill algorithem.
For the signature, did you mean something like FS: FnMut(&N, usize, &C) -> bool,
for success
? This would pass in the index (for number of steps) and cost.
from pathfinding.
Either that, or something like
pub struct AstarProgress<'C> {
number_of_steps: usize,
current_cost: C,
current_depth: usize, // Depth since the start of the A* search
}
pub enum AstarResult {
Success,
Continue,
Abort,
}
with FS: FnMut(&N, &AstarProgress) -> AstarResult
.
It would be easy to maintain the current API while offering a new one with the full capabilities without duplicating the code. It would also make sense to replicate this scheme for other exploration methods. Also, AstarProgress
could be easily extended in the future if needed.
from pathfinding.
Related Issues (20)
- minimize staircasing in pathfinding algos HOT 1
- Dependency Dashboard
- Searching (BFS/Dijkstra/A*) with multiple starting nodes HOT 3
- Yen's Algorithm - root path comparison off by one HOT 1
- Question: Finding the right algorithm for exploring nearest successors in a weighted graph without heuristics HOT 3
- Potential shortcut for Dijkstra implementation? HOT 1
- Second argument to dijkstra raises an type error HOT 4
- feat: ColIterator HOT 7
- Add in-place matrix transposition for non-square matrix
- `yen()`'s result is not always ordered HOT 3
- Profile-Guided Optimization (PGO) results
- `dfs_reach` does not visit nodes in `successors` order HOT 2
- Yen's Algorithm cannot handle multiple edges HOT 1
- All the links in Algorithms in Readme are broken HOT 2
- Inconsistency between documentation and code implementation
- RFE: bidirectional search HOT 1
- Add more example HOT 4
- Add Implementation for Prim's algorithm
- A* sometimes doesn't find any path HOT 2
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from pathfinding.