{"_id":"graphology-simple-path","_rev":"4-be03b690880509fe8a0cbb848615db7d","name":"graphology-simple-path","dist-tags":{"latest":"0.2.0"},"versions":{"0.1.0":{"name":"graphology-simple-path","version":"0.1.0","description":"Simple path related functions for graphology.","main":"index.js","types":"./index.d.ts","scripts":{"lint":"eslint '**/*.js'","prepublish":"npm run lint && npm test","test":"mocha test.js"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-simple-path.git"},"keywords":["graph","graphology","simple path"],"contributors":[{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"}],"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-simple-path/issues"},"homepage":"https://github.com/graphology/graphology-simple-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^7.13.0","graphology":"^0.19.2","graphology-generators":"^0.11.0","graphology-types":"0.19.0","mocha":"^8.2.1"},"eslintConfig":{"extends":"@yomguithereal/eslint-config","globals":{"Set":true}},"peerDependencies":{"graphology-types":">=0.19.0"},"dependencies":{"graphology-utils":"^1.8.0","mnemonist":"^0.38.0"},"gitHead":"d93339974600457e45f2b28c56fe5f828f3caa7c","_id":"graphology-simple-path@0.1.0","_nodeVersion":"12.19.0","_npmVersion":"6.14.8","_npmUser":{"name":"yomguithereal","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-bpK41UuSMLWRp4IaI5mH/ZyseLEI+XgogVjOz8lGUo66C3oG/2s/jCZGdymbze4Mwu/T8an6loNEiTIrEH5N1A==","shasum":"e11d06ac6be711604848063eed192c0e3d93f167","tarball":"https://registry.npmjs.org/graphology-simple-path/-/graphology-simple-path-0.1.0.tgz","fileCount":5,"unpackedSize":12906,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfssudCRA9TVsSAnZWagAAPzUP/2lYyR55z++4QjTEB4QZ\n9LSlKeC0v6GxJZ8uYWcjATzQr80S5EEYoXCyIS7NWNdIkz5Xww7Ym+frKPvT\ncm1CnVxFz40/10TcQYyjxbQsx06ixGJmNf8pA41yKwd0TBSe5juo4nDR9ZMk\n8tjPU7ExfUBIPPofVZuOljNXqULDXgXJKKLjmTYJH2bppDZsRfBp109NKgVP\n6F58qCdcBHqgoBARzHE00DfEatpdNS3l9W5bXGUdoBBVTKErCDDAMNPJUqev\nd4ntc567DWepKcHVL9uvhbKMO5688c0ltC6Bof6nT7VrmM5v/8umD/n4pheQ\nb9xDkN0oCgeeHSlgOtBOQQSLkJZjH9/DsxIy1MC5CkmJZ2bSDbH3scp8WRzL\nsoFjIKEBitmc2xuFbOE9gvFqan/+a4YTgiw7Q4YjTC/y7eKtILfqHQVWfmgv\ns27PGs7QNep8yu/jQWdcX+igPAGPyO6z8A6/f46qyPHNU2mlwn2SZrOcbcwV\nUmuG9RCkdxXw7tCLeOFWqo+7oh1ZbOO6BtVA9RXPx3RR0qjCHlnSqoi+dsI8\nWtzahmBBOFD5n4ApkossFUpt5Z222k9stPmbh99wBe8xHP5a0Bhkv+PI9/EY\nzMjfkYRfkzq+zMtpTd3/qvFLMibyN3JNNGD8gHQw7jWHxJqO2CSocFLslR+b\nkzYt\r\n=GylF\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQD5X6XOu5GaM81W33Y/JVQcgfMF7GSeJr1NhSO8YIlZmQIhAMASjHQmmlzaa6I3jN6kH0lgsEuQWtdeLYyV24elMQuT"}]},"directories":{},"maintainers":[{"name":"yomguithereal","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-simple-path_0.1.0_1605553053392_0.48847106123432527"},"_hasShrinkwrap":false},"0.1.1":{"name":"graphology-simple-path","version":"0.1.1","description":"Simple path related functions for graphology.","main":"index.js","types":"./index.d.ts","scripts":{"lint":"eslint '**/*.js'","prepublish":"npm run lint && npm test","test":"mocha test.js"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-simple-path.git"},"keywords":["graph","graphology","simple path"],"contributors":[{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"}],"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-simple-path/issues"},"homepage":"https://github.com/graphology/graphology-simple-path#readme","eslintConfig":{"extends":"@yomguithereal/eslint-config"},"peerDependencies":{"graphology-types":">=0.20.0"},"dependencies":{"graphology-utils":"^1.8.0","mnemonist":"^0.38.0"},"gitHead":"1dd9ceea00ff096c76b96d64d5b669144ed14f98","_id":"graphology-simple-path@0.1.1","_nodeVersion":"12.22.6","_npmVersion":"7.24.2","dist":{"integrity":"sha512-hjub7HM193APeydOsKuUTtw64AZ+l5V+3KXqq8KPXpoZKr69ZKAuuLE6qY+eizhaSS/YRfYjl/OOyHbkW1VOeQ==","shasum":"a61679281b482bc677cf8130323b40f47824b45d","tarball":"https://registry.npmjs.org/graphology-simple-path/-/graphology-simple-path-0.1.1.tgz","fileCount":5,"unpackedSize":12622,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIAqas2O5sQoCqwQKqsGR83FtBlDD0EERuBGxwz5m5rRWAiAV1XrJNL8pxYu67hJzIgKe0jxwWoOxd5icjz0TqKcpYg=="}]},"_npmUser":{"name":"yomguithereal","email":"kropotkinepiotr@gmail.com"},"directories":{},"maintainers":[{"name":"yomguithereal","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-simple-path_0.1.1_1634310270107_0.03639175905462211"},"_hasShrinkwrap":false},"0.1.2":{"name":"graphology-simple-path","version":"0.1.2","description":"Simple path related functions for graphology.","main":"index.js","types":"./index.d.ts","scripts":{"prepublishOnly":"npm test","test":"mocha test.js"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology.git"},"keywords":["graph","graphology","simple path"],"contributors":[{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"}],"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology/issues"},"homepage":"https://github.com/graphology/graphology#readme","peerDependencies":{"graphology-types":">=0.20.0"},"dependencies":{"graphology-utils":"^1.8.0","mnemonist":"^0.39.0"},"gitHead":"923b5348eb68f0b69d8a34be5672334b8630a198","_id":"graphology-simple-path@0.1.2","_nodeVersion":"12.22.7","_npmVersion":"8.1.0","dist":{"integrity":"sha512-jOut2ihx5XMN97eUtmy4ZMp22btx3oa8GnvzQXHiBZOMyaC/gCpupnKVh0IvtzKd0RmmC5lT0zPBAqvU2O7Ejg==","shasum":"b8d84852c94a069a8e906faa5274d33df0a53419","tarball":"https://registry.npmjs.org/graphology-simple-path/-/graphology-simple-path-0.1.2.tgz","fileCount":5,"unpackedSize":12495,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhtJo7CRA9TVsSAnZWagAA1OwP/07Bq6WMlZBONmkP64M4\nQVDNdy4OUTQxHtq7hVWyeWlmHBqb+Zs+rhRA1OvUNkVU/xv9siAFDqlAuOMr\nV0VDAIA3lNAvUtOeIsbRAGId8sCOG3lkkyDZhsamz9HnH43ecO41X9FuF33N\netw0tohP8uMfpACEB7gYjb1PXDn0TiY6jJvxx2ZnXBcRriCNDTVxeWsq8x7g\nMegbCLQHceHeXqj8bXPLT9sc4vpADqh4RmXFgtY1vSzE67ccoIMCXhstV/MQ\niQZ27A9+wWcWaCyK5IdqURWNAZ3VHQFBBlKWRdQHXozivAJtHiZM5kn8oREg\nRVGRsAqQ0qqhWJh1WyomdoaQcvoKeEc6gfN/AFeQsN9nr1KErG/luthL/JM2\ntpenO9KZu/99HXj4vlOMYL2D7hmIwskECBc761VPuSwe5bf2pg3TJsIhyPXU\n5MSDtr9tMIiz/QbcR/FvpVCBQ6cK/uHp8+HE/95X+e8jx7gJDKnVj9OnlzQs\n7/Fr0IKMzO9W6L3AFeH4Lxoxziz0d8oXrRZ5CotOSyiK04H0kQ7yI38ASqwV\nbfigCs3Rxuf2QbfYr33h3RzXA37Da97CiOOAfdeSBC+N2nRDlyjIfbx8iEtK\nsk22VIlEUrVBVNKujZIG1JidCJ4/T5n6/2C4xBqXgV/83LXfEPEJWfT0soio\nVHjD\r\n=fGa9\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCamBPvjkpX5iDjfY4pYZ6eQix7zpcBqPMWNMH+c8MN4QIhAJomkAqYTOr67LXQX6Y0rMOZXD7WzwMlpFd4TLGcLRuc"}]},"_npmUser":{"name":"yomguithereal","email":"kropotkinepiotr@gmail.com"},"directories":{},"maintainers":[{"name":"yomguithereal","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-simple-path_0.1.2_1639225915387_0.9167879398772731"},"_hasShrinkwrap":false},"0.2.0":{"name":"graphology-simple-path","version":"0.2.0","description":"Simple path related functions for graphology.","main":"index.js","types":"./index.d.ts","scripts":{"prepublishOnly":"npm test","test":"mocha test.js"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology.git"},"keywords":["graph","graphology","simple path"],"contributors":[{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"}],"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology/issues"},"homepage":"https://github.com/graphology/graphology#readme","peerDependencies":{"graphology-types":">=0.20.0"},"dependencies":{"graphology-utils":"^1.8.0","mnemonist":"^0.39.0"},"gitHead":"ff06815c9252551286b638eb1e7502dc7845e1fb","_id":"graphology-simple-path@0.2.0","_nodeVersion":"14.19.0","_npmVersion":"8.5.2","dist":{"integrity":"sha512-4cGMWbVuJM0zlKDUx6dS6JGGLddizDPe8PsTokXVz2eTeHYg07qa5TgwIco15ta2RMM05+xy8N1mFnpS85y0kw==","shasum":"f98070e3204ab33ac28a2a8263adb357c0406a04","tarball":"https://registry.npmjs.org/graphology-simple-path/-/graphology-simple-path-0.2.0.tgz","fileCount":5,"unpackedSize":14566,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDzYItoIDY2VGN3qUdaIe2VQ5lv9/PKCV71gaBaybPEZgIgBg0zwtEr7pAhxRGAuzhNVyqYR2j7IPqdh4lUr7HVrBE="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiZ6UnACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmqNSQ/+NJixY9nKHk75CmHUS/e6ygxNyTJ4R5UpzQzoD2TOFrJdQd6E\r\n7hUpW6L4vWSFsQ8wVPXyFvBEmjd93oWT4FWRZy/1aPxh2kdZqOKnZOUu4Qgd\r\nlXfHiD4x69npBduG22WHQ4Nbv/SC+Emrv02TztwFQdVAQsXlM2MzQawKYEEi\r\nWEto/MO0UjeTrPGzI6FNy6k99UCsUWZpGk3F2hVbW9xJrtAej7Is9MdKqlnt\r\n88YdkL8f/5eZZTP5weDmINwlTJAAzpHw1fpz8B+MbqsQ9u7vqdAL9U7PLEK5\r\nNbdXHL91zTyIIt1nnKMUjLhq7GIZ0sAG8oGvsBzkqpMiy6n/EwxGwU7mWuvF\r\nKeZHJN25JeSIOd5Rl3PP5GYvzOsb2i257/Q0fuW1AA/I4uYWVly9WvRPhYAD\r\ndFcFYDgXXT2RcW6+R8k0cxLIUR4GCJ8DEKVCkgwMJspQDY+LhUWLdEUDtsk8\r\nBzJf5xf7dAgo2ZLRiB0BJx2v6FKy3ZwWvco+FZBHR8OLnFzALRZg93VyKEI+\r\nOevHh0jawij1M12ytRzXgKs0KR1TcPcSlnUlCWSOsdBTj/VKF+4luJGhbyp4\r\nIpbEwJMLx7GBByfgazAvuc7LbuCefnJI911CmjGtEwJFWLtjvPYT8x0eaV8C\r\nbaJRAVP3JNa0KWWCpq+JeyYvTpB6Hg5t4/A=\r\n=Dkx2\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"yomguithereal","email":"kropotkinepiotr@gmail.com"},"directories":{},"maintainers":[{"name":"yomguithereal","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-simple-path_0.2.0_1650959654733_0.34569436062147973"},"_hasShrinkwrap":false}},"time":{"created":"2020-11-16T18:57:33.392Z","0.1.0":"2020-11-16T18:57:33.513Z","modified":"2022-05-04T02:39:19.261Z","0.1.1":"2021-10-15T15:04:30.265Z","0.1.2":"2021-12-11T12:31:55.522Z","0.2.0":"2022-04-26T07:54:14.895Z"},"maintainers":[{"name":"yomguithereal","email":"kropotkinepiotr@gmail.com"}],"description":"Simple path related functions for graphology.","homepage":"https://github.com/graphology/graphology#readme","keywords":["graph","graphology","simple path"],"repository":{"type":"git","url":"git+https://github.com/graphology/graphology.git"},"contributors":[{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"}],"bugs":{"url":"https://github.com/graphology/graphology/issues"},"license":"MIT","readme":"# Graphology Simple Path\n\nSimple path related functions to be used with [`graphology`](https://graphology.github.io). A \"simple path\" is a path where a node is not repeated.\n\n## Installation\n\n```\nnpm install graphology-simple-path\n```\n\n## Usage\n\n- [allSimplePaths](#allsimplepaths)\n- [allSimpleEdgePaths](#allsimpleedgepaths)\n- [allSimpleEdgeGroupPaths](#allsimpleedgegrouppaths)\n\n### allSimplePaths\n\nCollects every simple path between a source and a target node in the given graph.\n\nNote that this function also works with cycles.\n\n```js\nimport {allSimplePaths} from 'graphology-simple-path';\n\nconst graph = new Graph();\ngraph.mergeEdge('1', '2');\ngraph.mergeEdge('1', '3');\ngraph.mergeEdge('2', '3');\n\nconst paths = allSimplePaths(graph, '1', '3');\n>>> [\n  ['1', '3'],\n  ['1', '2', '3']\n]\n\n// To get cycles, just pass same source & target\nconst cycles = allSimplePaths(graph, '1', '1');\n\n// To limit traversal to a certain depth\nconst limitedPaths = allSimplePaths(graph, '1', '3', {maxDepth: 2});\n```\n\n_Arguments_\n\n- **graph** _Graph_: target graph.\n- **source** _string_: source node.\n- **target** _string_: target node.\n- **options** _?object_: options:\n  - **maxDepth** _?number_: max traversal depth (default - no limit).\n\n### allSimpleEdgePaths\n\nCollects every simple path, represented by the followed edges, between a source and a target node in the given graph.\n\nNote that this function also works with cycles but does not work with multi graphs yet.\n\n```js\nimport {allSimpleEdgePaths} from 'graphology-simple-path';\n\nconst graph = new Graph();\ngraph.mergeEdgeWithKey('1->2', '1', '2');\ngraph.mergeEdgeWithKey('1->3', '1', '3');\ngraph.mergeEdgeWithKey('2->3', '2', '3');\n\nconst paths = allSimpleEdgePaths(graph, '1', '3');\n>>> [\n  ['1->3'],\n  ['1->2', '2->3']\n]\n\n// To get cycles, just pass same source & target\nconst cycles = allSimpleEdgePaths(graph, '1', '1');\n\n// To limit traversal to a certain depth\nconst limitedPaths = allSimpleEdgePaths(graph, '1', '3', {maxDepth: 2});\n```\n\n_Arguments_\n\n- **graph** _Graph_: target graph.\n- **source** _string_: source node.\n- **target** _string_: target node.\n- **options** _?object_: options:\n  - **maxDepth** _?number_: max traversal depth (default - no limit).\n\n### allSimpleEdgeGroupPaths\n\nCollects every simple path, represented by groups of equivalent followed edges, between a source and a target node in the given multi graph.\n\nNote that this function also works with cycles and that, even if it can work with a simple graph, it has not be designed to be useful in this case.\n\n```js\nimport {allSimpleEdgeGroupPaths} from 'graphology-simple-path';\n\nconst graph = new Graph();\ngraph.mergeEdgeWithKey('1->2a', '1', '2');\ngraph.mergeEdgeWithKey('1->2b', '1', '2');\ngraph.mergeEdgeWithKey('1->3a', '1', '3');\ngraph.mergeEdgeWithKey('2->3a', '2', '3');\n\nconst paths = allSimpleEdgeGroupPaths(graph, '1', '3');\n>>> [\n  [['1->3a']],\n  [['1->2a', '1->2b'], ['2->3a']]\n]\n\n// To get cycles, just pass same source & target\nconst cycles = allSimpleEdgeGroupPaths(graph, '1', '1');\n\n// To limit traversal to a certain depth\nconst limitedPaths = allSimpleEdgeGroupPaths(graph, '1', '3', {maxDepth: 2});\n```\n\n_Arguments_\n\n- **graph** _Graph_: target graph.\n- **source** _string_: source node.\n- **target** _string_: target node.\n- **options** _?object_: options:\n  - **maxDepth** _?number_: max traversal depth (default - no limit).\n","readmeFilename":"README.md"}