{"id":19664560,"url":"https://github.com/sancakerkan/shortestpath_dijkstra","last_synced_at":"2026-05-12T08:39:10.959Z","repository":{"id":246833990,"uuid":"822309523","full_name":"sancakerkan/ShortestPath_Dijkstra","owner":"sancakerkan","description":"This project implements the solution to find the shortest path in a directed graph using Dijkstra's algorithm.","archived":false,"fork":false,"pushed_at":"2024-06-30T22:02:54.000Z","size":6,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-27T03:49:55.448Z","etag":null,"topics":["digraph","dijkstra-algorithm","dijkstra-shortest-path","graphs","java","shortest-path-algorithm"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sancakerkan.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2024-06-30T21:58:05.000Z","updated_at":"2024-06-30T22:03:43.000Z","dependencies_parsed_at":null,"dependency_job_id":"53bee9d2-912e-4a27-9f0d-b2e1856b5234","html_url":"https://github.com/sancakerkan/ShortestPath_Dijkstra","commit_stats":null,"previous_names":["sancakerkan/shortestpath_dijkstra"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sancakerkan/ShortestPath_Dijkstra","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FShortestPath_Dijkstra","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FShortestPath_Dijkstra/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FShortestPath_Dijkstra/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FShortestPath_Dijkstra/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sancakerkan","download_url":"https://codeload.github.com/sancakerkan/ShortestPath_Dijkstra/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FShortestPath_Dijkstra/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32931311,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-11T17:09:15.040Z","status":"online","status_checked_at":"2026-05-12T02:00:06.338Z","response_time":102,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["digraph","dijkstra-algorithm","dijkstra-shortest-path","graphs","java","shortest-path-algorithm"],"created_at":"2024-11-11T16:18:06.358Z","updated_at":"2026-05-12T08:39:10.945Z","avatar_url":"https://github.com/sancakerkan.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ShortestPath_Dijkstra\n\nThis project implements the solution to find the shortest path in a directed graph using Dijkstra's algorithm. The starting point is 0, and the finish points are 1, 2, and 3. The program reads the graph data from a text file, constructs the graph, and then finds the shortest paths.\n\n## Project Structure\n\nThe project consists of three main Java classes and one text file:\n\n1. **HW3_Q2_solution.java**: The main program that solves the shortest path problem.\n2. **FileRead.java**: A class that reads graph data from a text file.\n3. **ValueFinder.java**: A class that converts values from the text file into integers and creates the directed graph.\n4. **HW3_Q2.txt**: A text file containing the graph data.\n\n## How to Compile and Run\n\n1. **Compile the Java files**:\n   ```sh\n   javac HW3_Q2_solution.java FileRead.java ValueFinder.java\n\n2. **Run the main program**:\n   ```sh\n   java HW3_Q2_solution\n\n### Important : Make sure text file is readable\n\n## License\n\nThis project is licensed under the MIT License - see the [LICENSE](https://github.com/sancakerkan/ShortestPath_Dijkstra/blob/main/LICENSE) file for details.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsancakerkan%2Fshortestpath_dijkstra","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsancakerkan%2Fshortestpath_dijkstra","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsancakerkan%2Fshortestpath_dijkstra/lists"}