{"id":18777282,"url":"https://github.com/iyowei/dijkstra","last_synced_at":"2025-12-16T19:30:16.759Z","repository":{"id":57119755,"uuid":"446386683","full_name":"iyowei/dijkstra","owner":"iyowei","description":"迪克斯特拉最短路径算法。","archived":false,"fork":false,"pushed_at":"2022-01-12T04:49:18.000Z","size":85,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-04-25T06:02:18.839Z","etag":null,"topics":["algorithm","algorithms","dijkstra","shortest-path-algorithm"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/iyowei.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}},"created_at":"2022-01-10T10:58:40.000Z","updated_at":"2022-01-12T04:54:24.000Z","dependencies_parsed_at":"2022-08-23T15:40:52.515Z","dependency_job_id":null,"html_url":"https://github.com/iyowei/dijkstra","commit_stats":null,"previous_names":[],"tags_count":6,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iyowei%2Fdijkstra","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iyowei%2Fdijkstra/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iyowei%2Fdijkstra/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iyowei%2Fdijkstra/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/iyowei","download_url":"https://codeload.github.com/iyowei/dijkstra/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239687441,"owners_count":19680733,"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":["algorithm","algorithms","dijkstra","shortest-path-algorithm"],"created_at":"2024-11-07T20:09:35.160Z","updated_at":"2025-12-16T19:30:16.710Z","avatar_url":"https://github.com/iyowei.png","language":"JavaScript","readme":"# @iyowei/dijkstra\n\n找到两个顶点之间的最短路径。\n\n- [x] 现代化；\n- [x] 高[性能](#性能)；\n- [x] 包含 \"单源、有向、无环、无负权、多叉树\" 图的编辑、最短路径查询等函数；\n- [x] Treeshaking 友好；\n- [x] 充分测试；\n\n## 目录\n\n- [使用](#使用)\n- [APIs](#apis)\n- [性能](#性能)\n- [安装](#安装)\n- [参与贡献](#参与贡献)\n- [其它](#其它)\n\n## 使用\n\n```js\nimport { log } from 'console';\nimport { grapher, addEdge, find } from '@iyowei/dijkstra';\n\nconst grapherInstance = grapher();\n\naddEdge('one', 'two', 5, graph);\naddEdge('one', 'three', 2, graph);\n\naddEdge('three', 'two', 8, graph);\naddEdge('three', 'five', 7, graph);\n\naddEdge('two', 'four', 4, graph);\naddEdge('two', 'five', 2, graph);\n\naddEdge('four', 'five', 6, graph);\naddEdge('four', 'final', 3, graph);\n\naddEdge('five', 'final', 1, graph);\n\nconst { path } = find({\n  startNode: 'one',\n  endNode: 'final',\n  grapherInstance,\n});\n\nlog(path); // ['one', 'two', 'five', 'final']\n```\n\n## APIs\n\n### `grapher()`\n\n初始化实例数据，支持多实例。\n\n### `addEdge(parentNodeId, childNodeId, weight, grapherInstance)`\n\n- `parentNodeId` { String } 父节点 ID\n- `childNodeId` { String } 子节点 ID\n- `weight` { Number } 权重\n- `grapherInstance` 使用 `grapher()` 创建的图实例\n- 返回 { Number } 添加权重成功与否，`1` 表示成功，`-1` 表示操作失败\n\n向图中增加新的权重关系。\n\n### `find({ startNodeId, endNodeId, grapherInstance })`\n\n- `startNodeId` { String } 开始节点 ID\n- `endNodeId` { String } 结束节点 ID\n- `grapherInstance` 使用 `grapher()` 创建的图实例\n- 返回 { Object }\n  - `path` { Array } 最短路径\n  - `weight` { Array } 最短路径权重\n\n指定开始节点、结束节点，寻找它们的最短路径。\n\n### `isAcyclic(startNodeId, endNodeId, grapherInstance)`\n\n- `startNodeId` { String } 开始节点 ID\n- `endNodeId` { String } 结束节点 ID\n- `grapherInstance` 使用 `grapher()` 创建的图实例\n- 返回 { Boolean }\n  - `true` 无环\n  - `false` 回环\n\n指定开始节点、结束节点，检查是否回环。\n\n### `deleteNode(nodeId, grapherInstance)`\n\n- `nodeId` { String } 节点 ID\n- `grapherInstance` 使用 `grapher()` 创建的图实例\n- 返回 { Number } 删除节点成功与否，`1` 表示成功，`-1` 表示操作失败\n\n删除指定节点。\n\n### `deleteDependence(startNodeId, endNodeId, grapherInstance)`\n\n- `startNodeId` { String } 开始节点 ID\n- `endNodeId` { String } 结束节点 ID\n- `grapherInstance` 使用 `grapher()` 创建的图实例\n- 返回 { Number } 删除节点成功与否，`1` 表示成功，`-1` 表示操作失败\n\n删除指定节点间的权重。\n\n## 性能\n\n```js\nimport Benchmark from 'benchmark';\nimport { grapher, addEdge, find } from './dijkstra.js';\n\nconst grapherInstance = grapher();\ngrapherInstance.acyclic = true;\ngrapherInstance.source = true;\n\naddEdge('one', 'two', 5, grapherInstance);\naddEdge('one', 'three', 2, grapherInstance);\naddEdge('three', 'two', 8, grapherInstance);\n\naddEdge('three', 'five', 7, grapherInstance);\n\naddEdge('two', 'four', 4, grapherInstance);\n\naddEdge('two', 'five', 2, grapherInstance);\naddEdge('four', 'five', 6, grapherInstance);\n\naddEdge('four', 'final', 3, grapherInstance);\n\naddEdge('five', 'final', 1, grapherInstance);\n\nconst foundShortestPath = find({\n  startNodeId: 'one',\n  endNodeId: 'final',\n  grapherInstance,\n});\n\nnew Benchmark.Suite()\n  .add('find', () =\u003e {\n    find({\n      startNodeId: 'one',\n      endNodeId: 'final',\n      grapherInstance,\n    });\n  })\n  .add('path', () =\u003e {\n    foundShortestPath.path;\n  })\n  .on('cycle', (event) =\u003e {\n    console.log(String(event.target));\n  })\n  .run({ async: true });\n```\n\n### find\n\n```\nfind x 1,774,453 ops/sec ±0.86% (89 runs sampled)\n```\n\n### path\n\n```\npath x 3,250,928 ops/sec ±0.62% (91 runs sampled)\n```\n\n测试用机器，\n\n```shell\n                    'c.\n                 ,xNMM.\n               .OMMMMo           OS: macOS 12.1 21C52 x86_64\n               OMMM0,            Host: MacBookPro11,5\n     .;loddo:' loolloddol;.      Kernel: 21.2.0\n   cKMMMMMMMMMMNWMMMMMMMMMM0:    Uptime: 3 days, 13 hours\n .KMMMMMMMMMMMMMMMMMMMMMMMWd.    Packages: 172 (brew)\n XMMMMMMMMMMMMMMMMMMMMMMMX.      Shell: zsh 5.8\n;MMMMMMMMMMMMMMMMMMMMMMMM:       Resolution: 1920x1200@2x\n:MMMMMMMMMMMMMMMMMMMMMMMM:       DE: Aqua\n.MMMMMMMMMMMMMMMMMMMMMMMMX.      WM: Rectangle\n kMMMMMMMMMMMMMMMMMMMMMMMMWd.    Terminal: iTerm2\n .XMMMMMMMMMMMMMMMMMMMMMMMMMMk   Terminal Font: Hack-Regular 12\n  .XMMMMMMMMMMMMMMMMMMMMMMMMK.   CPU: Intel i7-4870HQ (8) @ 2.50GHz\n    kMMMMMMMMMMMMMMMMMMMMMMd     GPU: AMD Radeon R9 M370X, Intel Iris Pro\n     ;KMMMMMMMWXXWMMMMMMMk.      Memory: 8880MiB / 16384MiB\n       .cooc,.    .,coo:.\n```\n\n## 安装\n\n\u003c!-- 标明支持的宿主、宿主版本，模块类型 --\u003e\n\n![esm][esm] [![Node Version Badge][node version badge]][download node.js] ![browser][browser]\n\n### NPM\n\n```shell\nnpm add @iyowei/dijkstra\n```\n\n### PNPM\n\n```shell\npnpm add @iyowei/dijkstra\n```\n\n### Yarn\n\n```shell\nyarn add @iyowei/dijkstra\n```\n\n## 参与贡献\n\n![PRs Welcome][prs welcome badge]\n\n## 其它\n\n\"@iyowei/dijkstra\" 使用 [@iyowei/create-esm][create-esm] 脚手架生成。\n\n[browser]: https://img.shields.io/badge/Browser-orange?style=flat\n[node version badge]: https://img.shields.io/badge/node.js-%3E%3D12.20.0-brightgreen?style=flat\u0026logo=Node.js\n[download node.js]: https://nodejs.org/en/download/\n[esm]: https://img.shields.io/badge/ESM-brightgreen?style=flat\n[prs welcome badge]: https://img.shields.io/badge/PRs-welcome-brightgreen.svg?style=flat\n[create-esm]: https://github.com/iyowei/create-esm\n\n\u003c!-- 更多文档细节，参考 https://github.com/iyowei/readme-templates --\u003e\n\n\u003c!-- ## 性能\n\n```shell\ndijkstra x 1,423,100 ops/sec ±1.41% (91 runs sampled)\n``` --\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fiyowei%2Fdijkstra","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fiyowei%2Fdijkstra","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fiyowei%2Fdijkstra/lists"}