Este projeto implementa o Algoritmo de Dijkstra (aquele que encontra o caminho mais curto entre os vértices de um grafo) usando JavaScript. Imagine que você tem um mapa de cidades e quer saber o jeito mais rápido (ou menos cansativo) de ir de uma cidade para outra. Este código faz exatamente isso!
active 2024-09-20 → 2024-10-31 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 42 days from 2024-09-20 to 2024-10-31. Pushes: 8 total, peak 6 in a day. Pull requests: 2 total, peak 2 in a day. Issues: 0 total, peak 0 in a day. Comments: 1 total, peak 1 in a day. Stars: 3 total, peak 2 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 |
|---|---|---|---|---|
| WesleyPatrick | 9 | 7 | 2 | 0 |
| vercel[bot] | 1 | 0 | 0 | 1 |
| gabste8831 | 1 | 1 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 3 stars here means stars gained during the window, not the repo's star count.