{"id":18819719,"url":"https://github.com/mfurmanczyk/dijkstra","last_synced_at":"2026-01-17T04:30:19.334Z","repository":{"id":241326920,"uuid":"797451338","full_name":"MFurmanczyk/Dijkstra","owner":"MFurmanczyk","description":"Implementation of Dijkstra Shortest Path algorithm with C++ and SFML.","archived":false,"fork":false,"pushed_at":"2024-05-27T19:40:12.000Z","size":55,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-12-30T03:18:45.056Z","etag":null,"topics":["algorithms-and-data-structures","cpp","dijkstra-algorithm","dijkstra-shortest-path"],"latest_commit_sha":null,"homepage":"","language":"C++","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/MFurmanczyk.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-05-07T21:28:09.000Z","updated_at":"2024-05-27T19:40:15.000Z","dependencies_parsed_at":null,"dependency_job_id":"053b7aad-518b-4aff-8e2c-0b550cfbdace","html_url":"https://github.com/MFurmanczyk/Dijkstra","commit_stats":null,"previous_names":["mfurmanczyk/dijkstra"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MFurmanczyk%2FDijkstra","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MFurmanczyk%2FDijkstra/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MFurmanczyk%2FDijkstra/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MFurmanczyk%2FDijkstra/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MFurmanczyk","download_url":"https://codeload.github.com/MFurmanczyk/Dijkstra/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239758830,"owners_count":19692033,"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":["algorithms-and-data-structures","cpp","dijkstra-algorithm","dijkstra-shortest-path"],"created_at":"2024-11-08T00:24:38.593Z","updated_at":"2025-02-20T00:42:35.233Z","avatar_url":"https://github.com/MFurmanczyk.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Dijsktra's algorithm\nImplementation of Dijkstra's SP algorithm.\n\n## Data structures and algorithms\n- K-d tree - finds nearest vertex in a graph for start point and end point.\n- Dijkstra's algorithm - finds shortest path in graph.\n- Priority indexed queue - used in egde relaxation.\n- Directed graph with weighted edges.\n\n## Libraries\nOne of the goals of the project was to use the standard library in as many cases as possible. Visual side of this application is coded with [SFML](https://www.sfml-dev.org/).\n\n## Controlls\n| Action | Button  |\n| ------- | --- |\n| Set start point | **LMB** |\n| Set end point | **RMB** |\n| Quit | **Esc** |\n| Reset | **R** |\n\nIn order to find path user needs to:\n1. Set start point.\n2. Set end point.\n3. If user wants to find another path Reset action is required.\n\n## Screenshots\n![Scr2](https://github.com/MFurmanczyk/edurithm_dijkstra/assets/46996333/4f711c98-98f5-45f3-8551-1b51ec438d77)\n\n\n## Literature\nLiterature and sites I used while coding this application:\n- [Algorithms, 4th edition](https://algs4.cs.princeton.edu/home/) by Robert Sedgewick and Kevin Wayne\n- [C++ documentation](https://en.cppreference.com/w/)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmfurmanczyk%2Fdijkstra","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmfurmanczyk%2Fdijkstra","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmfurmanczyk%2Fdijkstra/lists"}