Los algoritmos voraces son fundamentales en la teoría de grafos. Prim y Kruskal construyen árboles de expansión mínima seleccionando aristas de peso mínimo, mientras que Dijkstra encuentra caminos más cortos en grafos con pesos no negativos. Estos métodos son esenciales para la optimización de rutas y la gestión de redes.
active 2024-06-08 → 2024-12-28 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 204 days from 2024-06-08 to 2024-12-28. Pushes: 9 total, peak 6 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 |
|---|---|---|---|---|
| Ka1laK | 9 | 9 | 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.