Pathfinding Visualizer Issue

[nishtha-agarwal-211]

Description

Goal: Build a project that helps users visualize classic pathfinding algorithms (Dijkstra, A*, BFS, DFS) finding their way from a start node to an end node around user-placed obstacles.

Part 1: Python CLI / GUI (math/Pathfinding-Visualizer/)

• Implement pathfinding logic using a grid structure.
• A CLI representation (e.g., using curses or print refreshes) OR a GUI application using pygame/tkinter.
• Allow setting a start point, target point, and drawing walls/obstacles.

Part 2: Web Interface (web-app/)

• Build an interactive grid component where users can:
  • Click-and-drag to paint walls/obstacles.
  • Select start/end nodes.
  • Select algorithm (BFS, DFS, Dijkstra, A*).
  • Control visualization speed.
• Animate the exploration process (change grid cells to "visiting" and "visited" colors) and highlight the final shortest path in real time.

Deliverables

• Create directory math/Pathfinding-Visualizer/ with the python code.
• Add unit tests in tests/test_pathfinding.py to assert correct shortest paths.
• Register in projects_registry.json.
• Build the interactive grid visualization in web-app/js/projects/pathfinding-visualizer.js.

[github-actions]

⚠️ Important Contribution Guideline

Please do not open a Pull Request without being assigned to this issue first.

Please do not open a Pull Request without being assigned to this issue first.

How to proceed:

1. Comment on this issue to express interest
2. Wait for maintainers to assign you to the issue
3. Once assigned, you can start working on the PR
4. Include the assignment in your PR checklist

Thank you for helping us maintain a smooth workflow! 🙏

[Saloni885]

please assign this issue to me @steam-bell-92

[IshaParihariya]

I'm interested in working on this issue and would like to be assigned.

/assign