CS School Project - This C++ application provides an efficient method for navigating urban environments by calculating the shortest path between buildings using Dijkstra's algorithm. Users can input building names or abbreviations, and the program will return the optimal route, including the distance and detailed path.
active 2024-10-06 → 2024-10-06 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2024-10-06 to 2024-10-06. 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: 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 |
|---|---|---|---|---|
| vsos13 | 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 — 0 stars here means stars gained during the window, not the repo's star count.