{"id":19959261,"url":"https://github.com/username0x0a/dijkstra","last_synced_at":"2025-07-16T12:35:56.460Z","repository":{"id":72479370,"uuid":"258339230","full_name":"username0x0a/Dijkstra","owner":"username0x0a","description":"Simple objective implementation of Dijkstra algorithm (shortest path search) written in Objective-C","archived":false,"fork":false,"pushed_at":"2020-04-23T22:03:43.000Z","size":42,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-01T16:22:43.708Z","etag":null,"topics":["dijkstra","dijkstra-algorithm","objc","objective-c","shortest-path-problem","shortest-paths"],"latest_commit_sha":null,"homepage":null,"language":"Objective-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/username0x0a.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":"2020-04-23T21:51:11.000Z","updated_at":"2020-04-24T07:40:19.000Z","dependencies_parsed_at":null,"dependency_job_id":"0dc98bed-64a6-4e86-bf06-37e2346cf02a","html_url":"https://github.com/username0x0a/Dijkstra","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/username0x0a/Dijkstra","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/username0x0a%2FDijkstra","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/username0x0a%2FDijkstra/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/username0x0a%2FDijkstra/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/username0x0a%2FDijkstra/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/username0x0a","download_url":"https://codeload.github.com/username0x0a/Dijkstra/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/username0x0a%2FDijkstra/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261249796,"owners_count":23130494,"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","dijkstra-algorithm","objc","objective-c","shortest-path-problem","shortest-paths"],"created_at":"2024-11-13T01:47:02.666Z","updated_at":"2025-06-22T06:37:43.805Z","avatar_url":"https://github.com/username0x0a.png","language":"Objective-C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Dijkstra\n\nExample _Dijkstra_ algorithm (shortest path problem) implementation written in Objective-C.\n\n## Usage\n\n![Example usage](https://raw.githubusercontent.com/username0x0a/Dijkstra/master/example.png)\n\n```swift\n#import \u003cDijkstra/Dijkstra.h\u003e\n\n// Define the nodes\n\nDJKNode *Brno      = [DJKNode nodeWithID:@\"Brno\"];\nDJKNode *Praha     = [DJKNode nodeWithID:@\"Praha\"];\nDJKNode *Ostrava   = [DJKNode nodeWithID:@\"Ostrava\"];\nDJKNode *Pardubice = [DJKNode nodeWithID:@\"Pardubice\"];\nDJKNode *Kolin     = [DJKNode nodeWithID:@\"Kolin\"];\nDJKNode *Plzen     = [DJKNode nodeWithID:@\"Plzen\"];\nDJKNode *Adamov    = [DJKNode nodeWithID:@\"Adamov\"];\n\n// Define the graph edges\n\nNSArray\u003cDJKEdge *\u003e *edges = @[\n\t[DJKEdge edgeFromNode:Ostrava   toNode:Brno    cost:180],\n\t[DJKEdge edgeFromNode:Praha     toNode:Ostrava cost:420],\n\t[DJKEdge edgeFromNode:Pardubice toNode:Brno    cost:110],\n\t[DJKEdge edgeFromNode:Pardubice toNode:Praha   cost:90],\n\t[DJKEdge edgeFromNode:Pardubice toNode:Plzen   cost:140],\n\t[DJKEdge edgeFromNode:Pardubice toNode:Ostrava cost:290],\n\t[DJKEdge edgeFromNode:Plzen     toNode:Praha   cost:70],\n\t[DJKEdge edgeFromNode:Adamov    toNode:Adamov  cost:0],\n];\n\n// Initialize the graph itself\n\nDJKGraph *G = [DJKGraph graphWithEdges:edges];\n\n// Look for shortest paths and print'em\n\nNSLog(@\"%@\", [G shortestPathFromNode:Praha toNode:Ostrava]);\n// [Praha, Pardubice, Ostrava]\nNSLog(@\"%@\", [G shortestPathFromNode:Ostrava toNode:Plzen]);\n// [Ostrava, Pardubice, Plzen]\nNSLog(@\"%@\", [G shortestPathFromNode:Ostrava toNode:Ostrava]);\n// [Ostrava]\nNSLog(@\"%@\", [G shortestPathFromNode:Brno toNode:Kolin]);\n// []\n```\n\n## License\n\nDijkstra example is released under the MIT license. See the LICENSE file for details.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fusername0x0a%2Fdijkstra","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fusername0x0a%2Fdijkstra","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fusername0x0a%2Fdijkstra/lists"}