Skip to content
GitHub Explorer

WesleyPatrick/dijkstra_algorithm_javascript

View on GitHub ↗Related repositories →

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-21 → 2024-10-31 (UTC)

Partial coverage20,523 / 26,279 hourly files (78%) · 2 absent upstream · 5,753 failed, retryable2023-08-15 → 2026-08-13 (UTC)— sampled evenly across the window, so rankings and trends hold; absolute counts scale up.
Events
17
Pushes
8
Pull requests
2
Issues
0
Stars
3
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 41 days from 2024-09-21 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

ContributorContributionsPushesPRsComments
WesleyPatrick9720
vercel[bot]1001
gabste88311100

Recent activity

Latest issues, pull requests and releases

  • Pull request#1WesleyPatrick2024-09-21 18:39
  • Issue comment#1vercel[bot]2024-09-21 18:39
    adding-colaborator
  • Pull request#1WesleyPatrick2024-09-21 18:39

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.