{"id":25469964,"url":"https://github.com/thinkphp/dijkstra","last_synced_at":"2025-11-04T18:30:25.374Z","repository":{"id":20403541,"uuid":"23679618","full_name":"thinkphp/dijkstra","owner":"thinkphp","description":"Dijkstra's Algorithm for finding the shortest paths between nodes in a weighted graph.","archived":false,"fork":false,"pushed_at":"2024-06-04T16:24:21.000Z","size":36,"stargazers_count":35,"open_issues_count":2,"forks_count":13,"subscribers_count":8,"default_branch":"master","last_synced_at":"2024-06-04T18:23:53.942Z","etag":null,"topics":[],"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/thinkphp.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":"2014-09-04T21:15:42.000Z","updated_at":"2024-06-04T16:24:24.000Z","dependencies_parsed_at":"2024-06-04T18:14:36.810Z","dependency_job_id":null,"html_url":"https://github.com/thinkphp/dijkstra","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thinkphp%2Fdijkstra","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thinkphp%2Fdijkstra/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thinkphp%2Fdijkstra/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thinkphp%2Fdijkstra/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/thinkphp","download_url":"https://codeload.github.com/thinkphp/dijkstra/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239436996,"owners_count":19638411,"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":[],"created_at":"2025-02-18T08:31:32.816Z","updated_at":"2025-11-04T18:30:25.113Z","avatar_url":"https://github.com/thinkphp.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"Dijkstra\n========\n\nDijkstra's algorithm, conceived by computer scientist Edsger Dijkstra, is a graph search algorithm that solves in single-source\nshortest path problem for a graph with non-negative edge path costs, producing a shortest path tree. \n\n![Screenshot](https://miro.medium.com/v2/resize:fit:566/0*LMTm4lzv_xuTGq8J.png)\n\nHow to use\n----------\n\nInclude the latest version MooTools Framework, then dijkstra.js into the page:\n\n\u003cscript src=\"http://ajax.googleapis.com/ajax/libs/mootools/1.5.0/mootools-yui-compressed.js\"\u003e\u003c/script\u003e\n\u003cscript type=\"text/javascript\" src=\"dijkstra-min.js\"\u003e\u003c/script\u003e\n\n\nSample\n-------\n\n  #JS\n\n     var road = [[1, 2, 1],\n                [1, 3, 9],\n                [1, 5, 3],\n                [2, 4, 3],\n                [2, 3, 7],\n                [4, 3, 2],\n                [4, 1, 1],\n                [5, 2, 4],\n                [5, 4, 2]]\n\n    var start = 1, \n        end   = 3;\n\n    var dij = new Dijkstra(start, end, road );\n\n    console.log(\"Cost = \" + dij.getCost() )\n\n    console.log(\"Shortest path from the node \"+ start + \" to \"+ end + \" -\u003e \"+ dij.getShortestPath() )\n\n\n#### Problem Set\n\nhttps://infoarena.ro/problema/dijkstra\n\n## References\n\n  http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthinkphp%2Fdijkstra","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthinkphp%2Fdijkstra","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthinkphp%2Fdijkstra/lists"}