An A* path finding algorithm visualiser using python. This program allows for the user to place 2 coloured dots and then place barriers around a grid. Then we can find the shortest path using A* path finding (visually)
active 2024-06-18 → 2024-06-23 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 6 days from 2024-06-18 to 2024-06-23. Pushes: 4 total, peak 2 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 |
|---|---|---|---|---|
| RahmanImtiaz | 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.