{"id":18015262,"url":"https://github.com/lettier/shortestpath","last_synced_at":"2026-03-05T18:31:40.245Z","repository":{"id":13437329,"uuid":"16126432","full_name":"lettier/shortestpath","owner":"lettier","description":"An interactive HTML5 canvas graph that shows the shortest path between any two nodes.","archived":false,"fork":false,"pushed_at":"2014-01-22T02:50:57.000Z","size":616,"stargazers_count":12,"open_issues_count":0,"forks_count":3,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-22T06:31:37.724Z","etag":null,"topics":["breadth-first-search","dijkstra-algorithm","dijkstra-shortest-path","dijkstras-algorithm","fabric","graph","graph-algorithms","html5-canvas","javascript","path","path-planning","pathfinding","pathfinding-algorithm","shortest-path-algorithm","shortest-path-routing-algorithm","shortest-paths"],"latest_commit_sha":null,"homepage":"https://lettier.com/shortest_path/","language":"JavaScript","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/lettier.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}},"created_at":"2014-01-22T02:40:36.000Z","updated_at":"2024-11-07T06:41:44.000Z","dependencies_parsed_at":"2022-08-29T10:30:54.244Z","dependency_job_id":null,"html_url":"https://github.com/lettier/shortestpath","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lettier%2Fshortestpath","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lettier%2Fshortestpath/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lettier%2Fshortestpath/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lettier%2Fshortestpath/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lettier","download_url":"https://codeload.github.com/lettier/shortestpath/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245712600,"owners_count":20660267,"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":["breadth-first-search","dijkstra-algorithm","dijkstra-shortest-path","dijkstras-algorithm","fabric","graph","graph-algorithms","html5-canvas","javascript","path","path-planning","pathfinding","pathfinding-algorithm","shortest-path-algorithm","shortest-path-routing-algorithm","shortest-paths"],"created_at":"2024-10-30T04:13:25.216Z","updated_at":"2026-03-05T18:31:35.220Z","avatar_url":"https://github.com/lettier.png","language":"JavaScript","readme":"![Alt text](https://raw.github.com/lettier/shortestpath/master/screenshot.jpg)\n \n# Shortest Path\n \nAn interactive HTML5 canvas graph where the edge weights are the euclidean pixel distance between any one edge's incident nodes. Upon selecting a source node and a terminal node, you can see the shortest path (if a path does exist) between them by pressing `Begin`. Dijkstra's algorithm is used to compute the shortest path. To see the shortest path between any other two nodes, press `Reset`. For a whole new graph, press `New Graph`.\n\n`./source/canvas_version` contains the latest version utilizing only the HTML5 canvas object and no other third-party libraries.\n\n`./source/fabric_js_version` contains the original version that uses the Fabric.js canvas library. Note that [Fabric.js 1.4.0](https://github.com/kangax/fabric.js/releases/tag/v1.4.0) is needed.  \n\nPlayable at http://www.lettier.com/shortest_path/.  \n \n_(C) 2014 David Lettier._  \nhttp://www.lettier.com/","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flettier%2Fshortestpath","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flettier%2Fshortestpath","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flettier%2Fshortestpath/lists"}