{"id":29192436,"url":"https://github.com/analiaburgosdev/java_dijkstra","last_synced_at":"2025-10-05T14:32:22.566Z","repository":{"id":284645017,"uuid":"955610256","full_name":"analiaBurgosDev/java_dijkstra","owner":"analiaBurgosDev","description":"The objective of this exercise is to implement **Dijkstra's Algorithm** to find the shortest path in a weighted graph .","archived":false,"fork":false,"pushed_at":"2025-03-26T23:08:11.000Z","size":6,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-11T23:41:36.862Z","etag":null,"topics":["dijkstra-algorithm","java"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/analiaBurgosDev.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2025-03-26T23:05:58.000Z","updated_at":"2025-03-31T21:44:47.000Z","dependencies_parsed_at":"2025-03-27T00:22:21.823Z","dependency_job_id":"79c56785-635e-48b4-a30d-ede5e3a92b26","html_url":"https://github.com/analiaBurgosDev/java_dijkstra","commit_stats":null,"previous_names":["ayvero/java_dijkstra","analiaburgosdev/java_dijkstra"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/analiaBurgosDev/java_dijkstra","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_dijkstra","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_dijkstra/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_dijkstra/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_dijkstra/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/analiaBurgosDev","download_url":"https://codeload.github.com/analiaBurgosDev/java_dijkstra/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_dijkstra/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263059505,"owners_count":23407370,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["dijkstra-algorithm","java"],"created_at":"2025-07-02T01:30:47.036Z","updated_at":"2025-10-05T14:32:22.507Z","avatar_url":"https://github.com/analiaBurgosDev.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"#  Algoritmo de Dijkstra\n\n## Descripción del Problema\nEl objetivo de este ejercicio es implementar el **algoritmo de Dijkstra** para encontrar el camino más corto en un grafo con pesos no negativos. Dado un vértice de origen, el algoritmo calcula el **array de distancias mínimas** desde el origen hasta cada vértice y determina los **predecesores** en el camino más corto. Finalmente, se debe imprimir el camino más corto desde el origen hasta cada vértice.\n\n## Enfoque\n- **Cola de Prioridad**: Se utiliza una cola de prioridad (min-heap) para seleccionar el siguiente vértice con la menor distancia conocida.\n- **Actualización de Distancias**: Se actualizan iterativamente las distancias mínimas para cada vértice.\n- **Reconstrucción del Camino**: Se almacena la información de predecesores para reconstruir el camino más corto.\n\n## Aplicaciones\nEl algoritmo de Dijkstra es ampliamente utilizado en:\n- **Navegación y Sistemas GPS**: Para encontrar la ruta más corta en mapas.\n- **Enrutamiento de Redes**: Optimización de transmisión de datos en redes de computadoras.\n- **Logística y Transporte**: Planificación eficiente de rutas para entregas.\n  \n--------------------------------\n\n# Dijkstra's Algorithm\n\n## Problem Description\nThe objective of this exercise is to implement **Dijkstra's Algorithm** to find the shortest path in a weighted graph with non-negative weights. Given a source vertex, the algorithm calculates the **minimum distance array** from the source to each vertex and determines the **predecessors** in the shortest path. Finally, the shortest path from the source to each vertex should be printed.\n\n## Approach\n- **Priority Queue**: Uses a priority queue (min-heap) to efficiently find the next vertex with the smallest known distance.\n- **Distance Updates**: Iteratively updates the minimum distance for each vertex.\n- **Path Reconstruction**: Stores predecessor information to reconstruct the shortest path.\n\n## Applications\nDijkstra’s algorithm is widely used in:\n- **Navigation and GPS Systems**: Finding the shortest route in maps.\n- **Network Routing**: Optimizing data packet transmission in computer networks.\n- **Logistics and Transportation**: Efficient route planning for deliveries.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanaliaburgosdev%2Fjava_dijkstra","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanaliaburgosdev%2Fjava_dijkstra","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanaliaburgosdev%2Fjava_dijkstra/lists"}