A Python project that visually compares multiple pathfinding algorithms (BFS, A*, Dijkstra, Greedy) on randomly generated labyrinths using Pygame. The project features configurable execution modes (manual and automatic), a scoring system based on solution quality (distance and nodes used), and interactive visualization of each algorithm’s progress.
active 2025-02-22 → 2025-02-22 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2025-02-22 to 2025-02-22. Pushes: 4 total, peak 4 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| fa8i | 4 | 4 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.