{"_id":"@apexds/graph","name":"@apexds/graph","dist-tags":{"latest":"2.1.1"},"versions":{"2.1.1":{"name":"@apexds/graph","version":"2.1.1","description":"A comprehensive TypeScript library for graph data structures (directed, undirected) and advanced graph algorithms (BFS, DFS, Dijkstra, transpose, etc.).","scripts":{"build:lib":"rimraf ./lib && vite build","build:dts":"dts-bundle-generator -o lib/index.d.ts src/index.ts --no-check --inline-declare-externals --external-inlines @raikuxq/alg-ds","build:full":"yarn build:lib && yarn build:dts"},"author":{"name":"raikuxq","email":"raikuxqt@gmail.com"},"license":"MIT","repository":{"type":"git","url":"git+https://github.com/raikuxq/apexds-graph.git"},"keywords":["graph","graph-data-structure","algorithms","data-structures","typescript","bfs","dfs","dijkstra","undirected-graph","directed-graph","computer-science","graph kit"],"main":"./lib/index.mjs","module":"./lib/index.mjs","types":"./lib/index.d.ts","dependencies":{},"devDependencies":{"@apexds/core":"^4.2.3","@types/jest":"^29.5.12","dts-bundle-generator":"^9.5.1","jest":"^29.7.0","rimraf":"^6.1.2","ts-jest":"^29.1.2","typescript":"^5.4.5","vite":"^5.2.11"},"sideEffects":false,"_id":"@apexds/graph@2.1.1","gitHead":"c4d567c73cb0f615cd86eeb53ef2214998d71e71","bugs":{"url":"https://github.com/raikuxq/apexds-graph/issues"},"homepage":"https://github.com/raikuxq/apexds-graph#readme","_nodeVersion":"22.17.1","_npmVersion":"11.5.2","dist":{"integrity":"sha512-qxmUFpQLQ3SxAmyLaI++7YeBso2QXl3a44DKhDzn2PNxABNzdQW9eHC2/34+UZz7XWkLp9guu5CtCefHRgNqig==","shasum":"32fa77e9a35a977350f0a300681c7a7194bf57c0","tarball":"https://registry.npmjs.org/@apexds/graph/-/graph-2.1.1.tgz","fileCount":5,"unpackedSize":29895,"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEYCIQCIM3pipqxzLU6GeYD3ODW7CHqlbYFahjzy46WxVqNNUgIhAMEHNhmZm96PY2M43MwJhrizY1fYc8c35CKb5mGT4hzY"}]},"_npmUser":{"name":"raikuxq","email":"raikulmao.dev@gmail.com"},"directories":{},"maintainers":[{"name":"raikuxq","email":"raikulmao.dev@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/graph_2.1.1_1771853809616_0.9191513658672537"},"_hasShrinkwrap":false}},"time":{"created":"2026-02-23T13:36:49.522Z","2.1.1":"2026-02-23T13:36:49.773Z","modified":"2026-02-23T13:36:49.984Z"},"maintainers":[{"name":"raikuxq","email":"raikulmao.dev@gmail.com"}],"description":"A comprehensive TypeScript library for graph data structures (directed, undirected) and advanced graph algorithms (BFS, DFS, Dijkstra, transpose, etc.).","homepage":"https://github.com/raikuxq/apexds-graph#readme","keywords":["graph","graph-data-structure","algorithms","data-structures","typescript","bfs","dfs","dijkstra","undirected-graph","directed-graph","computer-science","graph kit"],"repository":{"type":"git","url":"git+https://github.com/raikuxq/apexds-graph.git"},"author":{"name":"raikuxq","email":"raikuxqt@gmail.com"},"bugs":{"url":"https://github.com/raikuxq/apexds-graph/issues"},"license":"MIT","readme":"# @apexds/graph\nA comprehensive TypeScript library for graph data structures (directed, undirected) and advanced graph algorithms (BFS, DFS, Dijkstra, transpose, has path, shortest path.).\n\n[24.54 kB │ gzip: 5.78 kB]\n\n[![npm version](https://img.shields.io/npm/v/@apexds/graph.svg)](https://www.npmjs.com/package/@apexds/graph)\n[![minzip](https://img.shields.io/bundlephobia/minzip/@apexds/graph)](https://bundlephobia.com/package/@apexds/graph)\n[![gzip size](https://img.shields.io/bundlejs/size/gzip/@apexds/graph)](https://bundlejs.com/?q=@apexds/graph)\n\n\n---\n\n## Documentation\n\nDetailed documentation is available at:  \n[https://raikuxq-algorithms.netlify.app/guide/data-structures/graphs](https://raikuxq-algorithms.netlify.app/guide/data-structures/graph.html)\n\n---\n\n# Installing\nInstall by using any of these commands:\n+ `yarn add @apexds/graph`\n+ `npm install @apexds/graph --save`\n\n## Core lib\nCore (implementation, tests, docs): [@raikuxq/lab-ts-algorithms](https://github.com/raikuxq/lab-ts-algorithms/)\n\n# Examples\n\n```ts\nimport { \n  UndirectedGraph,\n  shortestPath,\n  EnumGraphTraversalType\n} from '@apexds/graph';\n\nconst graph = new UndirectedGraph<string>();\n\ngraph\n  .addVertex('London')\n  .addVertex('Paris')\n  .addVertex('Berlin')\n  .addVertex('Tokyo');\n\ngraph\n  .addEdge('London', 'Paris', 100)\n  .addEdge('Paris', 'Berlin', 150)\n  .addEdge('Berlin', 'Tokyo', 800)\n  .addEdge('London', 'Berlin', 400);\n\nconst path = shortestPath({\n  graph,\n  from: 'London',\n  to: 'Tokyo',\n  traversalType: EnumGraphTraversalType.DIJKSTRA\n});\n```","readmeFilename":"README.md","_rev":"1-a80a66441ec2e6b9ccdf0c1be61c7f9f"}