{"id":24757824,"url":"https://github.com/maemoonfarooq/shortest-path-finder-using-parallel-processing","last_synced_at":"2026-04-18T01:03:53.074Z","repository":{"id":245705946,"uuid":"808573183","full_name":"MaemoonFarooq/Shortest-Path-Finder-using-Parallel-Processing","owner":"MaemoonFarooq","description":"Welcome to the Parallel Shortest Path Finder! This innovative tool is designed to swiftly determine the shortest routes between pairs of nodes in a graph. Leveraging the power of Dijkstra's algorithm, it navigates graph connections using an adjacency list and a hash table-based distance matrix for optimal efficiency.","archived":false,"fork":false,"pushed_at":"2024-05-31T11:06:57.000Z","size":3260,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-23T09:11:47.852Z","etag":null,"topics":["bash-script","c","data-structures","mpi","openmp-parallelization"],"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/MaemoonFarooq.png","metadata":{"files":{"readme":"readme.txt","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":"2024-05-31T10:53:08.000Z","updated_at":"2025-03-11T10:50:13.000Z","dependencies_parsed_at":"2024-06-23T15:47:41.428Z","dependency_job_id":"ace93bfb-4403-4945-8d77-17c91959838c","html_url":"https://github.com/MaemoonFarooq/Shortest-Path-Finder-using-Parallel-Processing","commit_stats":null,"previous_names":["maemoonfarooq/shortest-path-finder-using-parallel-processing"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/MaemoonFarooq/Shortest-Path-Finder-using-Parallel-Processing","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaemoonFarooq%2FShortest-Path-Finder-using-Parallel-Processing","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaemoonFarooq%2FShortest-Path-Finder-using-Parallel-Processing/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaemoonFarooq%2FShortest-Path-Finder-using-Parallel-Processing/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaemoonFarooq%2FShortest-Path-Finder-using-Parallel-Processing/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MaemoonFarooq","download_url":"https://codeload.github.com/MaemoonFarooq/Shortest-Path-Finder-using-Parallel-Processing/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaemoonFarooq%2FShortest-Path-Finder-using-Parallel-Processing/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31952208,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-18T00:39:45.007Z","status":"ssl_error","status_checked_at":"2026-04-18T00:39:20.671Z","response_time":62,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["bash-script","c","data-structures","mpi","openmp-parallelization"],"created_at":"2025-01-28T15:36:19.913Z","updated_at":"2026-04-18T01:03:53.050Z","avatar_url":"https://github.com/MaemoonFarooq.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"Welcome to our project of Parrarel Distributed Computing\n\nHow to run the file:\n\n1.Run the command on you terminal to complile the bash script file:\n chmod +x driver.sh\n\n2.Now as the file has been compiled an executale has been made as:\n driver.sh\n\n3.To run the executable type:\n ./driver.sh\n\nNow the program is running make sure to enter the commands that display on\nthe terminal after executing only after teh GUI is printed otherwise the program\nmay crash\n\nThe bashscript upon executing first compiles the C code and then \none by one executes for each file.\n\nIMPORTANT \nMake sure that all the graph files are in your directory where the code is.\nAlso you need to make sure that the path of the directory is correct which\nyou can change according to your needs\nThe path is stated in the top line of the bash script\n\nThats All :)\n\nGroup Members:\nMaemoon Farooq 21i1680\nAbubakr        21i1691\nWaleed Saeed   21i1672\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaemoonfarooq%2Fshortest-path-finder-using-parallel-processing","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmaemoonfarooq%2Fshortest-path-finder-using-parallel-processing","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaemoonfarooq%2Fshortest-path-finder-using-parallel-processing/lists"}