{"id":19664568,"url":"https://github.com/sancakerkan/graphshortestpath","last_synced_at":"2025-08-24T13:40:49.412Z","repository":{"id":244298379,"uuid":"786428726","full_name":"sancakerkan/GraphShortestPath","owner":"sancakerkan","description":"This repository implements algorithms for finding the shortest path in a graph","archived":false,"fork":false,"pushed_at":"2024-06-30T17:26:36.000Z","size":7,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-27T03:49:55.125Z","etag":null,"topics":["graph-algorithms","graphs","java","shortest-path-algorithm","shortest-paths"],"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-04-14T12:43:36.000Z","updated_at":"2024-07-22T10:27:25.000Z","dependencies_parsed_at":"2024-06-13T23:04:27.668Z","dependency_job_id":"e41cf6be-fac6-4742-a64d-51771b35893b","html_url":"https://github.com/sancakerkan/GraphShortestPath","commit_stats":null,"previous_names":["sancakerkan/graphshortestpath"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sancakerkan/GraphShortestPath","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FGraphShortestPath","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FGraphShortestPath/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FGraphShortestPath/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FGraphShortestPath/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sancakerkan","download_url":"https://codeload.github.com/sancakerkan/GraphShortestPath/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FGraphShortestPath/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271876752,"owners_count":24837456,"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","status":"online","status_checked_at":"2025-08-24T02:00:11.135Z","response_time":111,"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":["graph-algorithms","graphs","java","shortest-path-algorithm","shortest-paths"],"created_at":"2024-11-11T16:18:06.930Z","updated_at":"2025-08-24T13:40:49.399Z","avatar_url":"https://github.com/sancakerkan.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Graph Shortest Path\nThis repository implements algorithms for finding the shortest path in a graph. It provides solutions to two main problems:\n1. Finding the lexicographically smallest path with minimum travel time between islands in a coastal city.\n2. Organizing a city tour that starts from a specific city, includes another city, and returns to the starting point.\n## Features\n- Implementation of a graph data structure.\n- Algorithms to find the shortest path using BFS and DFS techniques.\n- Solutions for both coastal city routes and city tour problems.\n## Usage\nThe repository contains Java implementations for:\n- Graph structure\n- Shortest path algorithms\n- Input parsing and output formatting\n## Contribution\nContributions are welcome! Feel free to fork the repository, create a new branch, and submit pull requests for improvements or bug fixes.\n## License\nThis project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsancakerkan%2Fgraphshortestpath","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsancakerkan%2Fgraphshortestpath","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsancakerkan%2Fgraphshortestpath/lists"}