{"id":8605710,"url":"https://github.com/gmclan-org/dijkstra-graph","last_synced_at":"2026-01-14T22:45:55.740Z","repository":{"id":150388033,"uuid":"480159756","full_name":"gmclan-org/dijkstra-graph","owner":"gmclan-org","description":"Dijkstra algorithm solution in GameMaker (Studio 2) to find shortest path in graph between two points.","archived":false,"fork":false,"pushed_at":"2023-08-09T18:26:50.000Z","size":98,"stargazers_count":5,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-08-05T04:41:05.511Z","etag":null,"topics":["ai","freeware","gamemaker","graph","mesh","navigation","pathfinding","tree"],"latest_commit_sha":null,"homepage":"","language":"Game Maker Language","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/gmclan-org.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-04-10T22:52:44.000Z","updated_at":"2025-07-02T14:24:50.000Z","dependencies_parsed_at":"2024-12-08T07:31:09.558Z","dependency_job_id":"7c926e9a-a5a6-43b4-9624-e96e36b38d06","html_url":"https://github.com/gmclan-org/dijkstra-graph","commit_stats":null,"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"purl":"pkg:github/gmclan-org/dijkstra-graph","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmclan-org%2Fdijkstra-graph","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmclan-org%2Fdijkstra-graph/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmclan-org%2Fdijkstra-graph/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmclan-org%2Fdijkstra-graph/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gmclan-org","download_url":"https://codeload.github.com/gmclan-org/dijkstra-graph/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmclan-org%2Fdijkstra-graph/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28436793,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-14T22:37:52.437Z","status":"ssl_error","status_checked_at":"2026-01-14T22:37:31.496Z","response_time":107,"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":["ai","freeware","gamemaker","graph","mesh","navigation","pathfinding","tree"],"created_at":"2024-04-26T12:27:53.252Z","updated_at":"2026-01-14T22:45:55.732Z","avatar_url":"https://github.com/gmclan-org.png","language":"Game Maker Language","funding_links":[],"categories":["Pathing"],"sub_categories":["Recommendations"],"readme":"![Screenshot](_docs/dijkstra.png)\n\n# Dijsktra pathfinding in weighted graph for GameMaker\n\nThis is example of pathfinding in weighted graph, using Dijsktra alghoritm.\nIt uses priority queques for searching rather than matrices, which would require NxN array, where N is number of nodes.\n\nAlso contains an example of creating/updating/displaying graph, which isn't required to work.\n\nCheck [Wiki](https://github.com/gmclan-org/dijkstra-graph/wiki) for more info.\n\n# Znajdywanie drogi w grafie z wagami używając alorytmu Dijsktry dla GameMaker\n\nPrzykład znajdywania drogi w grafie z wagami używając alorytmu Dijsktry.\nKorzysta z kolejek priorytetowych zamiast z macierzy, co wymagałoby tablicy o rozmiarze NxN, gdzie N to licza wierzchołków.\n\nZawiera te przykład dodawania/edytowania/wyświetlania grafu, który nie jest wymagany do działania.\n\nDokumentacja znajduje się w  [Wiki](https://github.com/gmclan-org/dijkstra-graph/wiki).\n\n---\n\nCreated by Piotr Gnys ([@gnysek](https://github.com/gnysek)).\n\nManaged by [GameMaker's Clan - gmclan.org](https://gmclan.org).\n\nYou can freely use, modify, and re-distribute code. Of course it would be nice if you mention author in game credits, but this is not required.\n\n*GameMaker was previously known as GameMaker Studio 2.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgmclan-org%2Fdijkstra-graph","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgmclan-org%2Fdijkstra-graph","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgmclan-org%2Fdijkstra-graph/lists"}