{"id":17306673,"url":"https://github.com/tcort/dijkstrajs","last_synced_at":"2025-04-05T17:07:24.393Z","repository":{"id":17120722,"uuid":"19886872","full_name":"tcort/dijkstrajs","owner":"tcort","description":"A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.","archived":false,"fork":false,"pushed_at":"2023-04-15T19:44:43.000Z","size":85,"stargazers_count":48,"open_issues_count":7,"forks_count":16,"subscribers_count":7,"default_branch":"master","last_synced_at":"2025-03-29T16:07:18.611Z","etag":null,"topics":["dijkstra","javascript","shortest-paths"],"latest_commit_sha":null,"homepage":null,"language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/tcort.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE.md","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-05-17T13:12:45.000Z","updated_at":"2025-02-23T01:30:39.000Z","dependencies_parsed_at":"2024-06-18T13:53:01.161Z","dependency_job_id":null,"html_url":"https://github.com/tcort/dijkstrajs","commit_stats":{"total_commits":18,"total_committers":2,"mean_commits":9.0,"dds":"0.11111111111111116","last_synced_commit":"49ad1ecd5c519281ee3c4711bb78db4d96e19c83"},"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tcort%2Fdijkstrajs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tcort%2Fdijkstrajs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tcort%2Fdijkstrajs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tcort%2Fdijkstrajs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tcort","download_url":"https://codeload.github.com/tcort/dijkstrajs/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247369952,"owners_count":20927928,"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","javascript","shortest-paths"],"created_at":"2024-10-15T11:59:03.668Z","updated_at":"2025-04-05T17:07:24.376Z","avatar_url":"https://github.com/tcort.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# dijkstrajs.js\n\ndijkstrajs is a simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.\n\nThe code was originally written by Wyatt Baldwin and turned into a node module by Thomas Cort.\n\n## Requirements\n\n* [nodejs](http://nodejs.org/)\n\n## Installation\n\n    npm install dijkstrajs\n\n## Examples\n\nSee `test/dijkstra.test.js` in the sources for some example code.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftcort%2Fdijkstrajs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftcort%2Fdijkstrajs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftcort%2Fdijkstrajs/lists"}