I developed a mapping/routing system that can find the shortest path between two users based on specific metrics. To achieve this, I've decided to implement three algorithms: Breadth-first Search (BFS), Depth-first Search (DFS), and the A* algorithm.
active 2024-01-17 → 2024-01-19 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 3 days from 2024-01-17 to 2024-01-19. Pushes: 1 total, peak 1 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: 1 total, peak 1 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 |
|---|---|---|---|---|
| abm312 | 1 | 1 | 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 — 1 stars here means stars gained during the window, not the repo's star count.