{"id":22612484,"url":"https://github.com/faris771/dsaxproj4","last_synced_at":"2025-07-19T20:37:37.915Z","repository":{"id":113276104,"uuid":"506261990","full_name":"faris771/DSAxPROJ4","owner":"faris771","description":"DSA project to find the shortest path between cities using Dijkstra's algorithim","archived":false,"fork":false,"pushed_at":"2022-06-27T09:26:27.000Z","size":485,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-28T23:46:21.644Z","etag":null,"topics":["dijkstra-algorithm","graph","shortest-paths"],"latest_commit_sha":null,"homepage":"","language":"C","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/faris771.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":"2022-06-22T13:35:10.000Z","updated_at":"2022-12-25T00:38:05.000Z","dependencies_parsed_at":null,"dependency_job_id":"ab4978d5-7d70-439b-b89b-ec2269d58dc8","html_url":"https://github.com/faris771/DSAxPROJ4","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/faris771/DSAxPROJ4","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faris771%2FDSAxPROJ4","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faris771%2FDSAxPROJ4/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faris771%2FDSAxPROJ4/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faris771%2FDSAxPROJ4/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/faris771","download_url":"https://codeload.github.com/faris771/DSAxPROJ4/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faris771%2FDSAxPROJ4/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266009402,"owners_count":23863542,"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","graph","shortest-paths"],"created_at":"2024-12-08T17:13:05.216Z","updated_at":"2025-07-19T20:37:37.905Z","avatar_url":"https://github.com/faris771.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"## DIJKSTRA ALGORITHIM TO FIND SHORTEST PATH BETWEEN CITIES\n\n## ![Screenshot from 2022-06-25 09-59-08](https://user-images.githubusercontent.com/70337488/175762504-cdc18a11-e8f7-4a9d-a811-54109c7bded7.png)  \n## ![Screenshot from 2022-06-25 09-57-26](https://user-images.githubusercontent.com/70337488/175762447-2a6ca44b-89fa-480d-8e21-b91a9003657e.png)\n## ![Screenshot from 2022-06-25 09-57-08](https://user-images.githubusercontent.com/70337488/175762448-adb41e31-9eae-4043-9234-0b7e291a69a3.png)\n## ![Screenshot from 2022-06-25 09-56-58](https://user-images.githubusercontent.com/70337488/175762449-68a8e558-5f1d-4121-bab8-34bc8d128bd0.png)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffaris771%2Fdsaxproj4","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffaris771%2Fdsaxproj4","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffaris771%2Fdsaxproj4/lists"}