{"_id":"@alexdaiii/mini-nxjs","_rev":"4-cc9d0b850b9304f81d6c7e279758297c","time":{"created":"2023-11-01T15:17:55.190Z","0.1.0":"2023-11-01T14:24:59.157Z","modified":"2023-11-01T15:36:33.810Z","0.1.1":"2023-11-01T15:17:55.613Z","0.1.2":"2023-11-01T15:36:33.627Z"},"name":"@alexdaiii/mini-nxjs","dist-tags":{"latest":"0.1.2"},"versions":{"0.1.1":{"name":"@alexdaiii/mini-nxjs","version":"0.1.1","description":"Class based networks (graph theory) library that mimics some of the basic methods from networkx","main":"dist/index.js","scripts":{"test":"NODE_OPTIONS=--experimental-vm-modules jest --coverage --testPathPattern src","format":"prettier --write ./**/*.{ts,js,json,md}","es-lint":"eslint ./src --ext .ts --ext .js --config ./.eslintrc.cjs --fix-dry-run","ts-lint":"tsc --noEmit","lint":"npm run es-lint && npm run ts-lint","clean":"rm -rf ./build && rm -rf ./coverage && rm -rf ./docs","compile":"tsc --project tsconfig.build.json","docs":"jsdoc -c ./jsdoc.json","build":"npm run format && npm run lint && npm run clean && npm run test && npm run compile && npm run docs","dev_link":"cd dist && npm link && cd .. && npm link @alexdaiii/mini-nxjs"},"repository":{"type":"git","url":"git+https://github.com/alexdaiii/mini-nxjs.git"},"keywords":["graph","graph-theory","network","node","edge","vertex","link"],"author":{"name":"Alex Chang"},"license":"Apache-2.0","bugs":{"url":"https://github.com/alexdaiii/mini-nxjs/issues"},"homepage":"https://github.com/alexdaiii/mini-nxjs#readme","dependencies":{"immutable":"^4.3.4","yocto-queue":"^1.0.0"},"devDependencies":{"@jest/globals":"^29.7.0","@trivago/prettier-plugin-sort-imports":"^4.2.1","@typescript-eslint/eslint-plugin":"^6.9.0","@typescript-eslint/parser":"^6.9.0","eslint":"^8.52.0","eslint-config-google":"^0.14.0","jest":"^29.7.0","jsdoc":"^4.0.2","prettier":"^3.0.3","ts-jest":"^29.1.1","ts-node":"^10.9.1","typescript":"^5.2.2"},"_id":"@alexdaiii/mini-nxjs@0.1.1","gitHead":"de2d9b7200b6c5b7580dcf92dbcdfce2b93825b6","_nodeVersion":"18.18.2","_npmVersion":"9.8.1","dist":{"integrity":"sha512-HthdxUTcCMrlxvJ2tsoVyNBFEjoQ6Gdq7WXXfgXT9SHXBEcTWf6TdGNpIFIkYSUto4M0vjKxPCFHommwPdBAzw==","shasum":"a0c283be0267483165bffce26f5313b11f06a140","tarball":"https://registry.npmjs.org/@alexdaiii/mini-nxjs/-/mini-nxjs-0.1.1.tgz","fileCount":37,"unpackedSize":91163,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHnthMJLhA+SBM5zfye6+X0Bw4yiyNEjXHrBLprxpkmWAiAoy0LI7WHawAkQqXct3MKau1PVgtINSiGvNgcNXgRGLQ=="}]},"_npmUser":{"name":"alexdaiii","email":"npmjs@idlxb.com"},"directories":{},"maintainers":[{"name":"alexdaiii","email":"npmjs@idlxb.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/mini-nxjs_0.1.1_1698851875270_0.28472671942049455"},"_hasShrinkwrap":false},"0.1.2":{"name":"@alexdaiii/mini-nxjs","version":"0.1.2","description":"Class based networks (graph theory) library that mimics some of the basic methods from networkx","main":"build/index.js","types":"build/index.d.ts","scripts":{"test":"NODE_OPTIONS=--experimental-vm-modules jest --coverage --testPathPattern src","format":"prettier --write ./**/*.{ts,js,json,md}","es-lint":"eslint ./src --ext .ts --ext .js --config ./.eslintrc.cjs --fix-dry-run","ts-lint":"tsc --noEmit","lint":"npm run es-lint && npm run ts-lint","clean":"rm -rf ./build && rm -rf ./coverage && rm -rf ./docs","compile":"tsc --project tsconfig.build.json","docs":"jsdoc -c ./jsdoc.json","build":"npm run format && npm run lint && npm run clean && npm run test && npm run compile && npm run docs","dev_link":"cd dist && npm link && cd .. && npm link @alexdaiii/mini-nxjs"},"repository":{"type":"git","url":"git+https://github.com/alexdaiii/mini-nxjs.git"},"keywords":["graph","graph-theory","network","node","edge","vertex","link"],"author":{"name":"Alex Chang"},"license":"Apache-2.0","bugs":{"url":"https://github.com/alexdaiii/mini-nxjs/issues"},"homepage":"https://github.com/alexdaiii/mini-nxjs#readme","dependencies":{"immutable":"^4.3.4","yocto-queue":"^1.0.0"},"devDependencies":{"@jest/globals":"^29.7.0","@trivago/prettier-plugin-sort-imports":"^4.2.1","@typescript-eslint/eslint-plugin":"^6.9.0","@typescript-eslint/parser":"^6.9.0","eslint":"^8.52.0","eslint-config-google":"^0.14.0","jest":"^29.7.0","jsdoc":"^4.0.2","prettier":"^3.0.3","ts-jest":"^29.1.1","ts-node":"^10.9.1","typescript":"^5.2.2"},"_id":"@alexdaiii/mini-nxjs@0.1.2","gitHead":"7284f2f726109ec10510baa3735bd3dd2b71f3ed","_nodeVersion":"18.18.2","_npmVersion":"9.8.1","dist":{"integrity":"sha512-LpozpF62SCJbHchWaArCjFspCJ3CDjjHGcQQcB13Doom1F9vs6/bR/6r5nFix2rtPDeAJzlvC6nxUTK5Wo+xgw==","shasum":"13c78c5fd54b4f07e0a0866b713d7e3be05957ec","tarball":"https://registry.npmjs.org/@alexdaiii/mini-nxjs/-/mini-nxjs-0.1.2.tgz","fileCount":37,"unpackedSize":91195,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCYOe9t0SGsWoxbsynCv1lQG/oWWZh56eOqBaGKGz+WcAIgc1SCIY9u+dYA+3vWHSipZ1FyFWOYXG5W15T4Vt1gcr0="}]},"_npmUser":{"name":"alexdaiii","email":"npmjs@idlxb.com"},"directories":{},"maintainers":[{"name":"alexdaiii","email":"npmjs@idlxb.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/mini-nxjs_0.1.2_1698852993457_0.8484892754288058"},"_hasShrinkwrap":false}},"maintainers":[{"name":"alexdaiii","email":"npmjs@idlxb.com"}],"description":"Class based networks (graph theory) library that mimics some of the basic methods from networkx","homepage":"https://github.com/alexdaiii/mini-nxjs#readme","keywords":["graph","graph-theory","network","node","edge","vertex","link"],"repository":{"type":"git","url":"git+https://github.com/alexdaiii/mini-nxjs.git"},"author":{"name":"Alex Chang"},"bugs":{"url":"https://github.com/alexdaiii/mini-nxjs/issues"},"license":"Apache-2.0","readme":"# @alexdaiii/mini-nxjs\n\n@alexdaiii/mini-nxjs-cls is a simple graph theory library for JavaScript. It implements basic graph theory algorithms\non unweighted graphs. Graph algorithms are implemented in an\n\n## Installation\n\n```bash\nnpm install @alexdaiii/mini-nxjs\n```\n\n## Usage\n\n@alexdaiii/mini-nxjs only implements two types of graphs: `DirectedGraph` and `UndirectedGraph`.\n\nThese graphs are unweighted, do not allow self-loops, and do not allow parallel edges.\n\n### Example\n\n```typescript\nimport {DiGraph, algorithms} from \"@alexdaiii/mini-nxjs\";\n\nconst graph = new DiGraph<number>();\ngraph.addEdge(1, 2);\ngraph.addEdge(2, 3);\n\nconst path = algorithms.shortestPath(graph, 1, 3);\n```\n\n### API Documentation\n\n[Docs](https://mini-nxjs.port5000.com)\n","readmeFilename":"README.md"}