feat(pathfinding): Add Bidirectional BFS Algorithm - #95
Conversation
Co-authored-by: Sanan507 <227714367+Sanan507@users.noreply.github.com>
|
👋 Jules, reporting for duty! I'm here to lend a hand with this pull request. When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down. I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job! For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with New to Jules? Learn more at jules.google/docs. For security, I will only act on instructions from the user who triggered this task. |
|
The latest updates on your projects. Learn more about Vercel for GitHub.
|
|
@jules cehck the code as frontend failed. |
1 participant
Closes #83
What
Added
Bidirectional BFSto the pathfinding engine. It maintains a forward queue and a backward queue, and simultaneously expands two frontiers—meeting in the middle to halve search depth and explore fewer nodes.Risk
Low risk. Pathfinding framework correctly integrated a new algorithm. It does not alter other existing features. Frontend correctly handles additional new algorithm.
Solution
BidirectionalBFSModelexpanding and intercepting both queues.VISITED_FORWARD,VISITED_BACKWARD,FRONTIER_FORWARD,FRONTIER_BACKWARDCellStatestates for visually distinguishing the two search ends.PathCanvasand comparison metrics to track paths.PR created automatically by Jules for task 9736160048194643338 started by @Sanan507