{"_id":"wgraphbasic","_rev":"251-60c906300ce944ba812dc11542de865f","name":"wgraphbasic","dist-tags":{"latest":"0.3.287","beta":"0.3.124","alpha":"0.3.278","gamma":"0.3.265","delta":"0.3.271","stable":"0.3.248"},"versions":{"0.3.34":{"name":"wgraphbasic","version":"0.3.34","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":""},"devDependencies":{"wTesting":""},"keywords":["wTools"],"gitHead":"a1596d5659833938d59ac2130d5eb66896ecb122","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.34","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-tmtS1F1Z89v4SkY75c7SsmBVqRiHK46r1io6fbfZzV41wJBuk/t20g8ltMmN9nJmMXSclIr6thMlnB2V//9LMg==","shasum":"c255b7cef2de778dbca36adf49c9ae737c5d87b9","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.34.tgz","fileCount":6,"unpackedSize":46994,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJdli00CRA9TVsSAnZWagAAgC0P/jNNclrzC4HBJSfQnAvw\nTxj+Gi58+Obye4zp+fud/btgdHB/mnbA1qvMs+PbRELxEG7VB3VooFtKWWdH\no6wRMQcQHlM6cxCsinswcaNvsWwVH2+1yO1OBGtGvxHLG7doXKIi0IM/XE74\nyKUvOwlRuvAn82PEYERLekNeJzU3vTQ1KB4XX7UxpVSthET60keqCT3/OLsk\ng4mn7PoV0xtkiiAiw/jcWMK9DeALwZMpw+rPInjtxT1FUtnLLf3ChbiIejwc\nkyllRQVWkLzug4poh5F3AnEswefo6NB4e8OeoW8yY8m1mhowMeoJjemoypIS\nMqn8pZV68Bv1//RjzvaycNbp3l0xrnYUbNOOgjQzbMbCoY+7vpNGeuD7tWls\n3vZOd0N7SdSQx3CZnWmha0xOVINJicXhWb0MR5PL4J8e1YBOCg9FjLPOUjY0\nwyKh9DCpGthNH1VHsLOUnNMo+YFYHh5GIehr1fKBu735hz/9Oq6s7gIm0L1s\nMIiueFe05k2DFMpk01r4g79Onr+8DQGoVdxhY8LjO2xbhO7q7AwKCxP9c6tj\n5v9VF++FPw6x6VbGte+5dvbvskbEhnkO4FYB9lf6IFxXpqY5VuLavKOXCq7x\nooUG7+7JgrLsRh+oMHeBkKGyBMver7AEZ7RhS1np/aR6SoXlXPafKCY5oo9e\nrbHl\r\n=JqFb\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEV/KM7Twz2Abelenm6nHPzj7KnZ0vrzrbuSJZeWqINxAiBx8/u3EFw/1i2pje682v+0IOcr1LSJtobzHUjn+lG/3Q=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.34_1570123059254_0.09042876339749184"},"_hasShrinkwrap":false},"0.3.35":{"name":"wgraphbasic","version":"0.3.35","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic) [![Build Status](https://ci.appveyor.com/api/projects/status/github/Wandalen/wabstractgraph)](https://ci.appveyor.com/project/Wandalen/wabstractgraph)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n## Concepts\n\n**Graph** :: set of nodes and set of edges or arcs connecting some or all nodes. </br>\n**Incident edges** :: of the node, are edges connected to the node. </br>\n**Connected nodes** :: nodes are connected if them have edge connecting both of them. </br>\n**Reachable node** :: node v is reachable from u if there is a path from v to u. </br>\n**DFS** :: depth-first search. </br>\n**BFS** :: breadth-first search. </br>\n**DAG** :: directed acycled graph. </br>\n**SCC** :: Strongly connected components. </br>\n**Node degree** :: total number of incoming and outgoint edges of the node. </br>\n**Indegree** :: of the node is number of incoming edges. </br>\n**Outdegree** :: of the node is number of outgoing edges. </br>\n**Sink node** :: node with zero outdegree. </br>\n**Source node** :: node with zero indegree. </br>\n**Universal node** :: node connected to all nodes of the graph. </br>\n**Terminal node** :: **pendant node** :: **leaf node** :: node with degree of one. </br>\n**Neighborhood** :: is an enduced subgraph of the graph, formed by all nodes adjacent to v. </br>\n**Neigbour nodes** :: nodes which are connected to the node. </br>\n**Low-link value** of a node :: smallest node id reachable from the node. </br>\n**Topological ordering** :: linear ordered DAG. </br>\n**Topological sort** :: algorithm of linear ordering of DAG. </br>\n**Distance between nodes** :: minimal number of edges to get from one given node to another given node. </br>\n**Distance layers** :: array of arrays of nodes. First layer has origin or zero-distance set of nodes. Second layer has nodes on distance one from origin. And os on. </br>\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n\n","readmeFilename":"README.md","gitHead":"715a2642e7bce3039d8afe04a6fccde4ca8e2f7e","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.35","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-MJtkSkoLhU0V2xXpeKX2g+GNCFyjfK0ubBQM7qDwMG/1p8A2lo/HtlRla8j1MUahY1eAeALf8f0h0XgnRBOvrw==","shasum":"9f25b461e16d6f75c94e1535d2b1089e4522dc96","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.35.tgz","fileCount":5,"unpackedSize":6553,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJdrYP8CRA9TVsSAnZWagAAwGYP/1hoFq2PY6puTYQh8Vgf\ny/7aA5qe3sjxztLQ1WWet46B4SRr4kyk7WV3Q4dzlqUmd/DoJf8Glyj3EA0X\nWI0WrCFXwWTW3sUN32TjtEmewurUI7PqKRng31jrjmjMIYsObTmmIiC0w6ab\n4GjIAgUSFYoq3O8vbTOYitRWpJZaVhos7+GVKp5GibEdGI6TZwUVX4HzvapS\nrDtyQE+6UzowWYl6Yfkxn3nF9Ofxsu/OSLVBv61GzGS/yRtQUo2MC1Peou74\nLDao2LIjw0dDy1lq8Mf/7XQPM6YKxcUJWfOacXp5w4sLy1qMVYKNjva/u/yc\njw55/rPVBcHTx14QcUn/PU4hkdSHMnEu3zmAcYsWAA3pCUrK0Pc3L5VGWMEO\nw4rLWWr9CCsol4PDlXA/FaP2zBtemVFl017QIVadJkUt2IXtdxn6t8ThBBPy\ndj/hnYTOgaB4LWT5C0azAVzwgnsB/mg0GN71+h2S0XleA5Lmgr1rYwgvb3BM\nELhDg6aHSrl1us3IbdTMgrOF8WE7aZj4uopCxyPUiO4gRBGXx4B44HYpE69Z\nQ87uwW1DujUqB0tHLfLn/DLRaaILUGpXyvEO959Fm6lUpMhmrTe3B1R9ZwHA\nYpyLTifIphT2we/BQeBwONYg06c7XYMNam3pBAJdT3ucr6qMGuKcmy8nq4PJ\ncAH+\r\n=9Ypg\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCa5UiuExlw0P8ulZsCPiKZHjycs43JLd16A45lgiYY2AIgNmuheA2tJwUaqAL4sSWWldiwmZ19bGqKgof9HF8zbw4="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.35_1571652603438_0.3779785695974187"},"_hasShrinkwrap":false},"0.3.36":{"name":"wgraphbasic","version":"0.3.36","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic) [![Build Status](https://ci.appveyor.com/api/projects/status/github/Wandalen/wabstractgraph)](https://ci.appveyor.com/project/Wandalen/wabstractgraph)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n## Concepts\n\n**Graph** :: set of nodes and set of edges or arcs connecting some or all nodes. </br>\n**Incident edges** :: of the node, are edges connected to the node. </br>\n**Connected nodes** :: nodes are connected if them have edge connecting both of them. </br>\n**Reachable node** :: node v is reachable from u if there is a path from v to u. </br>\n**DFS** :: depth-first search. </br>\n**BFS** :: breadth-first search. </br>\n**DAG** :: directed acycled graph. </br>\n**SCC** :: Strongly connected components. </br>\n**Node degree** :: total number of incoming and outgoint edges of the node. </br>\n**Indegree** :: of the node is number of incoming edges. </br>\n**Outdegree** :: of the node is number of outgoing edges. </br>\n**Sink node** :: node with zero outdegree. </br>\n**Source node** :: node with zero indegree. </br>\n**Universal node** :: node connected to all nodes of the graph. </br>\n**Terminal node** :: **pendant node** :: **leaf node** :: node with degree of one. </br>\n**Neighborhood** :: is an enduced subgraph of the graph, formed by all nodes adjacent to v. </br>\n**Neigbour nodes** :: nodes which are connected to the node. </br>\n**Low-link value** of a node :: smallest node id reachable from the node. </br>\n**Topological ordering** :: linear ordered DAG. </br>\n**Topological sort** :: algorithm of linear ordering of DAG. </br>\n**Distance between nodes** :: minimal number of edges to get from one given node to another given node. </br>\n**Distance layers** :: array of arrays of nodes. First layer has origin or zero-distance set of nodes. Second layer has nodes on distance one from origin. And os on. </br>\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n\n","readmeFilename":"README.md","gitHead":"95d6fb20c7610df20a47f24811f2d984ee59ffd7","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.36","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-EoIv2XTWkZ402Tmc9TISZ/9v9OSR8mCopftVg6iCh7zVIESK0zoBRf1DcaXCnYQ6C0E+Y1pWIhCIGSePuEltqg==","shasum":"d2b791f9de8a40fc485e3b27370dcb3e97c7e3d8","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.36.tgz","fileCount":6,"unpackedSize":46398,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJdsyqRCRA9TVsSAnZWagAAEsQP/jokBDGyKmyeDYofVXUf\nhHHwrWBWQo41ZaxjLD+BougaKt02b4+KFuTjq2FFHu4Ro+UTgpNFGezE7W3Y\nP/8Cr/A0JrLdL0alkkzPlXzgEE6XXNBl1eKLO0jLUFOlbsULp93SLn/YJUR5\ndGLSeXGEvhMEF5VppKokCwI+a8QnAKfrht/kDpSHbvx5piKv8VGW+ZhdFJE+\nSTTrTj05ogwwBlF9khXJkY3xNC4FunFUSAp9q8FT+JtPdPOmEs5AA1loUYQD\nKiYJeJm4xK3ewQTc3o9ozHGl4B0ecmHTRf3LWI9rPrQecylz645KWCPYyGnS\nPiNG84chLqiiWaW00tkAbG6ej8gpqwVHgoNnW95HkWDAM6ixKTyZ2eSW9bhX\nFKFiMxr6ODYUZTKTQmOVhVYqrdLAFHBN9MiIZFL0U8w95TaqBDWLUURgruvH\nX71Ko2y6FNkdC5IZHu7OdQVXT+ANNSKTBw3/CldXdt6pA4I5yu4A5XGYNBJy\n8T27MbCUZWckJPzTobwVAfRJuFC8Uz4J84z1Bt/gIM2tmToPNC1cf4sQTgNp\nCLa2303NNwsAP2i+/fRLGWB7HXXIBr3SApXcUrMwVSx7Kv4L7uysyLO3VAt/\nZB7JN8TJ3zB7IFQQ+gxOXaWIeHYNUdl9Pa0hpCtsP++EL62UQanmbkjuYyJz\nEJtm\r\n=LGK/\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIF5Y/LPncT5vnFtfviJ0gvCJQbFmMZsexwCTTUeADpXxAiEAm1k377U6OXSc50L+555yRQHOld3Xc6RnWREaleYhLNU="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.36_1572022929084_0.6665763578927104"},"_hasShrinkwrap":false},"0.3.37":{"name":"wgraphbasic","version":"0.3.37","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic) [![Build Status](https://ci.appveyor.com/api/projects/status/github/Wandalen/wabstractgraph)](https://ci.appveyor.com/project/Wandalen/wabstractgraph)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n## Concepts\n\n**Graph** :: set of nodes and set of edges or arcs connecting some or all nodes. </br>\n**Incident edges** :: of the node, are edges connected to the node. </br>\n**Connected nodes** :: nodes are connected if them have edge connecting both of them. </br>\n**Reachable node** :: node v is reachable from u if there is a path from v to u. </br>\n**DFS** :: depth-first search. </br>\n**BFS** :: breadth-first search. </br>\n**DAG** :: directed acycled graph. </br>\n**SCC** :: Strongly connected components. </br>\n**Node degree** :: total number of incoming and outgoint edges of the node. </br>\n**Indegree** :: of the node is number of incoming edges. </br>\n**Outdegree** :: of the node is number of outgoing edges. </br>\n**Sink node** :: node with zero outdegree. </br>\n**Source node** :: node with zero indegree. </br>\n**Universal node** :: node connected to all nodes of the graph. </br>\n**Terminal node** :: **pendant node** :: **leaf node** :: node with degree of one. </br>\n**Neighborhood** :: is an enduced subgraph of the graph, formed by all nodes adjacent to v. </br>\n**Neigbour nodes** :: nodes which are connected to the node. </br>\n**Low-link value** of a node :: smallest node id reachable from the node. </br>\n**Topological ordering** :: linear ordered DAG. </br>\n**Topological sort** :: algorithm of linear ordering of DAG. </br>\n**Distance between nodes** :: minimal number of edges to get from one given node to another given node. </br>\n**Distance layers** :: array of arrays of nodes. First layer has origin or zero-distance set of nodes. Second layer has nodes on distance one from origin. And os on. </br>\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n\n","readmeFilename":"README.md","gitHead":"a0f162a40c3d85bbc48a438a623cae9ec8c08623","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.37","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-cfw4YM3J2mPooG46zkXqe6b5a9WcrsEwcaAqp7js4PvOIrHRSBgCj0MfTz2kyJE+9Xu7K9120DpU5Jh4sXptQw==","shasum":"2faa115c605df646d3e7f5069158c9f8c11c19d2","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.37.tgz","fileCount":9,"unpackedSize":103257,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJds0OiCRA9TVsSAnZWagAAN1MP/i+Q1TlAZ5REdsbyMw2D\nRdhGksgh5P6oj5TJVPZiB2PHMwOGnfprZCjzeRgOHcQJI5MSe/pzsgP7qVYJ\nuZSCLNnJvv0IHQT9eDpBvfBAP65lv8UMFZVPa7GYJxM76pNXHwvLD+BNpQI1\nknXYfKEliUV33dNKnt1gcVRTuoIiUzmbcP23MBBZOAYU5mbxwVKd7cQPYKc5\nT+ZYqde0OGthmsxaOKKppyz3cErwjoY1oq/ECWoVXbjA0agFhwJP+3dh8O3j\nos5M4w+9v2kUvcf8UA/KX/odAnE6jxtIE5UBSb/00JkB3v9f6xYLE789WPWG\nT0nEc0EkWU8RZmwlxraebJybcsySYPxu9OioQI9WEqhCzYv/dBLFvzn/f+P5\nnjlyXiQH/4W1sJOgDKew8uvGMem51QIjs5G+8xp15m+ki3PBvdF51eZwgWKa\n6p5qcO+pKx4BjwQYMlzWt3c8Hzc6gTc8QQIfXMElvUxa+9V0kRlVOyiczUR9\nkfdxT4A9v3sBmYRPx/oTEL+tXfzalLPQt6npMuHkn6H0PRKGmTK4OMKI+I5V\nDkD35WbsGLQw8vqqY28M6F/PIXUf1YlNUK1eG1V1K7u3IUInt8xLSWRpEN+2\ndoCV3isG068/UwQ4o+srQW/fC06qrH9xUV/zNrQVa8cPFL7Mqs+L0tpxNEzY\nF/PO\r\n=WEqF\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCPxJsb0hRQ08wBESv8A5DXgbHFa/n5g8+/mip8E74w3gIgf0mB4iTwP748DzJwBkPbmQa4+1/yawB8AHBBTYakEhw="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.37_1572029346173_0.21884379226103667"},"_hasShrinkwrap":false},"0.3.38":{"name":"wgraphbasic","version":"0.3.38","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic) [![Build Status](https://ci.appveyor.com/api/projects/status/github/Wandalen/wabstractgraph)](https://ci.appveyor.com/project/Wandalen/wabstractgraph)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n## Concepts\n\n**Graph** :: set of nodes and set of edges or arcs connecting some or all nodes. </br>\n**Incident edges** :: of the node, are edges connected to the node. </br>\n**Connected nodes** :: nodes are connected if them have edge connecting both of them. </br>\n**Reachable node** :: node v is reachable from u if there is a path from v to u. </br>\n**DFS** :: depth-first search. </br>\n**BFS** :: breadth-first search. </br>\n**DAG** :: directed acycled graph. </br>\n**SCC** :: Strongly connected components. </br>\n**Node degree** :: total number of incoming and outgoint edges of the node. </br>\n**Indegree** :: of the node is number of incoming edges. </br>\n**Outdegree** :: of the node is number of outgoing edges. </br>\n**Sink node** :: node with zero outdegree. </br>\n**Source node** :: node with zero indegree. </br>\n**Universal node** :: node connected to all nodes of the graph. </br>\n**Terminal node** :: **pendant node** :: **leaf node** :: node with degree of one. </br>\n**Neighborhood** :: is an enduced subgraph of the graph, formed by all nodes adjacent to v. </br>\n**Neigbour nodes** :: nodes which are connected to the node. </br>\n**Low-link value** of a node :: smallest node id reachable from the node. </br>\n**Topological ordering** :: linear ordered DAG. </br>\n**Topological sort** :: algorithm of linear ordering of DAG. </br>\n**Distance between nodes** :: minimal number of edges to get from one given node to another given node. </br>\n**Distance layers** :: array of arrays of nodes. First layer has origin or zero-distance set of nodes. Second layer has nodes on distance one from origin. And os on. </br>\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n\n","readmeFilename":"README.md","gitHead":"ec5b9864d9d9452d7197b11c51f66a69a7817ef0","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.38","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-+C8Cn38sXux1JzNjOcx+SpqfSwL+HpmYjdm14USPsSKnqFAt8NNXVLo8U/A1SuPpTAJ/HJz3vA+yf/cwiHa9Qg==","shasum":"0d2047f6f30cf4f602c5841d181581ca60987a02","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.38.tgz","fileCount":9,"unpackedSize":107590,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJdxW1iCRA9TVsSAnZWagAA4iYP+wTEHtI34y5CciqhNF5k\nmaK1Ss0eXnOLF8/a0jIJartavBjPaA6+jgmIfmQVpf+dkU+K+x8wUPmUW6ED\nNFn73OWLhM+Sbh0xsiWr9LFaZuR/UuINXSXiIda6blAAg3WEVzKKW1Ohpn9O\nITewu4G2S+aR/zpuY44kXkFTzjJSm8HM1g1F8/jx7boAWfLR/CgyqYEWpHJ7\nzASNoC89pNdLrK/KMQdNMQx6148tQDVS/n6+6hFKcni8TRc7Px1eyDawYH93\neQKgZA8uKgEtIhzp9LdojPLrpFgr9LMoSJJTMFQVEcdwrK01jHPjIVi7f4TQ\nswkE2uc8T4D1zURgX4VKON2MIhPNcCHJhD5neu6slJ/UzyhSBKZ84XpRbQX+\nlojYXxfQjh+UC9BG1PlQ8hWAcLFsO8mOrP99Wv9dYRvs83uqj1HejbyS6jz4\nw60F6e9zO25RIdtuKJKYp+C4Si2EKc2WXmPMW/b9VCKckuVdIqUtWC2AMfq/\n1psig6Y1Z0J0gbQO+g6ZTkn/qj8nQ/RjnvhjJ5TKOpU8OuQCup7pNfi8oquK\nrQQby5bzzGxNSlkxzgcwWBK40CJ35LXt8ryibWPkYirB6Kdtp9I3urKlidLg\n9lnPWvrZW0ZLpDobRkSFryu5dky3UYZd2D9UpGlmWmEQRqJEXc446pkUwZl5\nmMxa\r\n=VpFr\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFhajBHYjxT2f150FzyiFYMmB+MpwQLafDEk3nGbfUq3AiAaZWKYZMY8sE1LbqU4ZbNLWFjI6xZ2ala+Ojkc50ooSg=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.38_1573219682064_0.9005370607410825"},"_hasShrinkwrap":false},"0.3.39":{"name":"wgraphbasic","version":"0.3.39","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic) [![Build Status](https://ci.appveyor.com/api/projects/status/github/Wandalen/wabstractgraph)](https://ci.appveyor.com/project/Wandalen/wabstractgraph)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n## Concepts\n\n**Graph** :: set of nodes and set of edges or arcs connecting some or all nodes. </br>\n**Incident edges** :: of the node, are edges connected to the node. </br>\n**Connected nodes** :: nodes are connected if them have edge connecting both of them. </br>\n**Reachable node** :: node v is reachable from u if there is a path from v to u. </br>\n**DFS** :: depth-first search. </br>\n**BFS** :: breadth-first search. </br>\n**DAG** :: directed acycled graph. </br>\n**SCC** :: Strongly connected components. </br>\n**Node degree** :: total number of incoming and outgoint edges of the node. </br>\n**Indegree** :: of the node is number of incoming edges. </br>\n**Outdegree** :: of the node is number of outgoing edges. </br>\n**Sink node** :: node with zero outdegree. </br>\n**Source node** :: node with zero indegree. </br>\n**Universal node** :: node connected to all nodes of the graph. </br>\n**Terminal node** :: **pendant node** :: **leaf node** :: node with degree of one. </br>\n**Neighborhood** :: is an enduced subgraph of the graph, formed by all nodes adjacent to v. </br>\n**Neigbour nodes** :: nodes which are connected to the node. </br>\n**Low-link value** of a node :: smallest node id reachable from the node. </br>\n**Topological ordering** :: linear ordered DAG. </br>\n**Topological sort** :: algorithm of linear ordering of DAG. </br>\n**Distance between nodes** :: minimal number of edges to get from one given node to another given node. </br>\n**Distance layers** :: array of arrays of nodes. First layer has origin or zero-distance set of nodes. Second layer has nodes on distance one from origin. And os on. </br>\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n\n","readmeFilename":"README.md","gitHead":"14ae0b7590adf4aa1dcba530294fba91a28b1b24","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.39","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-pRj6H3YEQdSZ7SKx4nM6gUt1hlIqfSc/ZiZy64MvWIIRhUOhGKf0PEgXw0cQeuDiClrDZaaXT6NiCN3mpUQrEw==","shasum":"12b9a3d4c8c0cbc8350bd1411a4ac0f8a467b529","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.39.tgz","fileCount":10,"unpackedSize":139661,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJdzdC0CRA9TVsSAnZWagAAPOAP/2l5SbBa4PWvXankqdcp\n0x6VqBGy5uzCZbeK5T16XwJdwlTRlH9byrIfcXpJJDmqpp7pGTWFFYvqkQG1\nq5qv4Dnu0AvddFCt/x8gij0sFL/96cBlRNTooYPXomahrkXrxSbG9n4cZ0J+\nohusk3jK0jmjmO5Y7yJs/Fk2KIldLZNGZjVi0mCi729GbrSgnrdrEnW9dfnQ\nW2RlTLJUCEtOdZuSutzC8i8/KUpP0hZmeKxWbwpMsyKbjRj3xEe7iNvUrWbL\nUJsASMBEmkr8vhnegbXNnSiri5jh4palV4cYWcZ/VismyTgY+bJ1WHCk04PN\nGbaCSVrzTAIYFZZrbhZ3tPVhme+LSUDCYjpPT4nx8cC+ram3VsLcdKQQZCqy\naj66MeecYtW7B/J1FTM9iDb/3vcsyiuorIzPacSRfKmKTCjIO2+/5MmEtIN6\niIxlBv02cay1eY1NpaK6XGeEYeBkreZ6bpauCfIFiTectzuxvgarCtXLn6FI\nniIsqebLNOcafEDmjEpcs/QhdN8oIlKff12edgW/Yvnz8Bc/ar5FmuL1whhq\nABtINXNKv4ZrinzAEPMNo8SIj4lUSNXF2rO2FMFOIr6Wjn19agkZK6tnVCAN\n1YvVf11jFvVyyvpFx7/VGEF3NuKWiiUdHd5Lyjv2tLs6MmtTmBVcsyozscz/\n32dY\r\n=8a1h\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQD5Kj23fL+uGMtUAwJbCf1t2HlRjBGJRHa/WbJNCzWtygIhAMdzvz8Q7l9cYQjNweW2R2T+okMS4wTk7k5S8hPaSh0Z"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.39_1573769395610_0.3962503664623198"},"_hasShrinkwrap":false},"0.3.40":{"name":"wgraphbasic","version":"0.3.40","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic) [![Build Status](https://ci.appveyor.com/api/projects/status/github/Wandalen/wabstractgraph)](https://ci.appveyor.com/project/Wandalen/wabstractgraph)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n## Concepts\n\n**Graph** :: set of nodes and set of edges or arcs connecting some or all nodes. </br>\n**Incident edges** :: of the node, are edges connected to the node. </br>\n**Connected nodes** :: nodes are connected if them have edge connecting both of them. </br>\n**Reachable node** :: node v is reachable from u if there is a path from v to u. </br>\n**DFS** :: depth-first search. </br>\n**BFS** :: breadth-first search. </br>\n**DAG** :: directed acycled graph. </br>\n**SCC** :: Strongly connected components. </br>\n**Node degree** :: total number of incoming and outgoint edges of the node. </br>\n**Indegree** :: of the node is number of incoming edges. </br>\n**Outdegree** :: of the node is number of outgoing edges. </br>\n**Sink node** :: node with zero outdegree. </br>\n**Source node** :: node with zero indegree. </br>\n**Universal node** :: node connected to all nodes of the graph. </br>\n**Terminal node** :: **pendant node** :: **leaf node** :: node with degree of one. </br>\n**Neighborhood** :: is an enduced subgraph of the graph, formed by all nodes adjacent to v. </br>\n**Neigbour nodes** :: nodes which are connected to the node. </br>\n**Low-link value** of a node :: smallest node id reachable from the node. </br>\n**Topological ordering** :: linear ordered DAG. </br>\n**Topological sort** :: algorithm of linear ordering of DAG. </br>\n**Distance between nodes** :: minimal number of edges to get from one given node to another given node. </br>\n**Distance layers** :: array of arrays of nodes. First layer has origin or zero-distance set of nodes. Second layer has nodes on distance one from origin. And os on. </br>\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n\n","readmeFilename":"README.md","gitHead":"1ffb352e03bafaa23e0254cd12bd925253de088f","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.40","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-u337+aeiratxyuF8nOx68V1qyC/1hGUC2wQ9MjQoeGDpMGNbVUZx+5bzT72xI53jNR5pmD3Q9zbvTlNlUuIWCg==","shasum":"665e54a3298e3f24e8518adfa4b907bf4bcf005a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.40.tgz","fileCount":10,"unpackedSize":139659,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJdzk2qCRA9TVsSAnZWagAAZvQQAKT8V4KVh7d+32PchpyX\nU+usRB/ZoEWWOxz4k68qcc+RnlukCmwuhUbiYg/8fLlHXYHLDmqk+sfRIlie\nfXiyeVVcrN1oEf2qZcM/KhyDQdMKIKt+DNzUgz2ZNfcP8iESYAW2ys9dkbVO\n2f4RNaiS0cPff1eRhCZ30MX9tHOaY6R40okBrihLsLvrPvPg+Aqs5RD0xogD\nS/bWm1ly0DEVFL4QjG++I+a0PFk0hNe6lx1TzHNdtHcWYkBdY2k0tvD1X0DZ\nRK5xTzOIZab4qRskFTdXRG2c49jrskg0zQ/R3F5m65lCp5XViXv3J0UMPtzc\nFMAZTIfQEsr27PL5E7kc8JGTxGolPj+mLUyHdKP2kMXp2sRvBFTEg0DZ2Zmi\n+JcHEM8yLa1t+AO7GnVAcEf4fnpXjhfkOm6XQdj+CN2CXZ+8LZ1xGomFlFXw\nITLQ8FXnk8XeILyXWKK/eFGD9FWVVwRMN8duoh39mYgX7TXPOP6x4OwzN2kB\nbGquEryAZopJIxxwn4wfzVMZMRpKDxSAINePCY7c5IWCieAzYvZ146F+o5a7\noBO65FRnbZcdqdpbfK8m0pRuNUVnKdlSEuYbHCTgAisG2HcCjgDvKoK4HbCM\ncgRpUgFlwZf/QDZqTe2kXJqpRkkLaKWiszWwH8iwoLHB3vVlz7NhZP+I5B1v\nHFAa\r\n=Nq3K\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEA5ylZtP3cQwc9wqwpm4jPKRfJtXBOJ1zLekGZwdBhxAiEA+4+T89ddvItki2M/RZl+RNUAWRqfOdBvzVGokia/PAI="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.40_1573801386027_0.5981896441198775"},"_hasShrinkwrap":false},"0.3.41":{"name":"wgraphbasic","version":"0.3.41","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"18632638dc158d1baa1ae96fe81e83994dd440d6","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.41","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-1yQmIhDMmioEZ4t32MivpQwOBuyBNvnLAlSGkK0C7rRBHGQeX5LLZGW4EvvlZqNGGEWRbigqkhZn65dLI3Inuw==","shasum":"86d0c31b5f453aaafe6c3f9f635af0a7d3400c9c","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.41.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJdz5rdCRA9TVsSAnZWagAAOkoP/RCsf79kRNcvszChlZZp\npByE/AdcFVhMCcIHAYrVNMru2/tYw8ptf8rbpjdDh1yx6CVsbIv4WQxuWC6G\n36h9NCSom3rlOaf3qC/7Y6atNU5Hcnf/kUDpzlCiFWauq0m+rGtpk0bDMwM9\nYe57fOFirExfpuJkDJjO0mTzb2zSEAGdOQ+STKO98BlB3mA9X/JxhZJMAiPD\ny/9K0hii/2OI5OecwjkInFLKB8+lecqdznLhiluYMhH5+2JSAmv7mek0c2N7\nuyzy3HxzY8exlG9esysQeBr2J6BZojPMuCPNlmihfsJpmA10VLjX84zj4Wyf\nB8I9WV50MlwStYQNplzTv5VGZw6xIAaawDkLl6dUtXAOM6v5E7gHf1D3u2e4\n0EgaPVjpHzvnzxjaotu9WPeRDt6yEE4OXubPkuzTyFebSzlB9hs1uAk+k+gW\nAXNGu2HVaH/0BuRB7SuvgAL3CkbIe1PBG+xwumUEW4WEw5QF6EtdJbrgkWB4\nXT/nD0rpPkGeQpSyg02XTw91FXmJbbFj0W+AAkp9y3J+Z6BKjkaqSV9MoHEe\ntxfxlSobgC2dG1I4a9TCEdih544V715D/8tw8FDuSEHCLQfoXxH2FFpe+8fr\nDBo2FSvSILtk2qJTiU8iXqUk4IUudVCGChad+c9dbYHVUM3sykf78EWW8iT/\n9UM1\r\n=hhom\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIDh5DvxULKcPsBTToL3fI8OIbHkZ2kz2LUmFCIp8gA62AiEAnYQWxQz13yADBJQx5DGNLUcLhi1ijM+yNhQXsws7msw="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.41_1573886685128_0.7614164429579491"},"_hasShrinkwrap":false},"0.3.42":{"name":"wgraphbasic","version":"0.3.42","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"293b23b23553168c5870205efa4e5b0a991c4e50","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.42","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-rV1MyGZAH8b4y7DFp/AI5bBk8yt832MKJYadJjZ6g9wmpcNp99AsncxvxSMrX6DOmXA+SdMiPnQ5kFSYS+oEeQ==","shasum":"47d63c86f03d903f79905f320a0b51032a75b7c3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.42.tgz","fileCount":10,"unpackedSize":137984,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJdz8X3CRA9TVsSAnZWagAA57sP/1BJitluvkyj5zlRnzgz\nbxlpPSZn5uTPFXVvtOjqo4QuBXVJsrIU10KDojPuy5jKWQg07X2gONVOTzdn\nM73lZi4F4Xh7KkWGV+j5mfpBz5jZzi0OuXIdkER5M9RYM33NRNaETZiRBG+J\neW7atu8os3XZYmee0aNg5gQQpnrAUgA5DrlIN6q2jUqkQ1aY6AplWFRY6WLb\nFpzHr8ZNhC6OpYUpkq3p9ilZouFx55Wicbk3SZTjQKK6B7xBiyRumsKh2qQt\neDQKZS5nX2ClZJsPzwLq7Te6vgFjf78kJxVwF/pQ+0/ugvABVNPt95Db+38b\n6s9vuNnvxJ/LYeYIgqdVuLZcXAFqgPVDyVPrg8BvuKI3ra+QYLw1k1JpK47v\noaOKtfMHjxAoIWVif313GhWgd80gSzMY/tQg3xbVcBoe+hjmkmuBehxNttLm\n8bfPbKNeJ9alpxL5X1MzN3WJIog+XMPUGm+W1TejaY2rsew9pIDInGrLQuLR\nPnvn1mB/RUVoJuUPy/yHJ/mV3a6C96QCrtblBjLMNr20fmqksNIFMYKkhdP7\nSbUeNksGv9sm0H87/RckKdSEH6Uf9gj6fT2OeHZNkybAIyWrPZAvPLHp+xof\nbzbTHTtXqsvolb80tRuhTH1thbOJVeyhu6fTSCiEpM2nIT16ClVRLP5/Ir5w\njCf7\r\n=KZH3\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGfKPEgP66L7Of0/lV5BuG2yNW0gcL5pTy1noje97HU4AiAjgS6IeUkd0r9I2mBbwW3fhf9a9+DsvxN/qB/31w8oCg=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.42_1573897718941_0.41852880997488584"},"_hasShrinkwrap":false},"0.3.43":{"name":"wgraphbasic","version":"0.3.43","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"fe595e485a8079649053441f8690ea7821aec4cb","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.43","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-ymqm3GwTV0A7s66n5CW0SLIsgorYBAdykAL+X+5zbDwg1tsbyQAE9+3gxHj3w4QcoAfzlS/lGy9k9ShBSMeefA==","shasum":"047e45a970d6474aa0575e6e3c184dfaac864832","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.43.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJdz8nUCRA9TVsSAnZWagAA3GoP/1NnOEcUtMxsoSSfm6Zm\nXSuBUbEow5FyJnDHw7wPmHkIHFnaIan+deoVhTqkC7bvhNZIVrPI7dFR1HML\nflU2YvecRdu17Q5dPq4qg8Ym6PVuaqgrlYSiE74nMnu4iXaF1RnrNrw9NwiC\nPnu7hPt2kNfpTiTqZQ8EpyJ/PD5hKdUIZrWSER+wOt37yh9TNYtI/mnSPHJh\n5AbzRQGXr5HoMkOf+Th0t04wfhpqn5gYBeYCFYxmA6CQwm5/pj5ywa23/LI4\n5FRnVOtx18a89dEHBA0UjFtT+oSRpClgXVoaSCRe3Z9nX1+DddMivruazVen\n6ya9Vn2vDLmVWYTGFSLjVfALCMnqUwSlppXfrL0Qtxtts8j8lYP65Ew7ZjvG\nIBiEdvofvnXrnDMDqbhROQ4CN1tR2BUzyhos7xOzlk/VERurBq+QBFu4JcNd\niD8a0bWAUWZWne7xpjTSDlDhhKh98BhfsUnagpe+fvKsMIXJvCCM4t2VAoT1\nnIkJdk/Tx6jzH0VGu5I6AOaWLoOmbKDLOgfBimVEIhRHp0kc4kJZRlc8a8Wn\n8vdFTQGahsddLtALhUKW2PR+Jd4/tRW+mlNzkOW62OBtCgRrGBV0g7PJ3dIe\nZXFPqYQONVXEcOWyso6bew5Yvn1YwO5SS2yQdAGc03e4B/FnJNYEa3vOvBsE\nn83o\r\n=V+CJ\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHrRotzS2FiGNGt9UmuoX87cB+sCickqwa3y3Q2SkuxSAiB9wOqghnNn1iTWRbkO0wDPQsMdDjyzPeuF0eYPY8bvnA=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.43_1573898708569_0.5078096484497714"},"_hasShrinkwrap":false},"0.3.44":{"name":"wgraphbasic","version":"0.3.44","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"598a2d84847e989f52ae8411bf20e069a87c3cc0","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.44","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-//+xvzn501Ovw+064hZqcOpy9OAIzVq114hi8yGla79w8/fjZNhRvdgcoZ69e98mi5wGZSU9hcLDXe1UiFcZ4A==","shasum":"a4b83510325636ba5858d01f8e17bbb3b9775fb3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.44.tgz","fileCount":10,"unpackedSize":138038,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd0sKcCRA9TVsSAnZWagAAeZkP+QG2E3X8ss8svz2v/HfA\nS7ZXnMnGZJWgODeQ/CttqNRxJ4a7QDF/8/2vRvk5bLC/bqKvxQWTCD2OQunJ\njcxnlRwOiKCWuXKXDrRza1xsPfrzWDayRSLFdfyG4x9I4fBJ0gW5YRIwNdKY\nonQFyeGGxF/QtiAUyCBcDrThau2x3SzHGwkKFFDyaeWsp6w4rCKgDQeI/9pW\nwGNCRow7+R0F6G+UOiBMcUAZcxezhkhj8pMaOqLV6QXEi0RxN+Avb41O0AQQ\nnpnXs9AqV+dcIWVXwRvN97YsjJtb6K2hyTzi3lc8/hrhGQ0Mc24YLoIKTwTC\nhaaUyn3wz5R/RAVCowu/kWY3BqLLk9hZaQ/rM7xRR9WG5QmKOsshY1a8m9Yl\nSFk8XewRMtnnn4rb10Kerz8/clvqD5jXYLgixaOQr2LBwUC/9g7ER3eQTZMw\ngJWJnYMKQ5qB2ryHB7xzZr/3YGWZrFG7sKD83cN1KtBKpkFlrb1uXBm+ihox\njh9ns3G7Vs3QsEPZccaIBj5PrKcpIHmvrmzl8xE0wv4Bpw3jV2tY4dtPZzlY\n+ftTjy+PClPOUb4v5QcqD1Om0vO+loTVZ4KWJs6LAbe0EouOyyldWL7IE7M4\nNwm/6edRY9I5d8VMyR3E7410OfoPkJ06w2mW2551UK50BUkAt+kLjT8Dq0f4\n67LP\r\n=oxgo\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQC58jQCofz97wU0QxcNO/oLDbakNfk2Iwvxy1AC2HUSwwIhAOsK7l+QEgl6szzPRzUsu7VJ2vTble0VOzCcw2bHKX1r"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.44_1574093468361_0.9301121976993818"},"_hasShrinkwrap":false},"0.3.45":{"name":"wgraphbasic","version":"0.3.45","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"efd1dd70b24eab0bbe4851784c22c1d463b459f5","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.45","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-999/SxPLhEDhjXGP7SdTIrBE3FyQj0YuvwsvmMnWzHGOfM946JzF6a+tRf+q7GcRIgCiBoYK/0/DOTdhTJGY0Q==","shasum":"82b9484ff51bbd7a1c5a0e5a49930f2822347e11","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.45.tgz","fileCount":10,"unpackedSize":138038,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd0tZwCRA9TVsSAnZWagAA6JEP/jfvXqIGPh1oslKQqFHo\ntLcs0ml3fJTXkj9CdXaiDFLue8delh1AseaF/G1ftqYklgJPCzPPzxqkEMg8\n3nz71vNER0FCRU5Bzi1Z2syINevEcepCWDNc1vyXNLi121tFd2TwYsNCbtEt\nTDQABTyvwO0ZORAILtafKUZ9tXxBoDS796TiSuoFRsGegdaREbljOv7zwcb9\nL6h4x0MuGOtQSh0rpqinniQ/yYbUqIv9uHsrOYa/8terNSFgZ208tlVaEaKC\nKTcPkGtk9ZD1+VgsrnLjcK/eo11phSuv+vAyNIVfaE7wDAdcecjmvOA8/ERE\nvOTJwext4XA7CmSkBPJRkbDem6WKp1uYFjJfl+Ft9VPxxCR6nWeFky3zZlNs\nkfbuHoNxnXqOoOxZG+XDpbu5eTiLp4+q3QG3p5NjHoxCyXSuI8Dx1Wp98Yw/\n5UaVeYljcDOKoSqyvU2zSz8Qz96NYlUoJgH4jLAvqdVErhGJMd1wM6dZbMhi\n7gXRNMKzjxn01DEvjqhhRiZ4zMdXVcjJJPPePYTPTxXBahkeP9rQhtITdKwQ\nc7VRHd04yKH18wWZDQ0lNYODTI0sEp3fNrmKxE2wfmdnSzPcFJD5QR9JaSBO\ncE/agm0kf1SQ5wfxh2XmbY176p1bggHBeAplI07lVcBlwU/kKZ2Yd3AQc+sa\nX0en\r\n=AsKk\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHaJxHB5H9GUH13Ecu2JhtPz61zhTKsMZ1501zMLLAgTAiEAoyv4yyeDkawjpWpx1WjesemB08aW4KJY2/KZsnO03I4="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.45_1574098544276_0.15949774122749671"},"_hasShrinkwrap":false},"0.3.46":{"name":"wgraphbasic","version":"0.3.46","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"a6cc4470cc87fbb7869d9334c91ac956040a7549","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.46","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-Ep9fp+B0zhZqO3q4AF60476QnroGolNo4EVfxzO9hddK8o34XzI1Kac8D/nNUXLzleS3E4Q08W2nNXccl80QBw==","shasum":"238a9ff176e0c638571d10a5f3aba617acc0ced8","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.46.tgz","fileCount":10,"unpackedSize":138040,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd09beCRA9TVsSAnZWagAA8e8P/j8Db7XHoOQGN6AnOAax\n3k+xad/CKRdjj2cmUVua8efCRxRlfbbO/KiK0KJ/Oa3alxpDTTvmvfX+UAyF\nCkMxJt2nWWb9mdMAR3069OAMaIwDG7/Rhv3AmPRPw8wqq9TJhH0G3oeDGCDR\nBXhoaE0zQEpTY1/HtNxfcbl7lEcysNPHs0UWEs+3eBD1HztzG0w3pdkG/4Ep\n8T6MdrrPUQCVJjRF80WXwYBC1lewkT+w7hkLmy+z25PJfJ0TtTueO6Thmrec\nyMheIDUJxn/nF8Nz5/jxZdJdGrckDgHT430r0k6zm0/YoffgiLiHZ9iHqPfe\n4OaqMRCl0YbfmPOUup2xqNMUW899BNBLORq3E3Xv7024FYdC4IPa0qZsQGD+\noYv7gxJRlwEB0Ot1/k1D7FKAmv56Yx58EV2z+geFwLBZpzJ06PnUnte+0iGy\nseVINHbLmUhcs2CvR5n/lbsh+i1AjRp7qt813T90YAO097WLv3SvkpE4TZ71\nKaFCV3VtnZqhwpzYaannOBPuADGaxZHppI/2r9ey33DyPaiACCOKQ32yy2xj\nL8DrcvHaaStpN4eqWBlXyo6q6X3qd7ebbGhI4Okj0XH7Ae+Szq92TOYzGSaB\n1ULOM3DPsmlhS24HtQ6boKyHzA2yJZk6b0TK8rE11jrUz6AC3sC36gzh4xAo\nR758\r\n=3dyp\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIA/mOAosiqD7dxYcivJI7aOEKb5Mh1v/tBxW5RHzypxkAiEAzoVBmUhTC+lnAmdzJ10hYKMoym4+rk51K9QOS7sVoe4="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.46_1574164190102_0.7745697524331614"},"_hasShrinkwrap":false},"0.3.47":{"name":"wgraphbasic","version":"0.3.47","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"c93ae2514312944fab4736d6496b9c03ad291303","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.47","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-8dXbjRD9a2x/nhn0ZQ9rG5DMxYtwWxX+L3JhTcz41abgbrTdL5L53T3a9FIG/1xVz7ufFDkTa9g37R9WMFsqyw==","shasum":"111c83cc644b4a649e02a97233b934bb001df00a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.47.tgz","fileCount":10,"unpackedSize":138040,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd1r85CRA9TVsSAnZWagAAv8cQAIS7585cEzX4clv1/QVh\n3hXMAe1Q5X2uP+eMbRxtGhDZ+VFHMrC4im3f7vlPGYn7+AVmCrX/ONmAr2hS\nUhVUGHdR8/3eSimp3NhNxU93s7P6krlg6t/1V2AKqu2V95ngheQwkoiCLAW0\nsSR9bRLufOXt+sAHY0XN+aIcLak2SM4tUqNijUUXC8e44fPyOVIv3uTvHZdZ\nVSO/sNdwlC12msAY1s8xvXj0leDCHeqsRI7iUE0TbHdlEBvJIBVl2LYTUghc\nj24T2ooOBa6519A57TML7SFA1vPxSKJv3LsNJcYud/+wmC69+qDPFgBsakSn\nc49Lwo6mlk37haTOEmPgk1Exwsis6sdNV7nfNyS94YT8oYVtm3K5+HU5e2lb\nVUUyb9ZECa38W/Zd2O0kuYvi4j9St5BqyMgfrXWzpEVCS/oQcVG8YpI7Gu9Q\nDHumHBUBK7iJca/e5oNYdLnCX758ZNPi5LR2hoXNQ6Vc8I6NzOCDs2M4n1Qk\nxw2E0jvjsnd53TmTy8D3Y2Y8Sx/XVVTWzGNPbJsxgnUBPYJfniHsgz6+BjHb\nfAx5z7Y3w3E86pdu6eqUdt1dPWsAJ8/+kDg2LwA7fsUP3zuCDfIRKFz4ZkWr\nJPH74wh7F1JVuP3pFKmYk3OFAznr6okt8rmDCrJe1Xqn0kDy8fMewFPZtDTH\nNb89\r\n=Sn10\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCEzUkgCa9ixojk6LK2xpY0orGUYZDsZyMNTs4iuKo5zgIhAMZm1vFNBY0Q2AlSEnbCDwcJXOeeSrxfcwUtTctJPP5H"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.47_1574354745021_0.09359804716738673"},"_hasShrinkwrap":false},"0.3.48":{"name":"wgraphbasic","version":"0.3.48","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"76fc8348f0afa716a75e0b7bc9cb3267fb8c2143","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.48","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-0zf/z21EoOKfFzvZUE8M+J12v7KxX5ySINYYPbc7zR+/gdrH0stPVmUC2pYQOJbiEXnNiMl2rKUwuCCgJo9qWw==","shasum":"172103ffb041d0c631e4511c015defab9ebbc982","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.48.tgz","fileCount":10,"unpackedSize":138040,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd15LTCRA9TVsSAnZWagAA/0oQAI/I5jjmuXUoOnniMkD+\n5KKdB1/tH6yuaJEP/OsQJHT6Bzr7HkECuD15Sp5P2TVJsYlyV/D7MG0snKS4\nSF3gBVKV/OC3ffFIoia7l8LdMQOKQMTyafRvLT3LzNMUhEUNgfZ8Ln1yUhds\n4oSBHAk4n1Cwpr3i5WnYXWUqOrib0fLSZbyP+p0yHpQ/cz3WmSrjjRJPeASO\nB+b6nQNp0VjE9fgcB+MpPUXF2Lkfx38KKjHUAq5Ie6R/VSEAmTJQSZnGD7AA\nVckJ13tPwvQ8OutolBflLQa7ilC2EdZXneHKDGVp2iKuQFIDmXULPHk+Qxse\n9A07mTvTlFUVA55cN5MGPny3NZ01xWI8FJ6cxXqNADTmF9Z28UrkkUL61fO7\nrjx0WiHye7ctJr8oow4k/Id+SsnYIz4xddkoYDYkQYFLdX0Ify8wgbSe0Wyo\n0roxsWJPiqP86RGMpys9/buPTSNObH70po7BM6GS0NYFoebe6BNBdEkCmCyr\nLi7CHeRKR7X0wN1e9ufsGNVcuRdtS+Ro25Ezg6MRoY2aGq7jO3Dj+Lm4jq/2\n5MILwVW4Iix8/xMaV+9RpuFOVBsEcUaDT6f4COWOxTcWHmhepe/FS4KfHHxB\naA5GbqT7J3WSvmi7oPpTy41Uf6BjqFSg0AculcM5zsKzp9QVYLc+XKvPReYS\nocW/\r\n=JOnQ\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIDi7TfH5c0S5vsx8pzUDsCGC7yIGhwAabsh5ysGbd7bCAiAcv1sFpvy+hmhhZVvDkld2Ixo9rEQs+QNYMhgHv1325A=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.48_1574408914713_0.9469378100039598"},"_hasShrinkwrap":false},"0.3.49":{"name":"wgraphbasic","version":"0.3.49","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"b2e1e6c0051ac079b0394ef2112c0f526ecfe655","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.49","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-r3hNUM9QoHJDOOtorecsgk3s6qphD8WZCGyyMIcQ0witfqR+38x/7spWTATBMX+fGlxXSOpvQSIHvAJ5ZAdAgQ==","shasum":"6d2be7b6c198c29088a8367937240be251e07a93","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.49.tgz","fileCount":10,"unpackedSize":138035,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd4PFJCRA9TVsSAnZWagAAbNMP/1k8NM6OfY5T0MdXpEF9\nKnDmXWfy+cgjAFwt6Xc2G1GZmOzWgFQUtlcReobxr7WbpxLqGnPKHcvv22kI\nHDOwZn2R4ztI2IaeGV9xmZkoUviX5VvnCi+90vGDib7gp35Do5qRJBX0IIDb\nDdI9ag5Kp3U1Y79iguAHr7uOvOTITbBInWMfxjfm3tqwKsr3IJhSUQQSHRqv\nB0Me4BgKqdOvXvKV6C914a6CovQt3vLcI7n7vkDz/SmUoOIwJ+nR0zYnvuzD\nFvMkMrLPEAY8FfM7yxz2TbjCP6/FWnIVrLPwyuWiP5ifUVR2PvYWUUPptmyz\nyCdTEDUbqfyfxtc4KQWuTENdmyfmuI2DgswlpUmIwwPMGiZEYozVBd5FUQKm\nuXWajI+QF30ozwzisl252A8K/ZfjuPt+nB8b3pNhOqoj6zyLy5pfVdLMlzFt\nMvWAm04l+8/l5DvMBiK9m9ZTm0CFz7gJIYsMvoPEnasMpRNbUeWEGTKPsMBn\nR3EWu9ZzNKqz5GORL0k2z+xgISBsD9YmrtqX+gWrIsOSWtJ/Rc8ZRO/ZmCTF\njORwNc0H2qHcrOzVJAoppjcCmOh4tqB6D/KlPiep5NbcMzAa1ZEz/QVV7hAj\nCuwg0OMMq1q/DdY7WmBlc1nDjXmz4scvRHNBboUjIayTkAI9io9mk53MH6IM\nEvRV\r\n=doCZ\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIDVd50txB3I5ZNieIvOXPfAzauyPL2+V1l83WVON+dXxAiAKb1f4NC+Uwy6SOqlSRSgG3a5o6MRUPi9Zx/tl5a1TnQ=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.49_1575022921234_0.4067816823132602"},"_hasShrinkwrap":false},"0.3.50":{"name":"wgraphbasic","version":"0.3.50","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"b01f8f916c5aa8a91e3ba12fa412588ec975b079","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.50","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-1v27MS5eBw0FXS9kXVWx/DunHwvyhPSa+bE5pZ8UMyq9DdxtDSEBrBOawI6taCziyrFohfS0Ov+J5HDnNwhEOA==","shasum":"8dbfd27051631edc7e8d845362f5696958809fa4","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.50.tgz","fileCount":10,"unpackedSize":138035,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd5LpBCRA9TVsSAnZWagAAkosP/Axl+x+4nucWhE4eoK6P\ni1xRz0Af+tc2ojCtZL8BwS6naaPy4jxF0Qz+Du5j5Y9lGSpbiawj2Fzg6WR9\ncg2SiUUbPIDs+PpiwXgian4FGC480qTzRt2alP0PhoFZa1on7IrSA8RBxFmv\nC1uDRivPMPsVs/wjuGv7dUXDy3QPZ8/YwwU+UyTkfWreyQ2zqN8jXPlKH1Vg\nE4FgHCc+unNygmGEHw3sFAMRjg8yXrtE7qTgV3z5EqoHmPFdZdyoagAptIcE\n2Khees1+ysybrQ5CUI18Ask8Tw0fCyFSF86pvr7M5AivLB1P5ij6013zkbxz\nNYsqMkhSsTn6qQuTRMWqzWfbZzOr2y+/42z/YbsMViEM4jP+Q3sa2+Mfv3MU\nPsn4BjERMBcMvNehHFm2rYPn63fsknSWDgeQ0nDjgBWOwgi53G1uPg+l9os8\nJL6DmqJirr65cz5XFLOSlbV94/O8wXxEdZrHckywzyDQivkJY0hcoy2hYEOs\n/DN9FEUQQXUVCvsa2Wn188eKIXykP0EL9fhEefzfhUQjRaV6MJ3sMBb7IPYT\nZzzWqupWBJnBVOTGI2CAOSaODHwXy7GZwTiFoi7w9Uzvgy0UiNy7V20GqZ7K\nkCj54FZ/CuOljuYGP3C70a1KwdBbie8yqpyQoqG5YjdISg0BSup4t2pnXqGL\nlZ6e\r\n=22yy\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCzIJblB25rGdQ5pnEhPDD8urosO9Kn14R6JFMfl75uyQIhANovmKL8C90OssOiHLaY+0QbKefQ3PDgFGib6fvQr+29"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.50_1575270976955_0.4860826746915796"},"_hasShrinkwrap":false},"0.3.51":{"name":"wgraphbasic","version":"0.3.51","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"32f7ca2a7973f0ce33d837d79d353b81e23f2767","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.51","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-7ywnQIPI0driBPonC9/gEvPSGJasesogCInQLBNWDDROXSpkBwgye5v1DokurCJK52ZTRdYWn71nh5vZ2q1jBg==","shasum":"4be4f44e3d208c7ecd4512d5a8785a733f70b001","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.51.tgz","fileCount":10,"unpackedSize":138035,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd5711CRA9TVsSAnZWagAAPh8P/1mRFl+HVCWp9twfa5Je\nDSeHts5XY75s8xAXsYxjEC/YOU80/SCut2M48klAn/FhFXaJu2i1Jns/xTbv\nBuAA7jVBw78sapGWBbFuCfAExCCK5DSaAhfRrqqBNUgHz03z1FRXDZyIEtgO\nXvmD4S01yWwRzbHzQUVs5MDZ8Ww3Zf1LLPcpvK1ERdLtScsd86GE1HXfJa47\nufPAbmqNm3AjoDRzWPp0D+JPrwN7zqCbG/6hqghFJpCZoaTvDCjhPofLDYoc\nmyeZpcsdbEJqz+THOIi3kDZ4RY5FQvhK5oqkrfWrI+8EBWORwWCm4Ha4W38k\nfXYglx/g/4KVlIhuxVouLTFnPyvfy5cu6+fwapMXwiNjMGxDH8rY/f/h1brv\nJjrLPK/GdBmn7WMZx63InHYRimnlZpSK2k6rF5SnP17TlfmX5wLae3gboYwi\n04jDEfJ7NtHxrB767K4xg7KWy/BCjshanFoAJ40kV5KJwgni4I4r3PKhfFSt\nWzrEQmobM/qEkl1ReuUha7z4GhwS9SpcKgD/jWRaYLJRxEHkcptdX17CK9Qz\nWfvdE/nu40WRU9Oz04hQjze9Cv8yvgs1xgsTGXzFuEh43Pnb6NJfjSlp6df+\njSivpxHjh2URYEn4Rg5b7X3G1WP6+VeaZdikYVCLaga7Mqim2kcF7NfEzPca\nsaNA\r\n=8gCC\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICOWY/6Uoa8NmQssyCjpzWqDFKIR9/G7n3V3195BUeMfAiEAxoImifHAtEFFE65WuT4+eAxLJV0WOhvUzEDzBdbrZ/M="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.51_1575468404551_0.9294200207599146"},"_hasShrinkwrap":false},"0.3.52":{"name":"wgraphbasic","version":"0.3.52","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"07311ecceb90454612ef05ed51a7515c88e5e604","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.52","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-rAhz2CINJDJRT9U7C9oW5XsyjEGSki8S56jOi0GuJkJS0dN9p+0UiKeF0STOdZ4evZ0TNjiJwzPUzIHLTwQIag==","shasum":"3063caa15492c6be777cb1a4c63d474a65506934","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.52.tgz","fileCount":10,"unpackedSize":138045,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd6V5ICRA9TVsSAnZWagAAmCgP/2JtjHtqMY1ccvOQXvYL\n0a2m7+f/jrwcq34TUbOzn9XHDNJk6mGwHmqv1eBF8O4jfinNMXhsc5EGZ4X7\ntmpwnQDhgUwDmj/2XTDmCN8itDqKJAKnlrvxnR8peRJH0lcO3gXSYAh9xOkR\nSDd+qOlZ9pmgOS0rm5/FTGFGNFSAhpgD7GbDLWvDJhkLfPPncTi2zGkUIjG6\ntW4HF70gBABu90i+ZH5aqi52gZ7OIWaYWcaZKec7EMFpV7GNix3TWIsbOjqj\ny24dJ9hb6B3Ou0xsn+jJfl2C2rX4xB/4xkGIwk0rUE311eilJv71zfBDtseB\narIgK8Xwqfb3GqUuJwZlknXuPmvBocKEBLFwiMAsxjyOSdkejWglMQLb7NJ2\nA9+jk9VOigUav7igUXKLSe7hKV+EwcutJ3Vf61lJRsyEiak1ixUA8tIzfE4t\nx4tpfor+gcUvN8miXU5KqsUm2SXMX0gun/Vwhr1FdQMbCyKfXYPfMJ+ekIx7\n7mA65CuZ3Pg339wHMZUUAKHj2A/NIYo2L17Xmuuk745lqtyHRDPhSNenUwkF\naFmnjWnVyMyBFXblPZcWa1pXk1/PmMjLGjfTbeHjAJ8r2MBupGS1fZ0hj8yL\nGaq1ymAgWUjNYDqRpO2RgWhYgpajzw0KyYBa+x+ytnuzxILga5wHPX2Ut5Yr\nqOui\r\n=qWFd\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCuwpXtCvkvCa/Bc/5E9bCAgLtYebAsGRjca2X26uIuRQIgQbDMVEiQ7vh3GHg4NTZ68HjkLekr6p4sjPGVqFwFSUA="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.52_1575575111643_0.35710230839639445"},"_hasShrinkwrap":false},"0.3.53":{"name":"wgraphbasic","version":"0.3.53","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"0263fc477e177dffe312d70628fb2de81c80751c","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.53","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-OIIZZEn+mOxAunk4i39jZlKmBWa9SfPpb3gd8nEkNYU8l0NwOttD7QvJuEPyTokWQPzo8NgFj+2WlOUsIVr55g==","shasum":"e038cfe58e1054f3ce2a149eba67d9e05136c0c9","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.53.tgz","fileCount":10,"unpackedSize":138045,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd7perCRA9TVsSAnZWagAAitUP/jKRVsxwd+FEPLT0hw9m\nJCqYDL1/OZWHp2V2AgbkRzGxvuCsfrPo3AE4CMgEgywJbRPr9EFq5QRk5r6j\nSa7m0fIIpc1UT82W6YJeIZSEF6+6HnY6ChGzavKJoitrA6SWcKqKcqtPT6dP\nBs8mxJ1ig/F1K75sxd9HsP+6MG5f2rgGuk29om2KE9vMQE55OaDeku1gggim\nIT5VfaFu2cz0cftPQVtRYynnGtxT68FtRvn+zj4Wa1ZLmS2SfNbdN5SgG6H+\nBaQ94IIoEKzGJYSvXiX8gB6TlMwt0lSL/KfhlHkyHtt4plngxC04E5cCzpFj\nU+xR1W/DI5FPoClXGKjAc0HVz4hymKT6qZVh0wdwAmKZKcC264qi+wm73s6O\njjtLMCSPLi8pWJTmXayOcrrY8btdc83Zm3uWrmO3DbSrc03T96cJBtqOcyxu\nwXpUECa7C8Csy/xcze3RYV2F4M1jQ/5gOPuOcw6AU1p1WZGjiJaXRUUn/yei\nrrzXK49Oh1CTXZN6/ao/pcHVku1/k684sAW7ESyMFvXvwrX/8+t9v6VwxHnW\nc/j/YDZBQ5z+XdTbRawVCr5f3LLi9P+yNfYBCp0d3wsLRcifN4xrWecbWKuu\naOphmUoDHPq4K65Rxqe9o6W56LdQcnNzVyqltp6k2p6ckJ+dzDRGlQJv3h/Q\nPgYs\r\n=kwlq\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIAQrDTIPZA2g0qy6mPgyEscv359s2ZXYQXWA1uL6AzyUAiEAyElfCDmZZL1Apx6OI7Blpaw5bw+fCMHZGZHD7ofjJ3A="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.53_1575917483262_0.4554236268073164"},"_hasShrinkwrap":false},"0.3.54":{"name":"wgraphbasic","version":"0.3.54","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n```\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"c3becefe312ccbb8a03e61d9816571f4a16c5e99","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.54","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-DXwNHobQ/oizO9p96QKbup/UYnJeoaHH7WGf8lzUFoimGXNI7hcB3d5h0RblvRZkYX+csrZ6q8fD3OXo3cxvxA==","shasum":"b9c32ca9175f2f39890cb967aa2689b3d6e8d103","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.54.tgz","fileCount":10,"unpackedSize":138045,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd7+8XCRA9TVsSAnZWagAAucgP/A9hnFApE0IH3+jBpBen\nEd1HttIFZf0xF7AiwCCoRQ+tXyI95/OrxaUngyoXGaCAFEccN6ssuJ+7d735\nOOHgNbn4LBZ3b3CyFyCDg5f2PjKZcLtX3CC9I78GmBbTbenddqIePTxjcwW7\nFdkVkfAlOsepJpX2d0PSsavZWzGKwAYSTbBIyHXCcZeizsijhvB/jwB0BUmz\nkG1S21b/bN5aMHqxPdW/UGZQX3fz0vCaRW1luBqVfAjOcIWMou279AtTj0SX\n5vPjogEuHOJzhhpNKjNKRp2AH0ZlfB1NbqNxWsKzqc9egGFwxFvqsH8hJWJr\nbjWisA8Qty7yKFHZRiwAAmsNhmlyn/oVcUgJEHOkME03MzjvSMybBf/xI62m\n3S5Lypxpuj382RVzhxchObPfL53jeeSkODezpRTeoQOeTbcMxfXCQVTgv3du\nyisbc9W3PsndED+HdvNREQ5IbXF4kRUOk5LnA5Po2TXxPavQPAaXg4E6hVvG\nGU2FCM/Yh4Cjy+e7CJAk0hhehNCbPOCIQSfYfm18QBqvIpKWCyIjcYuSljhZ\nLP7a0AiXavwc56Gi7hFV3hfbynaEg3v4YZqR6HBLbSrxsG669Au4jxrzJA9d\n/ZeMdCB/3i7Iv3A1sLTXx5solQGtj+TU86zsCKny2oHyzrCoYvJU1MYVnF49\nwLjD\r\n=MlyT\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCID7S4i1BnoRYyUxk9XoIvBKQJ1dwpQtZqYDxo9oth0K1AiEAmCoBhBW7I96tdVtqjNpOhj+Glfh48aRrjtqTpe2NhiA="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.54_1576005398630_0.40710277424128516"},"_hasShrinkwrap":false},"0.3.55":{"name":"wgraphbasic","version":"0.3.55","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"c8970ab84cd82cc5a04889ecf050e063bb4ab768","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.55","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-TsEHCC6GUypciwp2nUnifil9Hld8ZdwMcdp9v0KpqSxp2Jm3j8zsI+MQi/mprXbRn/qEx7Hq1W+Ib+F5wyQR8Q==","shasum":"41202df59d01dfb81bfe7cffd2d9122d5b3c2ea1","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.55.tgz","fileCount":10,"unpackedSize":138046,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd8iKaCRA9TVsSAnZWagAAMocP/3BMCCmDOetWWSMM2YVY\n1sHBrZBBJ2ZVGDSnct5oYkUFVzE4xixmMlWvF+9iNX4HtaKCMFegiR6RZq+T\nx5tZIS1ZPm83xxLynDPcuqGVGvDep2ViEGf4IM1OyoSWPHDKAkRWUCOp/iYg\n7Uaa4q0oziIIvmu2NUuEa5/1hJsFsf8zxAgL8xaD7ngswLlzAcjmNGpPPo/b\nFEFF6AMxh82VN60LCUabUdI78FnpCPHDsFPwIG4Hm4nyCNY+6xpC8rySfoCx\nRAyPlyp3GNdta4SUCh+e1zjpo5StmmCVTTQSUAo/671Dv5mY/q67xEZ1XPeq\n3YkJAbTq8yIoT/LjZ7R1cmsMhJc2MBQJthcQOmbGROPJkZHH6bTv8iI6Homj\nZiCGnxzFz8MPMgXw9AgQZus+d2oFocXGYYRTgtHzMTwx3D/XIDRe8FuO/1Ij\nETNdq7t/HhK6SDO2YF8DLBOCfQ09I+aQy8Mird01X3QjpGWGQXNPSqi5LtcW\nIqfVNlMUjK102sVaB0VfQkfq7eHaOqKwXkhIpsMI/rS/v/EBu9YPDVZOqBJt\n/pMfn55tVsfVu3G7IdnG0qazZhMzDZ6DvXDSZcu+mnECISRZrznY7pslTl+4\nw1+aHJEtZIG3cPyamnZoFx4pJJnaor5zIk7qi7ziMC22ulHO/w5aWevKlZyY\nCoem\r\n=nlDP\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICt8+TGiiHoOhc20lTGZNjVa+9IladznyXsl4AFh9zuMAiBTQrPpyWRu1QdBQ7wXGzy536Abdz4suIiecLwOwTyvag=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.55_1576149658518_0.2172607820024237"},"_hasShrinkwrap":false},"0.3.56":{"name":"wgraphbasic","version":"0.3.56","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"5a5a716dbae0922b557ac6e144786c2b0e0c0d55","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.56","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-0sgf83lNTpbLy5vqbydcYl5hNne1/EFb34+dFnlt+akm5DT+cEXOcr62RCBd8xYk6FtaqzBupa/KH0wslnUCWw==","shasum":"eaad48800a2283be655962481e9e54c07e16cb94","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.56.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd8jC6CRA9TVsSAnZWagAAK6cP/1UkVWWVHrL47hCt+PcV\nc5P3GRC7UatkvMltDAImb0c0RAOdW+91WJ3eEh+uWmAxR+gkKPd4vbexyPKw\nilMyLSiQseawpsR3TkeMXkWqiUvwQmBbW6PDtpEcdeggICaCkFhazx4W7hUU\nRpv0/zCP/3CB3Sl/lODPFmsA8X3tTyQMb3iz1xlGsbSny52oo6iwgbh6NLRq\nyDME5xDyXGbtW8tbHMZWv89vEhrjM+pEBudt7J1GjxyNF9Mhcr2UR1XTgz5H\nhlMNrdLFjYM7TzVx3MtpBefsBBDQtXxAH9jbPOmTBrN/YLqf7HFci2vN/4ah\nS1cN6uDAvdQvKf1nTQG6n05muwWYj92ELKQ1IqpD7kTIa2wTR2XceowDvLzs\n5950zNDcoQX5nH7/Ftgr7NK19LW0G82wdStZPZgKOuDJO1Pc4ZgRVHdSbPVw\nKsFFqkC7zodUlnpQLbvtRE7r4KQslofEhw2IWq46K15a/Rw3NCWWoOFs8xDG\nmBPtuUsSLp0r+WcCQPLeYm+XB9WpGZcZmjJfLgdgiKHF05AqGPhK5LZRopXB\nbPI+mxXgLa8ONfReM3zIPTwzAA0qgM6F96cU2L6TCotK474esVmDASzl14vJ\nEdVBUXfLHu1klGgHzBczMu1V8mibs1lKff4RiJzKvKAeQFEAM681gSsKxaly\n0aMn\r\n=hllF\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIAQH4g2xPh0d49glfT4I87by1hLgL6JKYqLG2gQcm5AGAiBWJDU2/rQ2a1U+3tDERiKsQnKsWBYxSx3S+rTGifY7xw=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.56_1576153273986_0.23865072690370925"},"_hasShrinkwrap":false},"0.3.57":{"name":"wgraphbasic","version":"0.3.57","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"506768d7552be9b218737eb42ee348b8c9b368f7","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.57","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-lpAqPS1D4Hw/8uIbueS/++sH2HOARQ/qnMk0+rQwDfqeYIInNGnCo1O6qTZGZny1uBccVGcLB80S0m5pYXoDHA==","shasum":"03166cb9f0878bbdfa43ada91455890c117668c7","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.57.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd95nECRA9TVsSAnZWagAA4doP/RKlA+LCZY6RYVHOLvFm\n39Ail0dKobHI/rb4tksMhEFRxPR0ql3uBvRZ2vZ3asxedv88pSJFH4MWhvoa\neNBMAMpjs9MMbV/2vySA/t+8HWzE5XuH75axLt/xPOt6JPDVc+daV2CcX37F\njIGH893C4clQKFl6xSYq06HthneObQ+rHfkFmeHKIVMjOVciWsYgUzn0AEV3\nVIPmMkqSX8AE30Gp2FACnGjJ2yYiIKSi91+Sbk5bE/g8y0286uB1kv5K7zgf\nhBXKv1j+2XFynuoOcb5/Z6op+6NUpbtVLBbmiPm6pDYq8beakPVyx9vHu7pV\ng7O6CTmUozXRG3qliB2TJwx9ZXHQlcyOBWaOhb6RibxFFXYCuMGpY2SG7l0N\n+B741f5SdfsQlO8+RSrE5ymL0L00dWRDnlxrrjCZr7v9h0++boRTgUn4w57Y\noprCbEvJ3x+hFMNIff23tgbogVMPUZTbwHt8FiL7xiN1CE0UN5ybOj84NfAi\nmWtdcMTMPZrwyKHj3fVxq/6qtfzw64qEltX/Y0WA3HvWmpLlQbTkYjJ7oAlv\n0pyQ7PUy07PWNV7XjRBje/d02/a54/1vaLiQBt0lUPHXMkHzDOBfh508YOQW\nh1Dg+OrAeHvCGHSLshOk7Vvkj+jrpBHs+WIfv7j1BnNauWh9GwWHEuDahrRK\ndUt3\r\n=C/fA\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIGRk/Bg14dTL32Oan5uUb4BdY+qFOCxq1TcSFmt36kr/AiEAiQVLzReo66HhVyjfsn2B3uX+1hb+oqsSgBcBIEKbAjQ="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.57_1576507844128_0.6229992481590358"},"_hasShrinkwrap":false},"0.3.58":{"name":"wgraphbasic","version":"0.3.58","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"263153d72ee5d769a38ca9e45f51d04872656830","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.58","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-+5qHU3MTlrb7prtXR0MrL8Rhz8tk+xFdSXURNidrwhkVow20PJxDqhLoN3HhtIouIB5x+ETwdUJM8PsqlrS9/g==","shasum":"6d5c27a6710cf62556f820a3960358a880fc141a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.58.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd+0JxCRA9TVsSAnZWagAA9xMQAIxUFM36cjNnghCIAFLV\nh8IT4mKL40iGBrJH1PfR8Gyie4UjQKK3r8FaCpXvujwEuS56lEorLcHHUeUX\nsJov1K/xj+L8RZtkUKXoAtUAHtCvUoe9cYDDd5U5Jf9KeRs65nLrpg4q66rR\nCI8ZCMB7H+jRSrrEarSm8xC1/FxBfhMw0D3wWZJZq3dKJUtQtghWrXUdagju\no94z3qTQMAnHawPcSTu4t4lXJOJdigX5IAwlS022rnR2AHEnoYl9itp/5yPg\nt+UrNTG9DhlbAHNY4KAaSBKmHEivYeqBnYuh02P/Iuvj9jGWd3Y2eNs+oJs7\nujSJIbro8wrLfzB05lTV9HjdzO7QljLL+RilGXhbpvGcZsySnjJaMcXai7Xa\nWrqRFR90vgUhOGxLUNo0YeTnWe2wyipDYb+IlYSQMUCV2YnSRZ9k12pjaWX7\nUs8oqNvrL+1omtlun8noEXcEVO9WlUopTmb4MCEMNY8NgH1FsktPOKw7tMnZ\nxFHS0TZ8owGbqFSUcdslN+hIV9BdaaZfjMTCmtrbehNF/Cq2l+QYpSMy5bTL\nVyUxHMWl3TWQ7Jl+ezH5KYrhGeXdifa+L2rDRh2sfkQb8RQgpwU9+NVA2/hM\n5jYCHZW8m9J2wNqo8vmdWqBEailkBQvbPsxQZv6Kq+tLUW+w7kqwrRiqDsHH\nRYYJ\r\n=JFMt\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCKk4Ncvs+AVx6jt8dxZx51XXn0I234xygmKtVJ6SW5rwIgXG1128wYjVxkV/ojhP+/HABDo2gAn4hR59QL2XxwyeM="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.58_1576747633245_0.08326964240362855"},"_hasShrinkwrap":false},"0.3.59":{"name":"wgraphbasic","version":"0.3.59","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"997c2ec630bf52a4259ed6b66ce3efc841444ba2","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.59","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-LVcQB0zV9QyKzOjo9cM7QfZ6IwrYENC17ar0Eiv6H8ROVZzBcZPHu6e7i4mCs4sLO58FNGvDSxJZBd8RzGiUrA==","shasum":"27d399a7e5ecc2e787f3e8f8ee325b0d4ef7887d","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.59.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd+1DRCRA9TVsSAnZWagAAZwIP/1tunK/QvZPKCFCB7Ps2\n6VYRqSjbEvJ3EHzpSn/wn0UPxFdKZ+3LfYTOVAV8U34jSD2K1bLn8YQETAMm\nklpaMBJxGruahgVudfe48KWDBi9McV+HBiyQEUoe8LkRduErbWRxWdtk3nFV\nu+WEokvGNTgIy8Htq/Xk+MOvCjedxsz6d83uAye3wfZiBwcEPytZlRMsSpc4\ncnowEo3kfXWgmnHEQW83Yt4REyK15yMk43tqxkokSh0sut+KgcPcFxZhGr6V\nzCpGotTCo9xvBVxpbW7pVQaVb686gaO5qwuhSy89groPqUk6ag94pTGjkqQh\nzZLhsI1wfvZtJieAjDF9YSWDdTeBIk0Lg38f7vIZK6aqEj55V0fQ/KtMQfq9\nzss7yvMdNnQSIfcCOlfS3Yeo164FJJ8SvG8lKh7AGw4ENLAjCSaIr93JuC03\nPNWPtacWPxmmTMXFBuRSHUt4NpI++Fomhc6U+vbGdSx5IOunnzIJ5ekzorRi\nYcP9bWSs1j740QXfq2Iw/S8iXqiEe+vBGrGczhZpmPpHSHX/UUZrfDLsUS3m\npUAD9+b6KHGfcb/cpQoDkEg4CUpMC1UqcgxhCGTFDPffwEpxf0edZaccANOH\n9LtKdvt9TJBjtZ1yRvkoluzX87KzLvAaLhMTbCLZaGJI9Iu3z6zYK8Fvv0b3\nuqzQ\r\n=cHRV\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGeuPnumPaGMbaLsJ9QegEUjg7v+4xQaaK1bcfXihGepAiAyJf5CXE/aReQqlaHRnpXoV8yEG6UQcLwqlMhx3D4lQg=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.59_1576751312917_0.9526794720198022"},"_hasShrinkwrap":false},"0.3.60":{"name":"wgraphbasic","version":"0.3.60","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"13f19f347c642d8c3b621216ac6af2b53a73fa6d","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.60","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-UvExS90VRcJh3SmZB117oKbfr+hnOQvAwkMTkGRPYlTssReROWNH2JQ9pr/zc/3SXF2Lp/gXENpS/iQ7Lonjeg==","shasum":"1b1841ea7a0111ca428c703326cf0805a140580b","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.60.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd+1hiCRA9TVsSAnZWagAA9skP/1G0Wkjn+8+uZNMUXejB\nd6xzdiw768yt7yjTR5iaT6Nd+4AzfhB+WeOsE6HZAbn19fnTArZoAilT1wCi\no8cd2n2zzy2+f5wAfxWHbpAF5YGUTLWw/nJMmSo7vSMWLXqP1xN9TwoyVXS7\nVmP1MoCJ4Qr3QA8Dg3thWBzsWjHpc+drG0RB0awW/4IMH7lmpvhp+ExXG9Xn\ntkem5TOnOjO+w6gCbFOUYuJE6mjJHSP7Dv5LeubegqNBs7K1Ik+xwXDq8Tq3\nHpujUfArZEeLWsIWRIKjJK87L4ug9xjU3QVBPzMi2NaGg8Q8RKXxKO4BW59a\nROpbjaptYGex/aPuEl2hVrn/VJtJCNrApvLWhGquVZCuo/aepykaeKZkkxqt\nSfV9x6ObH0KVD7SV65wt+2cTzMnApPJdRWW9OXKDZtKfoQSHZtqI95ksxIxl\nfc5dYrrZ3qPmy9tzvrPXhAFGSd6VwyK7mkHm3jKMpWo2p3UNyJO1y0yb2nuL\nzTU87TbW82T6RLKIQ0Tv0m0AEdQTilR7eamQ3tdPNFcFcRQvYUnxzRor5PiP\nJ2t+94sxWTuVM8CnZk4Ywq5ZGBnMdLCArtdIvipp84B1TUr9yARRAB/zIJie\n5BYBFGR+ZzVTdikjX+XQdZ+36CEvrJTDCBp64/YjH89DU9CSAHd5ZK+/2vdS\n0oWL\r\n=q+Sl\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCY2S39PqL6nusWiqB2Bf85hZuvq9bHh4k7pzUIWvh73wIhAOSAEQ2CM8livOSIE2mgFEGiecFJvWfg2uU9gM1CtlGT"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.60_1576753250457_0.5696962932087335"},"_hasShrinkwrap":false},"0.3.61":{"name":"wgraphbasic","version":"0.3.61","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"3fdc3ba178aec90ef5d4b20ed22c8fa5063c706c","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.61","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-LPjJZ6drWF4/wjwu87QTk4hhNXDjCbVHCak4EZ/nNfTU318RlXzhLktuIgPTlc6//i94DqfkUjnEpjAnJn9/RA==","shasum":"fd2268e18e532ba226fcad316694a57627c50c23","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.61.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJd+4K2CRA9TVsSAnZWagAAjjkP/0QqxjLuRTp4c4UwXq2V\nfDb7D23u2oC5OmfBRvcoaHmXI27NtiUCLegCTRP3HzeX8yb7/pno5WoiZHIB\nAAst/NaKwbDtcFHBm3TeuGuHUsuMfFsaAQnYbrcKf0i1vmdiw5Sye+VVytlj\nC1jA6XzvpeaDJTRUR81hO5YdRJgQk2HrLOM2kkvjfYPV8BOsc+bBg0sPq+wX\nOE9yyI422+szZAWIUYLIF3AYqrnVmXEtMNpfBSIz/WQQoLIkuza/fBkj6JAk\n63QkFNHb9WK4QAK9ETQ4f31XSJzGpFwteXWbbvPebTCTaz3mA/05jkhu+tS+\nTTFMmCMIdopkUq0ooD0n33f8xPNyOvd7tL9JnGtNqvCta2XjRVN7KvDX+P/i\nV3m89jnMqMDIMv0iWgJ0/s+TNuN4/LOtywMY9LyP9DKv7WzSohqzuggRAaQJ\ns5+ZH2bRVr2PZACAkijH534tWp4lzyPI+KjFv1QHxJ3Ulp7aa6EdQpRZ728t\nQoVOLeoi+Vm1rGHJJ5lu1RzQWQTjBsyUmERO7Q+z2TdtIqW1jZixtWABwIcI\n4MgOBBs1Gg1s4UGBU3CXDEhN+zOC0JgNQIEkrX0YUsq4Jj026faW2ahL69nf\naDrAveYnCwCxYiBHWFe5kppYmuLm7Oon93Vu09XDZ/JgUU2B1iPEe58ww/rW\nbncF\r\n=3sFu\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQD4zd4mftBcSiymGyiNK/tIXgOCD1LmtU/Z4h7i/0aTgwIgXNIdFNlCsiO1Bcd0h95uYzuR6mp+DFIF3hDO1aPuxoI="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.61_1576764086461_0.09245372278340702"},"_hasShrinkwrap":false},"0.3.62":{"name":"wgraphbasic","version":"0.3.62","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"6f02566a439893e224c1edd2696629e151550b3c","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.62","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-c9E+zsGaG/j8fJ+ixHPnPBBY6S1KbspO0U7AJTKnjgcJxUs4gFwmXZbyKa8oDk8UoKnfVp2tfGsUi1wpqDVguw==","shasum":"14d22eee70bc6b1d17d5f39d94d15b5f5e1bd3fb","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.62.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeA4ygCRA9TVsSAnZWagAAnP0P/RnOw3qt2vzGpAS6WZoG\nFcd6ZnOS6Ax1FOQkUydkXS2Ju4sAXV+wO9kc6DlQ4Eyt6BXuaVC0VUqvUmYG\nopb2ncFujvmfqBbF3BJhgXTTt8jMGBwMshDH5PZ75UR5hrtHSGpUkwl9ErrY\nCc3oS6fDERIrwWFdPU796+IQ/MhYUOHksIJwULT2iHuxhVbifaIcpcvAAoF0\nYwBuAH3DK0h4t+Lx2slphxOGmT9MX94Fu/icKZHtxbGsAyUrO6ui4J+qwrkm\nknSDmYtiUK4riM2JpIuCnu7sIgxbEAeDAY/yrzTf1/h5PlTwynUi4HPCt4y0\nInggvdYePfWY3q4L0Wc/sNhc9HYNSo7Ma80AEywTtBvjQYY0ubFF3uabu2ux\nXWxS4WG98gJ58kgn/EpugK7wpgNBX7YzOdEToqfH94Tywg5n5COGbAo7VoAm\nsHADcEZG9yWzcmnYXYZ5ZmbZmjRu95B2SEbrZmPc+VdsMguIxDzisLoNJNV2\nK4V0hxyosmKTq+IoEj8lo2R5jbWXUSCwz8/giYXI16h0k3c+/IsPjbeMx1ni\nYGhFxV7CwZrLY8s/VLrmftCwM9vmR/L91UbORlEsQrNB0Ipq0ERsxfoknb3s\non25OSYB310oywLgctj7kGHBxtwFhT5Z3p0AglnfJheEDK4i5tHe8RJtTPHP\n1Aua\r\n=kmwF\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCtaqpXy3E/S98iSQXwKwCTjINQcGDZO4a4D7LhHpGTcwIgWviEA1rTU8t7dQy9yDEK5dE9EOpl4rMyZTbR2ORf1gI="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.62_1577290912117_0.15721276657004757"},"_hasShrinkwrap":false},"0.3.63":{"name":"wgraphbasic","version":"0.3.63","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"aff1531175cf8f74021c118b4f836bd62ab5acba","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.63","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-/IuEV/2G0I0Hn7cB1JApTtBoNaOFqp+ftrYHhg2dBnHMP1/rbs37k87CeZ0jif4wmJXyn7zqaMSqi4hCroTQGg==","shasum":"94035f57dacfbc8af2d9d80a70df29f088e50018","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.63.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeA5vBCRA9TVsSAnZWagAAH2UP+QGlhOiCKx9fSbPp9WLa\nUHWfeP2/UqF7lftTG9oaVCkIWoQnAl/oq6b98V2HIwKH8P5FJ6MrFLpB42yc\nq+MAB0bkhBlvHQNReDQo6RZ9FRhAdUdb9oZqETLJ+oOSWzeV5uCovUfKVgfq\nvfdBKF9Rq3hBvvd+rYABucM4waZKQboy1h6BjA40nFoLr6rMuQO+4lumeYkY\nLaUEdtma/fT8HONHrRyYI13VQ6U6hpy7ensmg3uTdHdpgmgni/2+ncyOpRVa\nMqWbcfnDIBgVa9vf4d410zfapHKDsaPzih97sd4rd29JyoBcOYzYwibKa74C\nLtBvfja23I2Dq477w8PD+0nySxz6Jb2nDAqjAe4+Y4NfeSeMh8VJ9EmOY2nv\nHY9si1KUhgwZhMR+3s9zhT8vDYYkjM4cn3xKStXESMkpl6HO04oQhw7qu9WL\nLqjgIKbTX2pB2Lj28pw25ogvAQwJOKgf3jvAONaZ8fNxyru1Lcjwm8T7Bcl7\nRirh4KKfJHZWAH3R9rWnAFXQ9ExNAyXQENPVSkLni8FTWJHcXMiMS44a+jaW\n6mCDpbEC7VPUmiVQg5/oL0+D1wSxgKLLK6KkKXzPPcy03esLIjSgniuLzt6u\nFFUWSQAjmESBxUy5mAwYPItDOzC1TOq36tU2efTUGvYE/kk3VvCy3plL8dIc\nk9Fx\r\n=pRJI\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCDmy6h8jQ3Jp2J8nh4hVLqSzv01QtJkprYmMusiY9AMQIgTpVaziYAfVI+4IUgZxY5KOJfF571yumeSzyRhwdfES4="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.63_1577294784792_0.6986204204880209"},"_hasShrinkwrap":false},"0.3.64":{"name":"wgraphbasic","version":"0.3.64","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"3f6a3d6733b7257ff10ac8d4d5d98607c36929f3","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.64","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-vWg/9qrnX70+dacXtpKCbz7fyho4a2aV3sKCLeR6O37oCmPuqaiZsIC04D9sAKQ1hSzPFmkYbWxzES40dFuQyA==","shasum":"4dbe780c6617ed855a4b652d10bdd9d701915402","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.64.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeEeq8CRA9TVsSAnZWagAAoY4P+gOgRnrIi4Tvh+TsV5Fb\nDNGOCfj1EpbOJhk8e2cplcnUKi2cf1Hg9HeDPPxS+2OP3b0f0cU8lHBfd2TF\nhH0KZI1m8C7cHvlnG7Ps1xnHa1v40WzPic/O3l/0jKeLzwQCjfUjvXCLcZv9\nxuwGVjeA/yB1ykE+LUS0LVPF2f65Q5MJmZK49RD2jhxiffPDg9+BtnTHJT7n\nvEsI4AmcXD7py+erWoDY6I19gCfaYiRPQU8ubLK0E1J6JNHhhsXGRJ3P0Xqw\nk5KTH6eriBIREaM2krgIjzdRo9xktYEMBt76ja2g4flLIbke6oABV3eF29vX\n7KP548Ol75wXxbYgilIEurqkQI9gf0gneMu1V5Mzpr7Nv6kU+FGCICblMx1b\nXSBQJNGfzRzwreXT6VEg0J37Vqox7P/OHAGmPUX0jFjSk52tl9CfmGZhz1qM\nyPhUPwleif3FajZr7KerRcsJo/eDdokbmMh00JWr/EHGfw61FkbCDKO3eM+M\ny9LVxEMIpBfbyH7OV/3OLwBuiU4j3DWjauNwoa8u6AYrbQ8mK7vt8hlcQHWn\nPc99Mf5tZnFAPpXFHe7xlLvrJrmD+/HAkdkS9aJ2l1g0nYJyU0UXt8Qqz9QA\ni5OWgLWkJ15a7ABZ2QclFCZc38ogX91jNokcOMdKsdpetXCBOB63sx76u9wb\nS6Rl\r\n=rDiK\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIC/T6sdt3xG+AZ/asmIqERmc2nXQSU0V8S1ecXwFP2bdAiAFKSQIAhNAZMcuyY0G6N5A2OU8i5WEnKrihk7X4IPIdA=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.64_1578232508098_0.027094222989042738"},"_hasShrinkwrap":false},"0.3.65":{"name":"wgraphbasic","version":"0.3.65","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"befedaced71ad8d8a4eb6b3e1c664b188ece7507","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.65","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-2prq2hsBBZoU84ljHTFOLhtufMXPDaOVqUjLcrlCaXqfY8E+o6b4yOBzdQDVnLwR2G/BbfPK/zS/GZydxcQ9Bw==","shasum":"8db909af9fdd51133f691573825fe1be5410f030","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.65.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeHueQCRA9TVsSAnZWagAA6/MP/A10i/Fs9LQGaUI6oJXW\nDz3SSv8jwTvfBl8xzi+d/QEIbSmpkBQJlo8DH7g229JHEB6kpherx2Qh9FW4\nImXZ3jG7/yhU3e52LaQZaK3e8EoWqIqzGcEqvs+Nr8xMlq8AKM0bAcMK3exE\nBHksXNEbgSBOIX5fME77o5jr5U9nkS20i7WIAOsoUWiXd7QGHDmkqn90YcU2\nIfUTxOjzg2qCutYwvtji02w3HnWB2XKaKu7o8gzjrbrRSqz2FNkWZtOPjgta\nyyhWK6PaclJQO7bS5t28xhZuzVyFlnsogiJ/DzoBiWM3LsjML6KZSU1rLhJn\nlkNnTAqFc2zNlSDRySmYCnVWWOY7r1KM+LgmTWRZ87MydHnH+zz9Oxr9ctoi\nnuvlR6esCz74XBGR55hXm7TFO9TE0KKLS8a3bHdG+G7gWOD0ejG52/iRKNP5\nOe8SV5C7tLD7dQgTWMjqhWTfDCkQJWnUshE/nlWp+bxyorY5EaSjW6Q3Dzvq\nVtcLjWldfFkgddxxfQsrdxyh0mS0sLSomRCCZY9F/fQ0WXoe+naLGwYbqhCn\nrqq6aRdg2QppgR2mIxKmh/wDbHK0u20bIcemJSYg8yu8wnTlMkqi7fab+OaU\nSPocw2pPM/podww6yfo+Ay+bixT9wafmkT8yoMg1yY+rYtuXPkL3ad+n5s7v\nGU+X\r\n=vgYO\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIF1RQR08jKctpb7hSW3RERHvcxSIFbB/r6luOhDsRJ8sAiEAwwvDFEewwDUIB1g5RUhD4gVes0RHwu3sk7qpEqPOXIE="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.65_1579083663989_0.5332591758803642"},"_hasShrinkwrap":false},"0.3.66":{"name":"wgraphbasic","version":"0.3.66","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"4a9ab5a4861f37c160158dd9d0ae1eca28aa9306","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.66","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-uuDPlrEtD9/VMa38X5/DmlYnOpOrNS2VvUH3GtpcQm+RiCMUTM9qWFHysjSDcdqx4/UiowrbB4hOCmQKwkRSRA==","shasum":"0acffab3efcb23b11701c5705b807dc3539811f3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.66.tgz","fileCount":10,"unpackedSize":138046,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeIfkFCRA9TVsSAnZWagAA/xsP/3W9Q+5oqCMZl5EpeQBU\nuSsgnpw9J/FGeBnDviVerPkn0fqQH5yh1g4JhU2XpHU2aFRqNkVLH9dd3MCX\nkRzOcHJuULrjS2fQ8DHVhZLn7MgnW/nMEoOlryPtsQt2gD+1f1COSLwhng36\n70HT2W10t7M44pb71ljU9iFXD2hmjxIkVdul2iVz9Iw9PCw3VCjOw9J4b/+C\nIeT4Mf32jBEZaU7TRzd5V2joTuxFdVmv/0IQWtXzNcxeGQx1ULzgQdCVVMk7\nxal2VC49XP0tkmVpQ6fQp96OQWNwo+FFFUwUcQmfuUjW3LpqATn4XKCpTLBw\nz7/K5suOuk1Ev4oeG5dADpqFBNyyN+jjbl3NcXP092yX23R8nX7wc2N7NkQb\na0TmghU3KWgpYflaOrmKnXn45370NYvmObuh0MGpnpJMfHhJvD4G8KJFYxYn\niFrNd0xPctruVvB1RaGdNfuB+5XGI4L3NmaudEXMBgWjtBUgrx1/ZbC8XiJE\n+F8SelueRtuwQeTr/PO6WhSuBlHrvRJ1Nm0nky0REVlYm46GAMoc6TlCdrgb\nQpVoBG8uMhTUar/FhTD83qYiLsOouVh2YGttJ0LOBjsn+GWoqITcS2AZDiEC\nChwXt5bRb0JRVkZpZd2aa9HmJtklHOG+N7VNCgnb4kOCqYnFMhkqJnCmLVj3\n5oFk\r\n=lmg6\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQC+2TpuJKw2G7CWlJxuzSmb11CdnbKGFw1yTBM6jfUM3wIhAMKo4wOZBiM53UxCSEjC8wAtphgal01ycobqMpUh2+7Y"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.66_1579284740717_0.714761212009368"},"_hasShrinkwrap":false},"0.3.67":{"name":"wgraphbasic","version":"0.3.67","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"d2948dc87c1f17a8f2c2a613f8b163ebaad2299f","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.67","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-JPf5cjVXXHireEMV6otNRciPKdGAV4XBFoOhG51Cq+dQU3pujEShujVt+DH8yp+matDhoxsfm/QP/ThgMg1NfA==","shasum":"b154f77ef392e57fb88b869865aed6a599921418","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.67.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeJF4gCRA9TVsSAnZWagAABcsQAI4Z4l79h/X0VtQJy12e\nWKszILvFPxmM+NjGhPD/T2OGQh8NTJyGhV2QpLtEosAA8xPMCl/BDd06LWkB\n7zKGN/0pweTZAbGbSuDPWb4rbapG0nAFp2bR9js5BopoXZmYp4cakOzy5Ovi\n3236yiFhxt7fxF7z84Bh93SpRRIhFHygXrPcyWjEQd/nVOQ33dLyvJzKtiJj\nJUZ/bi6Ie9qr71N31+QgD1pY4jYkbYsADzZbWzhKpS39K2EK8AhdtlDJsyRf\nB/A2hq9K7a5HjICb6g4uqE9PQAzpVuZZ9Xlru60eZ5F/AJmhkDlsFslLKgWN\nYt4zasvJFg+CPCgYUBn0ol8pIKJmuNKLExt7qnClnBS9PMVIkrDALgNRUIKn\nbcQt7Lc41cQAk7Kx3FP/ZxPya7XPnTgmM4xF1hrAClNUT8OiZ/qRzM3nDD/K\nUY+Vy2so0TWTThcf9ek93cwK9oORN+WOm/oMKbASUlGOBFwilt762Mznll6R\nNj1im4L8mVxZfzxIR3JH/AFvsEiEMPzgQ1LEVJfDTvaooh2NcNogZvwfvYOG\nXxUnaRicXPeoJq4a9KiyiF4zYAmRo6OT/ol6TXrVIVx5KJ2rtIczfU0sOw7u\nQiX3dwKd0JpRxz4QhRAAhnNpeVp1zCa1kuE5px7gawjDjAzUNXYc2hIprOj7\nmbvK\r\n=ZA0d\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDwieNJaEAdyFjnztsk3XLTazOcVbMng5r9PaE79LO8ogIhAPkTELZ7P46dsVXJVRHq0fJqRmIfbfBQDXyw8gi6k7sa"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.67_1579441695813_0.09182426188000292"},"_hasShrinkwrap":false},"0.3.68":{"name":"wgraphbasic","version":"0.3.68","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/images/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"41cebb60acfa29febdbca274dc61c8660021983f","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.68","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-YWXIAqlAtyzAmeTNez25aXxttKQJ+TjptWL8tAi5HL5IVojoXtmogjeYC3Qk6YW23iQU5hdcFwzoo1Gpr1fegg==","shasum":"781027acf424f461d38e6d5146cd17fb8f49eab6","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.68.tgz","fileCount":10,"unpackedSize":138048,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeJGbJCRA9TVsSAnZWagAA83AQAKE1+50bPMcxwI2oIDEN\ne9IEjJfRvyJdhx8BiDoGQ4Maa8U64pNkz6PAh2LgoM8ADXEwwSZWTO9TKFdQ\n5Yz3YWU6mrweM7uBTl0dI+jpm8inJ8RzCj3qeWeQTqIlH1SjEFbncmmBUDNm\nrsKFkKPDEtnuOiJ5Hx5/Dv7BgkwDtzpUyRZESwdOTw7P4d46TuNZDkmfvKwe\nAhekI7hHQgiDl01cRf08pLNDqamADEOBw3hhX1141WN2G8PqWdZNe/VUrkit\ncEBeVyJGKFkWZQy3oNiJ8+4EExArru7naUydMdO7wAiAxWza/G8zoX0QmfSH\nZCgXhfWsSt3eoE61S7P2PW1YSrTOzYolCJUjwGPo42wjNoxCzYoEc6KTcRFT\n8I8jpl1CAX2PQtxqX4z/ctnN5Jsp9ooAq/DIRuhhwry1+9HwQxAZ2xXVaJ5s\nod0TlobsEz/jILW6i4+y5F4l1mXCsQn9JIWFlBnEs5Qbqw7JnpBrP+70LZBu\nSonepCf6xzIrcEiPkgH9OxrT0ENtxqD1/YMiyUP1mld/aJKt5vXgNiy39YgV\nr7aBB9KbDvBmv0MX/0MzXhbkq99QQ0gpIyU1TprXf5v9jYBBnoRX/pNwQwTf\nHcPWDB+2AVIfYXZhqbvlxjUIquPN9veQQhj00+tFUsL/UWw1ZUxkcfTPQ5je\nsngn\r\n=Gh2Q\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIAvwZO7YxfcDOISxU/oaPCj9zCOPUmLOezyI9LPdVTKMAiABarJFcwxBva4wyEV0ZUCO3Y7DL0hzYzFkxVHaoIuUaw=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.68_1579443912830_0.9666746314929866"},"_hasShrinkwrap":false},"0.3.69":{"name":"wgraphbasic","version":"0.3.69","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"1d9e422a4f437724c10ac08db9e7f9edbe2942a9","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.69","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-baAoovuxWc6NQ7N9GZuTlwzCWzAsnb8qpBNYS6sNQlHJXu92DVZMtrAhR/NB3j5SgVa3f7Si4uanwCInlgOuWw==","shasum":"528d1386a4018fe29ed5820ecfea3cb86899d3d4","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.69.tgz","fileCount":10,"unpackedSize":138197,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeOGnHCRA9TVsSAnZWagAAVEUP/1ECW7DnJpRcjo7kJohl\ndKVba/ceY6YMnWMH0zlrKZxvhp/2ZgpK62qzBBPbuTZtT8qvx3G84CXaO5Pa\nA0NgfA6+LQC4DK8abRuOiM91nKY1FX13SymXgpvjnEf1BNy3HGhFm7yNoJmq\n3B2cg4J3EkXRFfKV2uKE/w+4+5dNdnxA+T9z2q7Q7c0yiP3YdR8hMWs6GXFO\n0J7ykDlHpNKf4MJwqN30iWUs3UMsNhlaDV+rtJw66FZSX41jxF+TXpcuTUlv\nhmanWH4T2Z9zM+Acf0ZvkgcKGTnHoACnQiU0NPX72vfi98UvP4odyZtoTn4P\nsxi9vEvCDFgbnNHy+AbyXS6l18oqPyDKHFOBqIbZeHiQ9iU+orJulG/9T9PR\nk1QSF5MIYlAjboaDnoQe3t8Nk7mSwRBdwRT8ex8gzHbMhZF32nY3SntlPR8K\nqIBjfWHDyVxAvtpWVW4gXvgmP6Gd1HtdwevBSjyce1oMdSsAD4TVyIIBMII7\nTTPkVqRbEpnLngRM6KyxgYpsCnT4SmdhR+5b6M4hMXO0614wYSGnAKZJ6QLT\nCLkp35kCoBZzUSJkEKJ6A/wA+nxdLAEvM0yVHqGfBoODIxSm/lO7tjWScbj3\nz2v/pmKMrSTLoSUhqQ+HtgKawWBPC7F8lk+zgW614fKYywboteEmwcmelEnm\ncQtA\r\n=ugym\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDWF9tuUNCq2HoVKohkwm6Jur92S3oWOcfyKI6V46Ex3gIgPKhVTs+J3HkOdRSpMz8fdBj4LQV/ei+sa/iTLKVc8nY="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.69_1580755398987_0.6174928381455491"},"_hasShrinkwrap":false},"0.3.70":{"name":"wgraphbasic","version":"0.3.70","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"f86a22a99f1214d9f67a80bc4ac0862a1d5a829f","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.70","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-4SUlB/n2y6IIY8qbx6J81Uo4R40TUmS7qETx007klr7zY6cszZWdb3GImu3hPamlzhDqSqcYT77EiflSaHoHSQ==","shasum":"81e673dfa3b3ad3476d71b0738c630aaa74738b1","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.70.tgz","fileCount":10,"unpackedSize":138197,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeOHU2CRA9TVsSAnZWagAAEWMP/j+R9QNO6QzD8vCvSNxq\nvA/YYFwNs4yTTLqgXcvLuobodQ7AIPvulW+ZDDlU/XFgmYhmbvWDid13iWnq\no90pcTqAS4/wSbk4wEgMrHXgw9p0RWoFBwvTKqVdeu17tW6KsV7bfY2+yJQq\n+zG0K7rRtVYZFp6GnXbGa1qzc60plXWL1TzWV5JO9gzTnD2wg4Z5Phvx3zr4\nADpaJgxeCg+4w17NC++DHMCEJSsE5FS1ObKj/j/AuTeY47X0scrckqNxTIqX\nPgejHpr0InIVbNPmJBIz1TYGeDFTN/LSleJxzYhQbuGDcnONUcdqMcPXi2wr\nGUz5RWfEbrkWtqTz37QVDuYngdI/RpkUn66lBU/aaW9mPxOHPRZ1Vn5LmxR7\ngiELl1+yBRfvHHpF8MTmZIfoode6ujMPcSVUw9XLCecbjWX9pOhyEcgVN5QM\nG7F2IGJZjGsoBZDgryouGx00QVndfnMOurfRFEjjRMaymuKQ0hqH9HDVHamz\nowgTxuUKaGkXbAGAN9hnipzvm2roLTmMKaF2HEeOVm7MFrFq3KoCamCbOEbN\n4o0whBAH2oWtqa9T+5Gi87OpymKAeoFss3B5ehldXFvbtHm7zYifZdBN0KtD\nrwlOGMTtHN/cBAXzTMCArHEoqegTLgBDjjyYZc3VhuzwwAmkEUVu2aZkQ7QF\n2vYW\r\n=TAjP\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBEZolRTrOurDUHSXvSxBqdwAgBnqZ6dNTpIYwcvQLN6AiBbT3KqlZ1ADpPrzTBBPxJLdJu1P/tpxFbtQlqYcISIgg=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.70_1580758326288_0.5110378330318621"},"_hasShrinkwrap":false},"0.3.71":{"name":"wgraphbasic","version":"0.3.71","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"506477f487f51ee8236e60da6c7755551804566f","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.71","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-di0P8TGVNF6IHCKYwq8e8w0LlyzObX+shxZ2B7lwkBRUbxsCPYBW5BPm3neTsjOqkGKx2ZmFue9w+4saMjMdmA==","shasum":"4e438049bbc14be0613509db47ecdd70a08c8f34","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.71.tgz","fileCount":10,"unpackedSize":138197,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeOH9fCRA9TVsSAnZWagAABBgP/3/A6s7552sFIkLfSXfF\nxc8P0JH/ZxXR1Eqfzkg8znZoGF/mwalKruKomby/+jWK9VsL5WZu4osGVplx\n1M5CKftJO8iSOPnTE3CZjaxzkvga9DJt7q07NO15pLFGorEmw1+7RRxdicRN\nCRcFv2b5KNTZqB3SJ72tP3/l4e0c0WCxsVNsx2tQwct7F344iVAskpBtdwL5\nb4LzjdBAgFNiptkgQ0tQtZ6X1hAI4+6TowLHgsI1pDU5apEF5iNAZOruh41H\nUlsZeONBgz6ND924CYxKdaxEYVKlra2XS+vxtZZfIcN21BuiwwGFMiWjND36\nKcgKKllujPXNlI1glU00vFKoulhPq3W6Cw1blK1OZYosbUU/cHnCtTX1jSR+\nasJFViuf0S+vLHtyWCxt7VDdWSiZCVp3zTxKUchTfsPBNpYOL1R0JgsZTn5/\nFv1U7tI9wuD8G3umGnlUa7KSpNJrZIx7kcyzHDErcjVFUsSomzeUT8E3xiiU\nkKBkowgJW8PM4paMkyREMDqipmy42rNxlbGnniGPiSpt8CNCMkEWR61xYDSM\neltrYknp3bp/VO1GtHgzAI+1q73FaL0V5C08R2XQR/TZ/0FoiVrATP1Sm8ti\n4H3wUmtSclpKaIKcPjbpNrMDFpNZtKCVqycutJlo4ES/rJtGHkurQbcUdJJV\n58Gs\r\n=yJnw\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIGc8RwcIjrEzu9zyadTnUvs/5tdhQP6Rar7SRZjJeo2CAiEA2XzQ564KBrGFXy1DE5Euz/BWxm2sRZU+jyV07Sfo8TU="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.71_1580760927499_0.27894171164379156"},"_hasShrinkwrap":false},"0.3.72":{"name":"wgraphbasic","version":"0.3.72","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"c2beb24987c0df81c1a55d35ff76110f6d319c3b","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.72","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-PxXwFFdnW0WKq+vb1VqN2ouf+ksNR+0+/F0nKkkeDBmpuot+tRHZn6S7Ps+1yqGoyNgY8JoluuF92VlvALjOQw==","shasum":"325b0320cfafa5009fae87b1c06fda834b9f0f72","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.72.tgz","fileCount":10,"unpackedSize":138197,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeORZpCRA9TVsSAnZWagAAAGsP/jYvkhyml4O/QKT+kzcO\nrbRQih4LhOccrmBlMJaR6GAblauhT6XohMLeHXrxHxtJHCcPfI5tStahxGBL\nevHKANoZWQLi4J68BwuDdfJBPVuXz5oRrZ760JAUgM100QgEO1ruwXkNqrPS\nt7ncM2o7YO1IzRMhMY91VXcjgPQHBStubuUS3svY4Ta1KfUX9NPSbkYgouyn\naeKXwb8pnAmVPAX4vvlFN6ReYyZdZpCfp7K4WJUGAPQimbFaWbqcqZM49IdK\n026xZ0S9UzzQfbRitb0Hu2d8XZxuwZRdGEaDETpNYipFcuk111+aw5Q6hA4d\nn4C9TC/kznkImRmiXhSXQ/KK/5bmhX7etH0p+RZXYCNmExGe4pJwQ1UC2+We\n7pLTSHz2dArDMyJr1GzJGbVvgqB/svDWTn9DEI2jyOf1/brYitqa2/gzRWqb\nwuxGRraZEvHyRuEgDDGEZUnLuCU/8CmoyKseZtjdPbUtalBsu7e6wAq67wcG\ng+DQsSjGxWGmMPGK724zj1EiWd5SVWifqTymge5XjpTW+3LN27fqkNCb9YIF\nDEVH8q03Cb4FtT9AM3kfdIrOeQQrGGIh4Nb0QHG683vEG5mZqtkiqc6gVDMx\nop0gT2qMhwalA5/0doC/wvKgqOjU/xc53td4QFnAe1EHh95Q1GKw+nmQgCjC\nI6Dv\r\n=2bUm\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCVUbfChzA4+15VUFkM9DW7rjfuzTMP91QvIqdp+WnDbwIhAPMVZBMh2ac264XJVPHH44uw5f1VNfDuHsIdLnsnSrAK"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.72_1580799592695_0.9051994168759021"},"_hasShrinkwrap":false},"0.3.73":{"name":"wgraphbasic","version":"0.3.73","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"185894f15966b08870b13f0e02ace23665af2c7a","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.73","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-9t7s3kDnZ3WqlTf61KL4fxFBWZvqEfldz6UdyJk0fpxgTjuaeLIfG04v2Opg7Rqu9G/8HsTWWvckkKJSNlEY/Q==","shasum":"e05f8000eef390236745eea636b212caa5524645","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.73.tgz","fileCount":10,"unpackedSize":138197,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJePFcRCRA9TVsSAnZWagAAr1QP/i7T1JD/d9UFWfgKD7Vq\nJhOplmeH1p9KhUQvBPi2+imAo+w3LmetVbBi6636ZtQF5EiigC8B4zh6iMi2\nJ2gf+skclTMHF0NbjV7ef7u1RaCUxHQBUzfrtTQne1q0n8DjcMnMKqTCWiAD\nV+Dn4DxasZ3I6Z8RfpwRBLvEdc9OgaWkINUjGqXMtDc0DaVm5Mg7FCpnmThx\nEZEjowCLoKtBSMyWSm8KNATOKh/40g1iGElaA+NxHcErIn/QUp1ghBVGR1Ug\nELG23etlOXOLZ2oMBtmhE1zVAzGGTkT+Pde8lukTyOa3NCAEtCkPGAXkv4WH\npc+n1buX/Zihf26EmzeQkFPbJs7fF1f+kfQGbN2w+JmSuUjvIQhdA1SFUZM3\ntRG2fzRf/0J+GOrtD8iELAOPqHow6d6828gUJRmkjcV82bX4UNwMlhn/ombY\n4105U3WPPcY3FHRovziXCbPaN2byp7UxMKLAHc4kRUsPGgmRxtBNAjva6bjY\nuY9JGCmzPkxGrBLWU3MtnLixs7OggiGoYHNtH4mBss/fJFCfwreUZHQ7Cy/H\nRhoHl6vDJeqpiMmXlJCOxnFOzG4RDkjImMeyefnexUpgoKR4qq9pvyB5RJtk\nLp3PfsDQPyXjsZEHDF7G1XsLYm7iVK6vlb3RdHev7NIS7SdbmQ9NwOHG8jE1\nh+7d\r\n=X2HZ\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIF+/tbM1TU3zFireq3htzMqt1iuJP4XBBBE8Ojv5SXODAiBwXZlWn9jMi0mZtFMC45XdtXFdhjbnsIHho0B0GkOeUQ=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.73_1581012753548_0.9188289749462166"},"_hasShrinkwrap":false},"0.3.74":{"name":"wgraphbasic","version":"0.3.74","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"84f8c093708ceca70294bb022b0838c491d50054","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.74","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-CYEqtfNZnd8Kz/u/OZbJPjLnaoe3vrqCJYiYpTewPsd7doV7P/+cOkD8T620/c9rQeskivf0xquyuD42RTmVbQ==","shasum":"8d66a1e1509ba4c103b5a3dd9743a2b9a9a57218","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.74.tgz","fileCount":10,"unpackedSize":138197,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJePWvbCRA9TVsSAnZWagAAkw8P/i6WPual8KWkEFan9j2t\n0v6UvdK3X7oj9jT3lZt9D3AkK+Vfth5aoWTep3RP3Rsv1SS63Q1yjSvayK6h\nkKwW0LVQ6+OuzZmD8rluI19tYhFhmRx7L8MfiDEtF6EbnB4UVu15D6EpYNFX\nT/moCeOOqJ0dXRINXtx19YNX+dx9SvsJ8Q5h0nQv0sElya6rhWwT/oQjuIqh\nroAi1C/qVccwKcRTEiLvJpsgPiPM0ZOGSrnLwDQhT5GBeX4v/fzBtvqvJMYB\nLVQrM+SsTOnSNKo92Kz4ssAcwhkGkH5HIOFMd5ft1MlML+t70Mdv/j4E307Z\nnnYW0TQLqmIi+Gir8nK7Ga2HACLpw2SJM31Of7T+ZGsJuUFWlpSReakORL44\nvYnzfXyVei3LX2b9SoUx3vrviMIBk15mvYcIxN2LA++yIm5D7l8JSlkLXKdM\nZKfLznj7dJPjyeidVb+Jcqh+To/YSzsjbsoh7G07hShqGGGAwVYeV7MoCGlw\nuQGKE7v7xNxQfCi0iKHz0RUf+H8BR5mcXqosPA1gdixWpzF10KNKPWIhPZHc\n6RCpdF7XCEQJThpIUIYNpYlmIvX2S+UpkoKnnLotWtzULYbLhYeklpGviezj\nstddDAyY0GSHCBp+mZjv3/wbBiCb7JCPNhSXYfnnY4YoHf2xH0NOOFFDPW/p\nO6ZG\r\n=MnJB\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIAolzw0CDzG5+lxobqP/m7BEVxhcYNrU/rqtjpLOf5l2AiEAy6WioIaKe+iJ8W69ARmxJvUCMI6Bf5AkazL9sHOU1uY="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.74_1581083611334_0.29785942902335916"},"_hasShrinkwrap":false},"0.3.75":{"name":"wgraphbasic","version":"0.3.75","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"f0eee81f773e8cb038494750573053222a32b595","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.75","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-zAyJx9/r0H5IOErDXCNrLT1Ii5/y+hMYISsy4eKkXHXRflTcyn7Xt26amosqhvC51ih1VK/QbYzxRWMUHpoeSQ==","shasum":"15ef27b7c1078218d8d8bfd96fe0274ef9351caa","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.75.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeQpgbCRA9TVsSAnZWagAAGhAP/2hIkh7Sd++7dAZVd4bE\nuofqB51J2PzighwVavIpLHBYjwnxzc6g8egEAo5t03qiqFMOPgMfKPnvoLVq\nSsForW0MtCOUEag7wt1gec8MpBoUsOPCeomCzeB8LNILnOIMQZmuYRF2Pae+\nK0GpIjPZGaTbwp6a9BQkK8FD7o27aOgOLaM1bVSoxUZwnhsT5ItDUQhht212\nEGzuOBKZ9/s4/DNWgIVWRHm7veW5gLTV/dKCmoQbxN/OMvDCfDM9EPqRBsVy\n0SklfV0dn5Mih+uvn5MRXmGVPGtsoRQ8coQGwIYOXT9XU2wL/YdyvBRmWqHF\nMR1jzl86XGNvOTnZ3dG6vclGaQYXCjnvKxR/oYQmONjuV7YVZ+njTPyEuHiq\nVwO3deEFiZWXT7c2LkK8wDaEEieFyi4Jy5kt6QAW9skiT1DNfH+gmGll7jB6\n0jY7Dao2dm3DRpE1QHSW5MGOpRJH3oIFdoUCbZk/Wwq2XK/V2NlqZUpjjRNN\ns4gAqdgc8lYqT1qJjiq4pxUlC958bWNX/j3oEW9PaLId0afh/Cr2iJQPisbj\nvUJATAzTTX6znoyVIeHBibGZpjXhb9pTjNJ9J4Ae4AG94h4G21l2zJoe/Bb8\njeIssGKPxqksiQaI4aLwr3OH4ZpFnKmLexGFD/9SLTs5T/pfr4YFQohEKIV9\nKm9I\r\n=Rb5w\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIFWjnHxqwKtBLSqSkTT5UhkUch5O6unPAyDKSzbDsv3UAiEAkW+aq0CXeHYf2cuffLdi6DMOhWraV17ipfM7KpKHvL8="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.75_1581422619224_0.012111667017493666"},"_hasShrinkwrap":false},"0.3.76":{"name":"wgraphbasic","version":"0.3.76","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"96803cd952a54deff67cbdc78747d67490f705c1","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.76","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-poZrhqxfjA2pOKP+SzV83taN2yeXVdVResito4cy7MV5ZLhOQF3tFK3NY64vx84CYZHO50joumWHnNz1dryt0w==","shasum":"027ecf11bbd894193288c83ddf518cc3e4ff54d3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.76.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeQrWdCRA9TVsSAnZWagAAC6MP/RoiNRxU56Fqnsz9OmD+\nZdQCIfzA4HCLvsbR7BNdfgcWRETXWhmdJrDaBxkSIuvVxYBTJmWz8XS10q8K\nwVQgTF0/9i3Pu+mR89vopOidRjMgrNigrFF5eO1gTb5Rfp2kr95kgvpDBF0N\n23YUFw0wFaxvvmINZP1D4dqzTZTFKBSF5FYSze2CeAqwFd9Q19/ohNZ8GLBl\nVm/IW+muzlEaorrj7qoZg3UHJ1gke3uheTHWQN2edPpzJ4NHqwXBM3jkA0pG\nOxrjLo07tT3JWu01s7UcBLrA+VKzaJJrcGV6yG6DR5+/AskcglKDi0fA4XCM\n+4JN62/lxBl32mFIeXu/DbcD0nOk3dLSqC7qynMBga1Trz6gAb/jLYd8+6PX\nFTPosXMTKflrovg+nvDYIM4rjZT7foEZwSvbZv58jc/KSB/Wj7W7XhIuG98T\nXo2Y5E6545BdEm01/oeJg4zRQqpfYQ0EveYLmvBg8W6HlouGbV2JCrI1BAF9\nbH/MUAwuhNs1NHPx26wNaAfcobiTXJNpEPbqz79TpTzylhZH0tiavPMiXRQM\nhpnqPvghbLg32oQT2+EpD/UQWd3uso+bpNzud5zxGxi+dirtKJu1LTKtU10G\nAOX6Qsn+0VWbyXoUM+gnOh1FkaQ66O2z+rSeLkKMGY4w93Gn3x1t8lnTYQMw\nvEB9\r\n=1Sx0\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC+sWIy5dDedy8Y90klyWEY7HS3s25wKxzvBMxKYAcMTgIgRN2Pch/lEA6BKmGs8nnW+dsMS3VDfgmEJ82GZjopFtU="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.76_1581430173421_0.19360805737946007"},"_hasShrinkwrap":false},"0.3.77":{"name":"wgraphbasic","version":"0.3.77","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"5134648450bc295ca5490cae68eaf9079771db25","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.77","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-Zbchrs0//+wjMVKTlueUp/jcepSuSMw2ui3bmZPqTwfal0w+q9SmY0QeIEkydOkuoQOVS7OiFLuZtXuX5pSwug==","shasum":"b9efc2d97230dc24e702a6d5b61b9e294a469e9e","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.77.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeQsLLCRA9TVsSAnZWagAAO6UQAIXbO1ol+DeMpXGEiUyM\ndomX4m+uD6dm+0hgNl11lvBwryqbzRus4xHiKG/Ir0YMHs+rIsqonV5+e/VY\nRv+k7tg+AGbi4imleaUQw4L8e95Rilq6Ghb7CJ1CmpwWk/PqOdag4t9Z6eet\nXOIt2fiW0joopV0mdj6+YbMO5DJ2VtZUutIIKLi3Xomi3v3almuGgfhY4qIj\nPiP7hz/YVh04ttBNEgdPk7UB0D+4n6R5Y3fwzBrT5EGobMDTMcB8XP3r7+Ps\n1ipHcaVI1kPLKa5L9vbxES43r/20hpQQkqX2iqfsesXQEC384mZ14fAO/jVN\ntyfs9Nd6o9V06JIkf9/mQOSXN4TtVvzCXsjgnOB/x/rAknR69W4M0xh4uF7z\nDQauoc/QSYIJb9hSuYF764Uyy1v276Jds8K7JNZBW0mhpTQXcZVJk3eRfcOI\nfHpdnZiYnfZEpI7uj6QrHU0nrkfHl6GESJwUyRQ1i6PA4lDoCAEESdNc/Nfc\n2ywh6K+IVi7sYjvpZ0cI3f4qjF8FcnzBo+fAUCvAURbCYus6kjFY2v56Nw7L\npVHY8jF13tqvoW1g/dU0U9X/1hW8YTvNuHUkECacJYaobSJcq8xkNRpAWcfp\nAWpL4nyMweJqd/HQvcfdoNfV4U4Gb3M3ppJCNT1N6LYbgwE+/0S0WNOvfjpE\nXH24\r\n=E5Xl\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDIEuiryY0BwG9I9PIkCgMkcTp139Cg3L4NNi0GoFIREQIgfKkIedjYGOj8w/591pyDWnXWDSQJNXD0zmp6JoQZGJ8="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.77_1581433546890_0.5713665881206222"},"_hasShrinkwrap":false},"0.3.78":{"name":"wgraphbasic","version":"0.3.78","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"f6151fcabe667b92847269ebe2aa6305cb18be20","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.78","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-z20CxfP8/n93OTqsLE73eV2QOHcOqcqnu7LvEIzysTmy5tttCTnVIEfufwAJgPq0/yjx0Zs42QGY2lvjSFd5CQ==","shasum":"cdef4a4931e02d9d04ab2b26174abac8f9db5f10","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.78.tgz","fileCount":10,"unpackedSize":138196,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeQtzRCRA9TVsSAnZWagAA/IIP/j5hR48754OawpXKFFal\nJbCS4l9yTBMfM92qGBYh1xIE/NbUYjbv0W/uHsld480kNNPH7CRQZHh++jQn\nrV8zyWbYkAYhHQyDU/I0KNr02l0g8KYP1r//ZKACg5rjzy6E2uNvEPbbvXHi\ntkgg2BKyaEZgw7UDtdHA6FnYWfENQtEKPYzOLLdCtAS2O3kIjt20u+s0aiBd\nYAOivGDO5BbAfn4bHxZoXlcow8h0kWXx83gDdnU/vJ3Wc9TckL68Zx77Ijj0\nd+ACvOTu1OipLChvpRgtQPpcoNeqdlT9+suL/uwWHozaZo/z8Vqrr44V4D/5\nLBNi4FYOk4FGxgKshvMihnA06fbPnMfKZqoTYY7mz3LUhrjgmwTcCA/6Tt1D\nG6lF7a3r//8S3IXaG2uapTGx3DEjw3Qpc5yeFALB4WW2KZ3IOjcyFCg8PBWm\n8NWEfmNoCzt+MT7ZqxRlac7kPN2oLPJywZzr2by8shqdP5g9Jv3hkwqXYd4j\npsLn8/+9aCAa/FNq9BGS90N24vy/sW4lgrYUqIQmqJ5LXV5zUvn6m3F5srxZ\nfiX8v630NphoTFkDuV7ScRlton+YD6ohU3nAh7cwI6/tb/nGaZc01kf82Ag5\nHpx+XduJl52nVjJsr80ujz4j20NrbZNxZ08EMVNUJWsstF+tgcoKQ8yuni33\ny38e\r\n=VQxi\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDKPiqZtWLWIMaqTRQlvZHNL+uhqjRxFauSn2f3PPI0aAIhAKR3yrxLlNYiJwutCqnM6yeDmMA2aNMNm0VPlnoiHLOr"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.78_1581440208896_0.6560473523761803"},"_hasShrinkwrap":false},"0.3.79":{"name":"wgraphbasic","version":"0.3.79","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"d693726f1ac565ec2a551e44fed9601885a86302","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.79","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-iL2YjMjTCfaCPRuJlRFV5tzcob9mgfJrIsQdhsZDE4bWu+BlFye8aJYXPIfT7JmMm47MiWbgnuy7ac9Pv9u+MQ==","shasum":"4b423910e9e5a51085a8e8471301c188c2a3d41d","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.79.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeQvnnCRA9TVsSAnZWagAAhukP/i/s4NuHCBhw8eqP5E+o\nQhorSjNfBBOpwLKUUho/p6u8dNfKGjGZYisCcqTIS2r8hbDGchgXeOwJDGuo\nBSnwwVTc3ClBFXhtSrN3snryIeKPMcXXZnonKWgZX7Ycn/vhR1DbbSkF+4si\nmBqhQfYQgy/ywqqu8zm2JgrP12Wz+0wUGQ40z6fnYTgP8YstMe/G8ZZFVTIV\n//swcINmtIm5Fauzjk8AI3YYkSyjD7HPX8qVSpxIggnJW0s2Q6pk+tuAxa43\nyA0/fZ63OLy9GfSbLjCLvEO+qpha/+niv8F1JkJAHgZ0YS5d36ht9dWRR00q\nLk4n/B99Fy4ZI7tejQbWX9YfOsBH+POlpUSHwJLPRDCGa8q/7Nl4iP65elAp\nSLi7ti56/Ssi/qYyxF5nicBPTdFriT7jCvviPORzJT+wCb0QrExYafcCliPy\nTgyYchejvJKJ2vr/9QCxB/Q+928SphQADfWy8fufYq9QFopHUhCzJR89Llve\nrHdmidnRCvjTqwmHrJ3FLPib8DGQ3EPp0tTvrzccv9jOlpj8glQ5fvEqp85X\n4E9CUqGUBfoTVCgUykH7mvJdNnd6xkNG2xK1LG9cPW0PInTqc4ZrOO1kJmk0\nAvtdMo4sLifJR8aE+2nnP9nlGvUtWnlh7iY5R/xJWW6Ny+oXMMA31KqcWIAB\nscBw\r\n=KDml\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICwOiInuPS9oTSrXf6sLfmzHiDhDicjTRWvJZqkOzj4qAiEAs3Q1aaoHTeGn/NxXgau01HOncvt9/SVYgF2YcVZZhEM="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.79_1581447654791_0.7234647127482623"},"_hasShrinkwrap":false},"0.3.80":{"name":"wgraphbasic","version":"0.3.80","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"b40c45e869524d60155f337ef4cf86645eb8b6c9","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.80","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-p+dRPtxP6Ge2tgXIuRFyDy+p7MYyKP8tCWxOZh6MjNbquv9IOU3ExDZkahvg32CBKFvcX6rKS+JrgP0qRYQ3Sw==","shasum":"df17768a81da446cc7c482133e0c796c0eb86e35","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.80.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeSl9JCRA9TVsSAnZWagAAX6wQAIR2wfiNgBsP41x3LBVu\nEs+JdxZ2Fs5Gr6Gshk0A6mqYJsZwIv0ZF7S71jGR4BzpKq8jRGoQBZ+Nf1x7\nEECNuAc10DdvS3rD4IhaklbBsFku8Q5Lbqip7QZwJldDYjbApLDZDN8Grgh8\nkZ9lUw8jhkSZPg3hCrTRypL3drlvBk1lyxAyGNYD1MceRdFcimOqKzqcRizj\nreqREm5hl/Dm1s4hGx8qDQgog2ghDYGH21pL83fnRngJJnI2qM13MJa/bqks\n2q+Ie2oBIMwGGzGd9KzMyYe7MOtofBC5gIuUBvc71NCWxu8S73fcujGPwcGA\nUrXh0l/rQKhlKbiW3Mq61lLiQlZhi7Ub2WzX+GxqBRxNPzCHy6B7ZDaI12OI\nuloFR0kkxGaaD5eQGTtFCmfJ3uFvDFypCjCBJ6lXe1nABJQltXvoZIbN5Me2\nh97ef+UgQJoTi4L93TBbPcnONNVLrT4tNMubXgx7AKGnaM69sU/gOrkt9nlm\nJ33LQpNvJlYzndzqAoU/h91ps8bw91ATWPYylLXH5BvmUlIU8s04uNjejCaJ\nUsFMIqjAc25zXkXMkXin/hqbPZosDU1gqkA9Y530s0BfohRsFiCmUh+fdU+I\nccxyeCwrg8MG6XUQ+yt0RAc1xfY8BDBkMASDVCiduzLS8R8GQ3ZSUs4/ccVQ\nAMCn\r\n=BL3Z\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEe+WNtGEnW+nx6PfoNW0Q6Rv1hrmf0vmw/5OiqaH8R0AiAvZ2zTkbVj2p5ei3/DLNEjaRLZoLR+E/pxrtX3ic7V5g=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.80_1581932361325_0.7314682065691467"},"_hasShrinkwrap":false},"0.3.81":{"name":"wgraphbasic","version":"0.3.81","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"5edc2b65ba22ee5bd340a2629e6be9365d75a106","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.81","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-0P1q2kwOkPCpio93yrGX9ieJDyuiyXtyTZoaZ2R31dTJdrRrEzjVsalql8gaWdu3hZkzbqbvHFf0XTdUDXbKQQ==","shasum":"9e5e296b82e85f5ea4cf4a01b49594c0304593ab","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.81.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeSsxWCRA9TVsSAnZWagAAk90QAIBpC1bi/EpoQUwpsXHg\nRx+zJUF3WXxayMrARe0m2QT+6FKOEugbXJDP4xmoparEkRfl9cz+Iak/cgKY\nqDtphqhkGve8Wo/GipGcbOapW1M7pD538NQzupECGfg1TtOwS3PGJKKWIf8I\nRgmoAr09F3AHaix5/olt0U/BpsVy6IDzo2wqJeGJAxd1qiI+pRLG1aHxxWuT\nzuGsFjLSxtETSJSjE0BGeqM4u+aXYxyzetOrrJJjpZyv9EeP4Zfk8zhUh3es\nLo2YmWGQA8JdtiDUIcHnyHaliEGalXSHMZSw3ZjzDTei6DtXxxkvuyHA0DV/\nSMH6GH1g/YL6DabSX/Jbnf17rwymva5l+AURpArKiARpTUHPWXnKlhR8PQbN\nhsQqcNyuTNoQOt2EckO3ZXS4G5ozzP+tF4NlaDRqckU1IhNNYZXjYdOB1ONL\nVMQrn1IyHseAL8wKxY3hupWsawXF8Tumx7Y7KUK+xNDcdYsdhm0PIqSLwgYV\nHn8LaYM80g/XlLZJdjS458EhGe05FedX+q6XuzGZ5GV0nQLR6Dzunxr499HE\nlQYadKZ5I2yLd9I0Tt6qJ/0vTVsGgNbYLJN3UTkX9rxH4Xq1/B9MaHQiCH1Y\nwV4VB8HjFNcJui/TvHpxPjyXMORDb1fcOwvziZz6ISW5UTzplcxfGKb4xJfY\ncvY+\r\n=9+wv\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCd4V9nCSKGKznlIppOTtMu05MUzX67zcpkMyjg065EsQIhAPGNHK9p/9nZA4SSI5lvMjIkdkvy+mcMgrEb2LjDHiE+"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.81_1581960277533_0.8924548150151974"},"_hasShrinkwrap":false},"0.3.82":{"name":"wgraphbasic","version":"0.3.82","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"bd1c7d89d8b495848c13ae979ead877afb67f728","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.82","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-XMttT1US+H3YAnUP6GUBJL6y09SfRod7q/1k27rQz+UBfwwO+dpT6KMymGizP/PiLYBs1yLGCtvBffdY7LZZeQ==","shasum":"afbd2c5d2f1895c48f492936e0b79d6f5956015b","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.82.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeStlHCRA9TVsSAnZWagAA4I4QAI8eGkJDMjT4uBS+aupn\nO++Um3Ht/K7lB8YCZ1qQUKadQq1DIwARgT1keeufM8rlw+t0NmanzYS2XVgD\nVEvm8fzWJOOY8TN7xazNzdZJv1XfNlctVW89IQzQMPFZwiuu37/jRHZu91gC\nJOj9upqvF9glhJ41CQ56qCWZBnFmH4gkwP3px9HVnuEu4bGARSW9jMa8If5d\niNDq9mD1m273Nm5kK9GN4AjtTmoWc9cUoXHi5LmfcpxE9H3qPZ/PSgldzxcI\n6kXO6XpuMDiTEwQLvvY8XCe0QrPm5zkaf59bOyYwPBdvucaY85SIesI813Jb\nlD2TqZvmPJLTNCZENcNCzRTrZpmU8rFAldB1q0xCVUwq1YzPjMmaFNgIX2h7\nqrKby4sk2C6kVev1a09/rbFLtuacrirhFOK9vvKCzP2HU25uVee3LO/elM5Q\nWFbSH0JExuK69uGjlIoOhn50ZEvvIHPqG5PgLHX8+ovknXKrYcTOqRuEhos0\nODfkvfbV0vxn+JuFSALz91K/+vFUgFzVi7OwZtIyao89tLytOCKYJF1j5rYZ\nQhLZJyApOLIyb5xXXFwzzN7D1PmCixa7iCXOL1J/mpgdaK79wrwcPtPSqhUA\n0YJkaXipe9Qsz3nt7lOfyHQGQTdS1txxbxc3y3h1PFn2S4U3pAUinKcIiZQD\nP3lV\r\n=2JLk\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQD2C2WMia6eWkGot3/6CpTN9W29IHE9NDDe/YHo7wnTygIgarmixJp1BD406WC32az98Eb20Sx53JJEGe9pIkt+K6A="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.82_1581963590686_0.16997198440346883"},"_hasShrinkwrap":false},"0.3.83":{"name":"wgraphbasic","version":"0.3.83","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"2d56ebdb1eb6969e117c5a524f092ff811b1284e","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.83","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-acDMCMrTlCEyKBzl84HoDUg3YYaIvm2hqHCBvBdQB1XO99zCfy7CVl15vJ1sn4cnP/Z7MnC1u8FrR8KYYd/ZSw==","shasum":"2aa53a8ae145a2acb2fc96a560686a05b2f83ddc","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.83.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeS4pdCRA9TVsSAnZWagAA5MQQAIUnDGZbTHF7PMeL/2gO\nbJvybd0oPLEyOkG5sBmrtvOyfJ5yRVi84thjG3iYcYkvowU+PWFuCoTDrmve\nIH/F0XwWpkHct/WRiU0b0kEKiwqtqcF2JBdHKf18GsvF63sUQPr+qjWupMtD\noxmrNhpDtF424kqOY121mog9PghxNlW0/9CR+2CoVf8m6Mq3YPshowG53/Sr\ny5xEusMz4QWcluhATa/w/amYZawmfcTCF/t03uUHtv1kVjqUBFFtEN9IeOBt\n7hkp9ZHk0RXgoz3C7myMSiTwmnRUXBBrCLfB6HKKBRXnTmzqHW9dmHVKhHbz\nSNGrdlX6POKR87p//hPm7wSHKQo/mL4vhEs5I8nyQ//bp/GBpW+bNzEptBBe\nj5yrTEhqeCa+QkNw/xod+xGk2Hjk5EjNyjrvt/WmoRlKYg5zqT44AXtxbXZy\nxS6kN7IIoG3dj98pMdMh/8tCRly6QJWTVir9S6Gus787BUVAZG5fEhXrA11L\no2NzEjfMYbWDJpOv9xP5q25YpgJKe6yO488AWIyMcqrN6n4lHc4Cc7oK5B6z\n3pBgk4eKzq7TQTmmK88Da4akoIMl12QZvSjCafjC0nR4xVOn1f4J2VM9I+8o\nd/yy/gbAlgdmkncrrasqr4Dz241Lp2sHYDSJSRqtsRSqH02ZV8QrEkF4AV8o\nvq+x\r\n=AEeu\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIFmu/VJmEaaNimPSa6BDYOQKg2DQH0zv6O4f2BxRDjnYAiEA575NuBc0Uw4/iAKXwgCh1ZOkgLzmiXcqOoAZe/Pglns="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.83_1582008924585_0.3367859346037607"},"_hasShrinkwrap":false},"0.3.84":{"name":"wgraphbasic","version":"0.3.84","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"566e1e76ea4e01f187ccb0a120193e438fdf2419","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.84","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-O/+06TyeW49s7jGn9QVZksfBDgreH7k6V058K56b1xOTyfDR4WvA23x/+5v8swY0v4sjL3u1K4cOxGjK641ccA==","shasum":"de80ab90c323e341a190911b31c58003cb1c144a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.84.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeTr7KCRA9TVsSAnZWagAAP+QP+wWqH12Csx1rdIe9wvdX\nZjLYhb62DtAbdfW41SMiRirKQ1sn9V14qUrwQT0Wug9lIjzt6myW/mc1QnS+\nMGjrU9ndUSwailjtB1wfsSqaREha88WGOkzI7hAXdZ1tJJh/0ZNg2tkwCEzN\nIXszndn/VyPeYpD8Bi+EaOTjjysSmKVXtH5u/s+ap/2O/r+EHLMY21ztOvz+\nPwhPJawe02UKSHxroG9XQ5Wdr8nB8vihoB5/IR995YmUyO2je5KYoIsykFhq\nVC/q+CpdzbH1QDo4rYVB+hRhfwIM3n2EJ6WrGEm5vuuBdFOXZaOzw02eCZEl\n88h3BX5rJ7idg6uioPFYofAupUmhFRi63xgwR+uNsu5hTNfBtz16W38BkCaC\nkZ92xRQ26Dd7mFDmmxY9jvqxLEE+bBsxpxLI4nASNDZNAlpybI7rA2sWGAjy\nZXVzg8O+kQ+OkuHf6pWRdT9FXx3hFB/K+a6y4BFvO1ReIdK4phnPdVFS6RBD\nYDmWvt37IF806S3z/fBZsIDZE63BGi1OqIDSqnTKcfVd2mnm9a33/lj1k/wU\nP0Sj3kLTG0eNNU5VskvLV0Yt9PqACvt+qvzihm/lWMJbx4FenmyOwaWJfuTL\n4XT6UfRsUHNPy9uOn8wyHrUztzfSmVA59k4JkroSkLXHHIhyT3COYzYZYRca\nR/MA\r\n=Pgw9\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEK0zfaIBnH/8G6aHjWgR/QExckRvwA/i9Go5OHK4jvnAiAvsSIYCK9PSc3EjjJ+QnHEBDgVO17OlB2edzZxJPGUcw=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.84_1582218953306_0.11980156006783882"},"_hasShrinkwrap":false},"0.3.85":{"name":"wgraphbasic","version":"0.3.85","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"50c5fe46257c1c019d2fd66f0740c3fe42cf3233","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.85","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-3086D6+mRfrn05TWxlyWqIgA7YDAxpyKyDw4V+tI0A/hxEtwnkvRCm9eLSRiBdn1UYWMDlsFZwuD+5C5CRzWOQ==","shasum":"e820e3240d3ff94acb0f2e784d427bcedc82b872","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.85.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeUr18CRA9TVsSAnZWagAA/hEP+QBSsD/9A5QKzi3cSjE6\nqjZ4tTLPy5qF2M2o9tC8pmgI6YI6BuWIx+ikBHyklB4G++uM8jVZHosbHWAK\nyPoGkl04/CjpCO1P+42a7DQlIjoL4tmz6RTPqtwY9tuq2Ab65I0L9ufgiLbh\nD7X6QG8/tzw+P+O/Uo/+D6fWC3oGCBz45GzsV2Eioq6L7bUmLVU0wSEAUPzu\n8VIDSgVJ9Rn0Q+ujzL1HoyH0TIhgbVgqzsLbmd2AvSI5ejCGiGKgZ5YbjBtU\n28UpJW8pMESUNg5WIK9A7cW6Qni4yBhm/zIOXTOSo8Wb4xZpYm2PEfoKFwJQ\nBMWyNFT2c8fEZ8W8y+YHtLC7swuqZkWr+8g5VhFqM6yJT34YsV+GCMqnY1ig\nXZukg4QB3lslH9aBdMN7CXtCd0exgQw9L0bWM9dpcsHw2Shw0k4LOf/DgFqe\nb6lv2iS40sIMWFjawTFMUzhfseDFOp8ApSpUQ26383PLSr1JejWqfCf4wHV0\nKTG8vQNZiaoqVHZ08ngpynMUJWaA6tuXOzkWpHd/Zw9QdwYe/WRj6XIC2em1\naxiwYqEQg5fY6g64+CmZ2r5rISwlut34LwgrZXwV6KUQywcYTGGcNr4quJBP\n0QcbalNySokVEvGbf1WbYfejiRDFeVilMHOw2/Kkfxe1SMEgaEZzBWnmRHB+\nYEMz\r\n=S8u4\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCLx09VMf6z42gOrz27BIp6LkfuKApdyFywgaW0iIM1BQIgWGSMgPZXUOh7vGTpVApySJfG5SAr1gi23QN3nZAFIoM="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.85_1582480763637_0.3043809619016702"},"_hasShrinkwrap":false},"0.3.86":{"name":"wgraphbasic","version":"0.3.86","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"5de498190dd82d999ea62ea2e0ba21614224b158","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.86","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-l4QStmEDL1ar52k0TjXfap2s6WjRvtntz8tlDFn4xi+J8w7niTQWJZv8KzoZbQXofyrwpMAxgFsM34LuO9XuIA==","shasum":"d2cf37343758ee3003ff04326543206ee43119ea","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.86.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeUvSXCRA9TVsSAnZWagAAPwsP/j2Wd/0prlYiwXtc2u0O\nc0knU4MIZtVIit09qQLGCPwZHec7rqfno+xFKByy5pIDrCIsurve9/mTbhUJ\ncG/cLSEYO4jm45jbZPHKzhtxGRnJRw7iZyuaXZu34qt+ArbJCvajoJ8VI9Mt\n3p2lOZPL5FQd6KotNa+x1Tr92NmQ75fcT5Tc/aSsp0gN9nlOVtXwTpOfMa3G\n74Wy+Ilj8hKkmKjrcuPi+eGZnFaVEL/CbHmCAg7Z3VVtoRYVAxAIUM53lyGk\nnTyARV6dD/Ysf7WHr77+aRGpBdISafQ1kmKeLR6ud9rk5UKVntUeP1wWq8pF\nE0yfdbI4v+Yk4ooG3sWq7iy56tIv77duKTUfM34cw7uclwwXh0WHxUT/2taN\ncqn80W6CsOGoPkegTbzBHhOKlmUoQKL1Lg4K4S2dtQYFGBKH+5b1EqKzqW+a\njjgx8+VIvSepvrpIVR69hzc8O9kax2vbLxRukREOZL/iBBb/ZTDXJsRcJICw\n2RbSHfDnMYsM9BzUXg4ctOVBK45ts40jD6moXYrlPs31Aw4yg4FXbZ0kekaN\n+Ti/GLN9nUxjRvGayOMHDPRq8fVo3o1B6TVZNTeC4NaDAZVp5FiSom7a5WVO\nAff7p4e2y7zOYZIw+296ZJtMoz26ClGiBcVqxvKrLj6AvtAqn+avStfMVGsB\nFRJK\r\n=HP2P\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHsw31Mqd4hvoiATK8OPNYgmF0v6ci4TgAN4zgt4iH1XAiEA2AE0Slqo60sfaRKNAUzypi7OzcL4g37GGB/XENC8Z2Q="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.86_1582494869817_0.03582625653567062"},"_hasShrinkwrap":false},"0.3.87":{"name":"wgraphbasic","version":"0.3.87","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"2c02881ffc525dd06783f1d7ed9019626b56791d","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.87","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-v/6W1WtogQFrzNj/WYlwLUhwBdZPBRoGuacgFl8TZrWC9blIuuE8F+MNsqFw5Q9nFTwh6AMscZtd7XsL1chlSw==","shasum":"78f0497e47334036d22701999f7c01b5e47fbd34","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.87.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeU2EhCRA9TVsSAnZWagAAwL0P/35UrNhu3r98p9+P/gnz\nX64+w5wKcmZJPIsWD7pt31H8q7IFuAMlPs5jS9fJ3FIAW+SfOT47k46+wBxo\nwwumL44w439nUVSpM/pkgBbyvDJP05sV8FwxW0JCetk15QmDR1+/2OZiZtkc\n++aCVqm1uo/eqGNqAscYw5io4WLOmKkhMXpVAydgNrUDSAvOCJ1ofASk4nJH\ndrBF1IDv+vWI/HYBMXMmMR1M/Yajj6hRazvzzJmd0ebW1fwu20vIHmLr1vum\njvMMKFSpBXJovPBE8+MdAvUx14XXqIOAO19o35LLU+K2jI6ppafX3Gf3zGYt\nHSr/xJ6gUXkatghri0GcVNB9WXsUBukJXwcOZhkz97vcIaV7CG3Fh7uv4r7B\nZrEx3ZQbSipj3c3WO+vRmq3MiYmP7DPFEA8A5U4calHLTEYb3J45T+l3GgUA\nCLwrUWHvA6fM4l5LIVHC0PUjcBR171cZ8K75j401vU4SCMoCGGRzrwc0n61n\nFiT6JX0ky0pioK99q9Hu5s/xeq+vw/RsGtpObu3+EEUw5mRCG4dDTQHqcrU0\nrWCheZAtimQfyM4JKDW4uhrVTZpoLZbCOL0VEHB6dn6sQTca5LDUSRWtM+FW\nrb+Pe57SoIwC8b9hLb2j9nrH0x3ja1ZEtVIhKZ6ASLQk79WIfuFlFH1qSKs2\n/KKZ\r\n=ysw4\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDWN9iFIgvjddPDH5DRkXSJeVc1WcbV4QOUsx6F4z1HQAIgYt90HPDnu0oYwFSLkHsz3lEBj2g8QV4m0itV/ngufNc="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.87_1582522657351_0.29145285523568476"},"_hasShrinkwrap":false},"0.3.88":{"name":"wgraphbasic","version":"0.3.88","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"4c7d9b5ac322ad3c9af854730eb1d71046f33580","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.88","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-t/lkaEY6+WOipwIaJQaKTR0YamscjiQstn40feHIDquyc6mFO+0okJ1hzM1pRkl7A1DtMaiSP9wTlKPVTKogVw==","shasum":"325a17a64eeed002d2e80b64eb71b050b0de8a22","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.88.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeU6+QCRA9TVsSAnZWagAAoF0P/jmePm5jve7Xng/HXJDX\nMa1CuM+Z9KP9ZjdHlNWMl787sDJX7XJm1lRD+Pflgc/z8MzUBDzGCMZxA5qJ\nwV0rNfyWV9geOnRfxSj2p0or14CJOhqF9ezsuH/dyrL0qT1LuRqY0MQDGabc\nrwg6DBcB+3zLjQ47By+vMZTmO4Y/HzYoKC3KORopGiK40hvLTQCDRUD1WFyO\nc8e4clkCMJpZer5fmqObWsOGsvbT5ft3n0OVn5gBa/+VtcRlbJAepG26F6F4\nsnR6k85wv/Xy5qqNdFz92HRrSMV0Z1BAAVykOsCJzCdaj1Sfgu4mZ0WGaj07\n5+WY0N0PPHUc9P7uVPBwkMyfr8cogJipJk/CdVHeN1fSzHggn8eEI+KOYXXH\nF39dc+TKYdbRRAUjGzj6z+q5hW+9w8zQz0pbDeo2EiXSwOOd9ccU/dcyCOVx\nJxEixPoNupuDbBhRsHhNN3Xw/c5eOi9kvQn4hn6TqGNlsJgSS/JKX9+U84s2\n8wkyE8KTROyhkaP6EhpvfFfADOtHfX0awegcy8ZHe7qoCQnoC7KXaT+E+hj/\ny1MXIV779uQeaLvBpY5XBQ0Tgn/VcjjtcYI6J/8bMVq7Z6XcUZ8TV+dY6qCW\nxVDxvDczCek68Ak76Nb4niBU3n9t8pOR9SpPnFwmifW8E+Poi41IW5vA1OSC\nJ8he\r\n=uOph\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHZl1ggUROHOCY6HqjTCLiVxX15UpgJ8qBBvpYtMVwhCAiEA5Ava8YbvEKeMY2oRs6tQ0Xt0/InFlJgT7mh7ZBqa5SU="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.88_1582542736084_0.1313074373484222"},"_hasShrinkwrap":false},"0.3.89":{"name":"wgraphbasic","version":"0.3.89","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"e257e5d8bd518e1379741f4b012c62ca580859b3","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.89","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-4b3zWe/Wa/HYAzCJbDOOyOfS5QAHoc7i/+Vpmy7ZAV/N/75zvUq+TSncHx94ZMoA9FLWouVNN+px79RoWH+7LA==","shasum":"c4b56423f49403bc2a7fa70ad851d1efb72a0724","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.89.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeYRpdCRA9TVsSAnZWagAAFEUP/Rcnej0EQoi0o6hC5Mzw\nlPCv2jyjw3S4crgTuAmS2laQv8XaZzYgBjWU58YZTypef8KfhwlSwCmg9GU8\nk1UWu2cduw06uGRtmPrvH6t58aluTROT3waA3nA3iqX2a85quCUHVgrwA8yO\nAL9vQ9sCeXttWAN2TnNlImdVIqq67t78Xaexg3paZjmqadnZCFY9MQs8kujN\nQ6zEjwoTcDb+vHNW8SdRaPbnRlNgaL6hC9cu6MgGXioA+L9v0GqiXQVgolcY\nt3CgQ3/fq8BLF0QMLMkm/9Eovt4AYUYsBlEqDZt/Wf5CPd7nVri3H6VYYKc2\nD1clmfTaq/o5rroapamlhP18fe4RG0SjgCD9AEySxCFju4QTEA91b7QUwTl0\nmKCLGTmUTYuXulIBEHHxKRZBquSd31bO+37nebA79W6pAt898OWFX9q7TKs0\nqJT4o1iR0BoBPVT9coC4+wD0qRikMvgHoEdu8nNstsJfNTToErkCzKTQHJYV\neVKIKLCkGvlUPhKWkTwhncTBDzws8CUBohLvPPCx9CFVVq8LzDjFogd9MW1g\nzTcHahGK6HCSgjWIKmcbtmcK8BdZh5EjZ1/83rQwn17bFgAl4wlTgCouxIUc\n7DaEhzEotPmb5DGesQOv3fBT+AHCfjuc3yyFlwY4Z0MVh1/AjlyMqaNNHqfd\nuenn\r\n=4cNb\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDku/aaoPaSze8kznM0YME2Qux7WYsJbfbhRy6su4Dd9QIgD5v7cc9RYXiLHhkrEVi4wILio5Db7Q8xhz0GxT6zT24="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.89_1583422044556_0.790389824367332"},"_hasShrinkwrap":false},"0.3.90":{"name":"wgraphbasic","version":"0.3.90","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"96e8b23c558f0da849718c2e28ffe15743ee9512","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.90","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-Z+uFJB6Idy/LPMjvEZh5ahu0WLoKGBMt5Cx7MmwdmgbIgoxYEsl3PbkEuEglEs394T5egrkw0D3Ve6wFJysp2g==","shasum":"67be96791d18e51fd8e15236c05d4bd623671d6c","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.90.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeZ9oKCRA9TVsSAnZWagAAPnUP/R3/t92oVXu0oHeVRGy8\nYfprZKmKrrPybAQpAAIV27QhzEoa+1Ih9UNjSmfT+vw64NFakYNRsZmRrD2K\n6RAiHYJ5FGU+8BAihur6T+VGk13gcfR1H6Wj9QCzt3vVErBtpT/jPtM8geMA\nOgyXgPn2sAJLz6P8eRm1SWa9a1ffGr3ILn2bb8CowEmp39PhnZ0/E5hQvQ1M\nUzJbyDrysguGoJ5gada/n7AyuGCnmQyBCRrM9rrLcc02Wq56uZv/hTxh9Zjr\nWN2AxU07z3mQXoxrPK7ru3npmLwpQ+TzKzb7QSG1Uxaj+0jIjZUvVEl4JFCI\nhbMNAadDyGNAMuzGcJuCGxl2Q1+sukXtnheZedt5LrWMpaVOXHmVV6hlJ0U3\n3fHH1vWeufSF4Q0hydyF05iDZyLR0a/Jk5Q60DGtfd5JSrA0W8PsXTq/Y4k6\n+5CUsM+bcEsKCs/PWY5DGEy2izfcDSkLV2EOHHPCay4DzYB7X6nLv2XmZICZ\nQAXtO+lB+THT/NT6VAZK/iecT8CrrDGY3BUt8NVqBP1tMqcn5AWfjjfZn+41\nZtuUgeSBY0sbjf4WcNbjw3MfC3yyS+bWNC3uBIbooe1SBUtIJjN11G2uKc5Y\n2jZAedRm0UfCtOJ0PU5d/jtd54ifFtSQgjHooapLKEA/bHo0h8da1F4mTMsp\n0clu\r\n=xlNE\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCUXozU3aJzwQTkjQ8xUisfptKNqtai02fpvkfRFnVKWgIhAOgvdTUJn1bXyoedT10n+dAppzVK8i9Rh7IQQrKVonLy"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.90_1583864329440_0.03189241275713206"},"_hasShrinkwrap":false},"0.3.91":{"name":"wgraphbasic","version":"0.3.91","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"c5f47a074ea1807bf0285c2c64e33599af3ed2b0","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.91","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-Vbr8kwstTHl1AA5k98RQFbTfQ42XtLCfsqQXaVAdu4puONtCMNfoC36kpkjgiMsybDeY6IjwGYKSYtfIPzWmCQ==","shasum":"d59992a690ddc8a87907052e83b72778115f29de","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.91.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeZ+e2CRA9TVsSAnZWagAA6OcP/3WUStkqs0Q7ClF5uj1P\nuuKuGc5BK18zkZC84ziCRGg/NtV3sb5GyR+mHVxTf0tvZv3gSsZf0zX+JxP1\ng/evZCFbAEwJZgupS8OZUM85LixEsTuWb96LyBtOggf2jQQ5j3E8HtMd/jEL\n0IbI718wpVi3V/Wvp9jOz9FLgviKR6/gdAg1+FzdvVI9GlGOdStBHOls2qwJ\nMn2mnVtf0klfZib6GUpTCtxaGmZBD1E94Nv1BmgFPLNGUF8aW0NVTXkfuuc5\nYLgMemWQtLE3Pa84uZXdvv9W8tExY9P070S6CkzR6+B3a4oYZajWMP605W2n\ntjaty4aXxZyzgQLJfqESBYMO0/8t41E4gSWUHfDmXo2LcvWug/99INSim8bh\nLqIAMBKArhzD6H37aQfJw539w0vMyY6o/c2a4liwc31GqUB85ln8sJU2doVc\n2LnLuGzb2BvYnj+jAPocu9t111saVITFVrN73I1pPWoop3UkzTmLmJty7i6g\nrf7OQ1RfDLou+6mxdwHnYHHISBjjezpbM61YWDgFWHfr5YjHeUMthlqOtGK6\n59HeaiVEQ7sT6m7NKWud73TdZZxxxryPjUCrR/1QCQrP2rQibl8tnhAz4Wr9\n5arcT5hYYK9+CVOmKxN54SJcSqRCcvBJoInk7Zb1hgT6TGzSwrD4mSEjRUdK\nRADZ\r\n=ZeaR\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIB82pTAW7JCcsnsLusXgWk1y16pX2QvRVBK9LhId+xHaAiEA830ZoaplR7HFNBhcn2xOIHNWgnvIkYQhiGIxxkKzqJg="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.91_1583867829660_0.24035340295993968"},"_hasShrinkwrap":false},"0.3.92":{"name":"wgraphbasic","version":"0.3.92","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"d47813f68d3580602d4674c4d0b42c9eae45865b","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.92","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-J2+Y7CAJEsGteTON85QQMIWJ1/x1XJpoMA6bmZPiZ+Y8Nqa/7uKRH25JKTy9BZ9fX3Dn/kCYqf12l9ZL6x/f0A==","shasum":"8a6e79e24314e20152e48f15127b8f2b0076c6bc","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.92.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeaK2rCRA9TVsSAnZWagAAhzMP/ii1NrCWeevUFscQ0NMh\nB3sj+3HfOt2p7NwjEykIbpfWSl5UKnpp61v17uL/W/fLi0skNry/9fgBCLpH\nbovZze00Ta0dLUfTwl/M8YJp/eHg3Zk45bpDsbeEZiIdcM8TqldAr6ewIGfT\ncT5saOqOIQmrkM0eSU0TVx9eTy3SNIHnA2LzwbHZlspryTFVzSwiGoqq4fr9\n1ObFXeIxmFNrGCU11q8+4sOuQxdD0s7PgJHpUBd6+ccwpwaU2vElg14hjowT\nPpaob95JxOtNymPOVYHMmzGc748sKx62e4KPJzF/ctQ3WUXTD04Ozx2Y/3pg\nUt+3aamktjoqjeyNWGomW/We5K3pNQazQoDvcdIrCBUSsew5drBqfyU10dWd\npannLY5glt4SNMfIHWh4qEZ9LyXhG9TOqJxU8ujzQlrvd0ZmGyGIQ9ejAAfh\nxskR0OtjZPnB3W12SxOADFGdk9PqHov55rFQHn9uOdU/jvl2SZiI/qYKis2T\n9FFENstM6Gg513HCzTmyGPblEYgjX/t4wBKc/mzJewWbCW5lHN0wDb2mWQrR\nIzP4t4ry09htenDbon/3Yvij6rfq0nvco2mgOjYvum+uhyfWShlTVlJ1odB4\ncKTeax8e5BFt/j86KoSTAh/pzBWJE6e2M2y2YSVs2wTvy+KkYBO2oaLLPQAO\nLy3D\r\n=1xAk\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIClhzSzroEGBkplKzoXP2iVCVuy3awIRb+Crh8DvzzHXAiEA7B6UevXc2IbirXxqQX/k7uP8bRhy/3ACEbj1lj6YGcg="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.92_1583918507267_0.40337676912615184"},"_hasShrinkwrap":false},"0.3.93":{"name":"wgraphbasic","version":"0.3.93","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"58c8475bdd9d20eaeafbf3662783d4b72cccb786","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.93","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-3eQGYH1QBUg9WTrTvamkJejmjKGMNuJ3RrvnVudwKKYvyXycg2BywNP81bkzZJ+zde5PgErtNRsAqtVMGDzBwA==","shasum":"0c7c9e1a1c84352f94c4e67d548e410aa27d1158","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.93.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeaNbkCRA9TVsSAnZWagAAw0oQAJ50ZgDNEVDoE87WV0cz\nYCUx7yyI/FekMJ2mNxNUFtJ3tl3sjsJagLBF27gaK93+r3GHXlW2wScGKvQe\nVcowSwGPWD13DbSMhXHb1473r6uxKUrKYSq1RphnHDqW6QeODba/RR4u+Bv/\nHLueLC7zA3OVrlDgkXOVQAUipznZafKYUozwJH1PQ8OTFz5/8eyPA+OvcImx\n95qPd2oR/VpYQQYZNOUh9UyPleFWly167oGeaqGiw1op4hXsIOsnId2qqjxX\n0GkeDz4Mv9HdTCuXU+ez6xHPGFaQFCh0xJjyu1cddKK5eICgUKWGDfTOKIiN\nSuFQTeIdCTVmncRrLyrNXoHwNc0neK5xCsEIk/Yt50kwhMKhOvoYcJlAALsP\nf7a2ueFqbtHANCYQkrp2zt+YeNNJt/dlQAphga4M64R9LZUi0TJg2BSzpWWK\nj3c52ZNorfRnCVPT5KrLWxXQHNw6+PjekzxVzvZuGaqbum7pCEUJyvTLDW5K\nA/ElMIs1wMHAPomka8XD7CSg20+VH8HrCUXg8RUX1OHPa86QjqZnmjurY4zZ\nGU4wOrmbLi2SYJTFzUSi/LycXqZm+xqIus7NNxInYSy+KUY+MTKAL/JlIUsW\n1ay33P0V2Hx8TXA82sy3UPcCjUbv4XttIhuPTMqBiILZYN1i9eUk+JsU3lCk\nLThs\r\n=lU3M\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIET92OGXcPM2LvODt6SNqm3Uc6OnhT0Px+UPnXNhg0HiAiEAsggxLFplvL86qMRRudpC9lCFZ4879I7vfbPNQjPUV0o="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.93_1583929060082_0.15278762588825967"},"_hasShrinkwrap":false},"0.3.94":{"name":"wgraphbasic","version":"0.3.94","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"1554b523277bbf6f78d2ea11c23f14c120ebde62","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.94","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-kXGIgVTEFXbd82J2MBbrgevfeD/ksye/ve6zE35X26q7jwuvpYM67wR+oZkvfwF92AS0OlY1r0ZWTDaIdXNpSw==","shasum":"a19ef0bd7f0b62b2563350cde144e6bc67922b40","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.94.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJec0GYCRA9TVsSAnZWagAArcsP+QDLns7gBRJ4l2ArAWA4\nzEnc144jtxwNgFxL9OMTFr0ZCmCGxS2ct0DZFRHRaZ2cutlAIVcaoPzKSCs7\nOsGbB+TjD85QlXqhUC+AIucChdj5f7AOXB1143rzBRV9gWRDuVhA47LoqQsj\n8To4EXrfMHSMKmm8fAl3wf3qP1OpTZOUscdCkkt8esjPRqU9TFv8ZFItY7tU\nwM3Jn60GYUP2TN8Mc70xQL//IFPibVcAZeg03B4UFdh/5OhKnEDfAbdEzXyx\n5GQPgzy9dRSrHqF5XPSlhznPlHiAIEXOG1Rjc4jrAUFnEK+HlgqyJMfwMLHj\nYHO7q1kcRdmjGBcP8VxSHe99/CZP0muxdRiWiMPL9w8pzKcVAaR/Vded11MD\nE4Cu/uPp4ehgKJkQY2pqtkZnbIEQYx2250YC7FIxAF4IE9fmsudPpMv6ESdd\nVd1quD/+2i3EggakaUM3qHJagZFdCB8xTDCWEVANsHT2H6mCPd9uE42GcFjb\nhesLUIFi8n3+dRhZLyd9GYf+nK4xXRzSW+/LAoJyL+RBP/UhXt1fSDExJ2QD\nD3NsiRfoqxutlQtGrzFQ7K6pIZ+F8iJtc546WO4k2cuNq2/BpFNj2s7i3ePz\nnaj39Yr4yvlSI5xWRz1Q+peVRIiLWtErga7yY4N70C8OBfaM7+RxDMCiEdkJ\nBqib\r\n=Q9kY\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIFbb77TRD68v29tv/Om7de1EybnGLcLeSTz1ILdKGts4AiEAlm3tZhXr5b9TZjf/FYwxM9ICNqwGPSEMq3lxG7C6pUg="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.94_1584611735725_0.1600934628631303"},"_hasShrinkwrap":false},"0.3.95":{"name":"wgraphbasic","version":"0.3.95","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"e0c7e5345ce6df67d290d69956f13b5ab304d433","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.95","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-1aLBK29y3nDCLnsoz+arQp2VGjhZlVZP1FnbR4gO3jd+m5+MPNedut3E5uZzkYSpxsV1XihyYcNkv59aDg/HOQ==","shasum":"1bc08cbf7a956a16912665a15cf0a94fb71ba422","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.95.tgz","fileCount":10,"unpackedSize":138198,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJec0ruCRA9TVsSAnZWagAAgsYP/iSSbTRTJrdROEaINOW6\nMBggcRDQ10vgREHK4Se7maxX9CycUVp7slOkIOSIerE7UsMbVaMsZSLQ4b/L\n2Z4/ZcFeLb46lL/EsuJxNsZp+46B+VJviElebxWjHkYZIDKtzIJXXQWVJ0aB\nmKmBanVNSyinkc0pbBDZT2/i+ge+IU2sq/ctO7YMAmLElGy4hILrv2sHy1Lh\nEKMDVDaNxe6EVKkmcq8lZvYCS3gpSodrkpSOLXHc1TaY3X4dMmYXAWdu9tfw\nekg8iU6/phxEb8gwS7QZFDZAhlseICt9rsIVvJcMQgqdeed0Jf0OLnBGqrki\nsEuygoY31Vd2XDewvcJI4s6+iQjPgqo06DdaPK8tP88XiQMlY3gKfguIxFRB\nc19JZuiv1okLVujBcucmISTf8WpZ88Crk02YvrdyUibz4c9EfVIpN/5xv0FQ\nlhb2o5rGM0vwMOElfKa7zxnNZx4AhLmwolxlKMSwyhoU+dwqmAMmmyHq4HgU\nFHn6KtuBASrNRvNyAqsQfGbzHKmat1pf8HtcVb0rAsoKO+5xG3/OdsWSMnxA\nkt9B6M+8rDNI9zTkeDYuTsiqkAXWCSDxQ17QZEhaGkrOIoumAA5NRWqGcgs7\n4R0YxPEbDsKrTMIZy0zfxlVuuMWRNu1UGf5Qiy//mCJ8m5T2fjJmBDrBQIxi\nCDTf\r\n=qWoV\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBrQvVVpV09dtwZgxk/BGKiDOqwhvlVuVaBTAJzSdK/kAiAfWelRQGe1VBxVYab90EZ0DXDv58inKoSNpY4+M8Ge+g=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.95_1584614125577_0.8708071862431273"},"_hasShrinkwrap":false},"0.3.96":{"name":"wgraphbasic","version":"0.3.96","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"5e2d15ed50ae0f045ab6c812fabf5c1fa08cdfde","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.96","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-r7Gqd4ApTHb+bw3BlyNjP6+4/TOIBTA6KBx2C0HshBQb7n6soOPSpGa/dWYjv2XlmppmRjcNqXzbFaaaOREITA==","shasum":"32365cbb5d96b6dee22dc9b73f88876a1fcf6cbf","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.96.tgz","fileCount":10,"unpackedSize":138206,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJee4omCRA9TVsSAnZWagAAaGoQAI5Nw798uRg6NYUpM/rH\nTzgTrEUHGC2PZaIf99Rv8RyP1rDpbOEh9pH4W1I7srGuWV6RHqsCSkWFZ4u9\nYULmeGZnXVlBdVVtQFJkO/t4rfKiGSp8Ud0JBVFvePRViEvCWZWyBVK2Yk5a\nQIPTdf5dcmHiMq8TDRCV6yNHKNahLq6xlvE9tq7imSsiUMxgtb9Ty2hA95Bu\nDNPezXX9bGv/H3Nl2FOFWdZUYe9B4Z5TsZTOyyVG0LBHvHSKVaodsJWy3Y9w\nbvmFAAK0UNqrWi45NTOktTB+qNLMgp1PQ3n1kTLfku4XM1fC4PLt7f/OsQR3\nPLD5D15CV+4KUwho/g+QnVbhHlb1dzN47L0IktCTmpADsnEkcv92N3qm1V15\nBC+FzE9Bilw4R34YTo3pl6L5og0+eNvnacYYQe3I5lItxPW/sv5HLT52vgg6\nYYZqAtSQHWAY++7WF0G4p+ZOu1InYv+vq0vfh4n0hvzHm76yCZtqvHh6BdsE\nPmhCBD9vOxDtElV0BnFspKUjI1Cm/CZJ5yasb7qpJSxe6t+uRKzym1FwOwl3\na7NuggwA3sZnViCfSeSt2Asu1fJo5/IarT4JtPJ3IyEoU6UVuCFesqr5DV4k\nxCkuDFRdjAtR7VpRk8Hky5QZwV9LmbJiId5K9fKGCl+90jgpc8s3kRPBQf2p\nQpuE\r\n=Mzts\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEl6BTwgGAzveH9l1/dl5j19Daq7XRNP3t6hO0WkgOwZAiEA0GDr6hz+Z8+FZWVKnOoByf9yBToOhNQhYfEaEUg/Yyg="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.96_1585154597698_0.31263316668353913"},"_hasShrinkwrap":false},"0.3.97":{"name":"wgraphbasic","version":"0.3.97","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"74a0db75a1345e506f0a8cfc352348dacc1cb3f3","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.97","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-IsCiwKJ5h7DZqDy/TlMOW2iUUlb19XvGK/fUFNMFNmhGpgDHL6NeAOTw91kIc4MTCkopZD6qNlNlER8IXApNLA==","shasum":"a55819aa0b90a0472826adb5cc0c7550ef2246e3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.97.tgz","fileCount":10,"unpackedSize":138206,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJee56oCRA9TVsSAnZWagAAbzcP/16baRyeHj0ra5ONQwlN\n8u2CnENndJsWa4z3f9PbLsqSOYZwbEUiJFCPvV0a6beYejeX2NtESctVIiN8\n6wtORb4RO250Jka0FfrZUFeCStPW2p0I79cTxyakK+ABHd6CY89Y+v/ohuln\nL8/r8WSLiNdgZC0HOHo5ARp8e46Viv1NyyrxXFx7s0LAL2ysN729xS2l6rC0\n4HU2qxXrjd/3XZgAr7AauvbMPgGoMI5qihnlWpJ1ldOu+Wm/V5yWS673YqRy\nyYqia/6PGkO1ok5h1nZm4HtioQwLc/TBTAkQ2zQxngF2k4bAqzc44q0yGrcE\nEA2O0uE+zFDpXkpXUeyUlEa1f3BqFBREtuukzm+fx2E+6sm/NDExY+4U3K+I\nBqjEbCoXsKA5iFr0LBHCbsZ5Ki6CoSV2BGG/4ZF64YfY907ET3MCaxsvJfw8\nDvU8zmgfXW0UwP83emMhYSwN9zFaOR7uv56+0Gw2DOyTjFTxLaN9d/cbYG01\n5uDtO0wzRQQPpBjjHFEtx7ZTwZztvK5VF+JAVNsTpGQw1ttqmw2/xAjYwWb4\n3Hq7bmg2kPa1u2wqRCmXTP9gsWFp2Pudpe7tuyXJTm/t1Vc+f7bcSCqrPWTP\nmaTBQOtDhGentIQNUVmVrCykoUoESmXB8PmXcmIPoQYHkzEpt0w+ICbWnnrQ\nP41U\r\n=grzb\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDdtuXbubaDADU5Gx8Ild0m4Zah7HQV3tLOe01Om3UoEAIgfEmBCvl3mtLLuzR6rq5UTP4H095oZfy4IFKSehjpt5U="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.97_1585159847828_0.17329506458947042"},"_hasShrinkwrap":false},"0.3.98":{"name":"wgraphbasic","version":"0.3.98","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"33bdab9f1e64448ce7b446b35d322faee858b385","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.98","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-Xg+FOnwH1r/niinIZqmx2XxjMKHZVs7DWpTBTBicn839ojcuhQzYacZeoOoi04Q2Qe9wcNSZVihMM0EEeUN27g==","shasum":"bb4c2020ed578eea63e68ebda97ed0e06fc79dcc","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.98.tgz","fileCount":10,"unpackedSize":138239,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJee6xLCRA9TVsSAnZWagAAEcAP/2Yf0/0j7qzTqjvxVq0q\n3pMebxZAXLcykjVBMFpZ9/7C1by8ck7GsJq4A/rgkEye468g91YvzCK0Yh0n\nAmVyVfCXVidFWzALbpjUafa7S4DUEvNpzJzjeWpIMT5L8RIzb/o/40gAbXCQ\nNaVedsO1pOWWLq/ONWk/iUH1Q6zuPyiouIFt+b3tBsIC18u9/1rAGBEm/mqM\nRv9CTGgPIDjq1Gkh2NPqH0JQ8ovfx2W8IM1JVnjh87D8DLus4nQ7GpkVT9Je\n8cFfp8OWwwprkG0QyQmf79fniuRSjn7Re3qoQVPiBX/Kk8QOYFd4QArS0rlv\nGPzLyiXlZBiRkUC6DxDLNq8puRwxtFJN3GmvweP5fFur4xqS6NdpcqREgFwo\nHMPv7vcwGEdwOr8nCpF1BatnjfoptDH/R+Dt5M5ysXoF6RC3bkVRmOaSMkX5\nehEyJDLy6Gi9h1n1T0hzVOXCZ8SsqFYXDw6AkPwuyfTH09+A5Ry3XOlo9cUq\nxRUlkuuNcl/WI5QRmqixnY4kTxBiAE3rZ++7XWH4smtjqcihz4257+p83ru7\nUlMwBkFXwhInuppIPaDicIwwxkooNR56aSRQs+z4046vL+mAlhpHr1I6/s2U\nRJdfrL55WZYiPaiUWYgmXoRIt5GR9Gk0Cl+B1g0xWUdIEJ6ym1ZK1H2L0nWh\n5Tv8\r\n=ykxn\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIDFELSFUUiU8KF/Av8sWPiaq4/ibGeT4t/eUKaWnrq17AiBGYFbW8PwK/hDeYl/KSv50X145jmPWN75qr2g/Tm+RWQ=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.98_1585163338667_0.27604730100679364"},"_hasShrinkwrap":false},"0.3.99":{"name":"wgraphbasic","version":"0.3.99","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"b6078bbd65e0efb7e69cf016c0968303e03905ca","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.99","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-7pDRkEHVETNeW/p8poaPTZvOWv7I+zei/bYws/+0bdRmpN1M9raj/aDyDpFqT9NhY9hEnLk+3/WXkQc/bMjGRA==","shasum":"1a808ae9a0cbac43523bf1892e23ebca1cf5c90d","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.99.tgz","fileCount":10,"unpackedSize":138239,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJefECYCRA9TVsSAnZWagAA1xYP/1RhDRCnSDXnkgOcul4R\nJHhrZDF6ltz4Y5ZL3E5E4VPM4VV25L6t8VhX0DG+EE2xQ5z75JthVAuGGkRp\nmAFTNn930IWtYiZKXsuSPojxJELGDDEoOtOyHoNSJ2L4ANy5Wk35A6fgH6Bg\n9in53OyCRJx0SOm2/PsUQe6ozySKqSYHhDIKQ6Z2LtL/IP3Picdd+vtZjZ6J\nE9JeMQ8PECeUCt5ugN9O07Wl6/SZUlUnnMBCfY5ANXVdTxK+OYKoMgyBWo4R\n+AQV+EZQW+p0bqTVFka9CcndRgFy17CH+a/YBoCYXKrnroK95DQTUqf1z2Bn\njuOD0DssV+4JB2rhDoeUhudeFmujJrSPZslfJmuGNEipjhokd6VkkaJqfjfo\nAES2MTvN2t6REl36z666loYe2z7mRUuSJcNJe87cWagxTvUTRGV7kFtcHwNx\nf846nkobaQVvlUFP3OaWpo2nKVEyMZEpxqsaByzLgqoqfXW8ZyJ78jbRfMX6\nSAAkQfqprms1IvkBasxY7fPDM1AxUC9vasvLRw7tTKDP2KBNN2g4xZfctAsr\nMXudDN564w3nN4Ah8uTEWlG0e5RU7ybHZAds8WKf8ZGZDKWHFKlHLorzICSo\nFzuFLQlBCpov3NAhYfqlXTatzewF7nZ5x7UB8v0OGXmjhdMnCOK2rDZi1x8j\nJ+in\r\n=Nf8h\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBmUk2LUUrCm8fXaoa0lqeyspQZQqmkE/BZcfClzSCRGAiBHHVqJke5KVV8KRjYBCUw/t91FIyEzDl/TvYblHjgTkw=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.99_1585201304644_0.33217251423900573"},"_hasShrinkwrap":false},"0.3.100":{"name":"wgraphbasic","version":"0.3.100","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"deeafc17cd215f45cf2da970fd518707b6965631","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.100","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-zW3iK/hZtTesz8nBgQQdgLjYFh8vG52v8SygVJLKMha/C0bOEEYUq804mgV1YAMXQiracxN9/oazFx/EWygqbQ==","shasum":"5c62516f129c2d602a70fe8b8c5dfb96b0527e4c","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.100.tgz","fileCount":10,"unpackedSize":138240,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJefE60CRA9TVsSAnZWagAAP0AP/iKGMfd46M7tT5ErW1VL\nSE6SflV6BjnJts8WdL2SGMqWwXQoiUhjn71GZHvxhUsC3Jf6/xHWNOmGfRhh\nLkBq66vv4X9Qa2HF2zX5vuu8uuJNkDIRkgDszJvdmTuJyCPS6y57c1YX5n8c\neSbRlGMJ2y4JF+ZS/pGPs3TbB+LzJ6uwRUVXsGSGjkHdnAMZClYiQJ4rsnPm\n0SdI9SWLgTF1U2ETAFCAUeyy8vEJotD3NN06/t2HJ+tRpWON9ysXIp07vxeN\nRhF488ipqZSyVisJpsw3BXyhizMP5y5dm+vDGJZIam3vvDilyAIF07T3GVUr\nmk//I5fmF+uQWNflFWvCHq49zcWMnNTth4WHjMIVV4Oc8YuOPhsSvD7OKn2Q\nV/0jgNaaqRwGuBqxpp/0lzQ5/hJoSMsv4tb16dqeGD9GWI2au2UIFBA1VxQP\noypHZurPQRWRrpXMm07z3+OuQ7gl5RR0ncO+XdPnzcXIE4jWgV4x1NNFn92T\nU1Mb0rIH2JRj2b0fdurUQQC301ns0jeFYLbQd+ZFwLx33IEXa8mJGNquWEMb\ncUz7Ws+d6OoaFwi/JrlVrn5xnxAzpa/4cZ/8G/W0qCHvrMbnJDUm2mPCvWzA\nbHb5fsrpXDarFa9zFyCSemvitwsvPhf1p35wYrkntGJ/DZSdiPQ54aDKQizl\n0zFL\r\n=FsqW\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICxi3erAhnBmc1b21TCndRnfdWy5ZbphZ3pF/hKB3JSvAiEA1KDpNK0HS7+GrEUdLaqXdiQOyLGn9iYZtryctzP1C5U="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.100_1585204916433_0.41620295971581545"},"_hasShrinkwrap":false},"0.3.101":{"name":"wgraphbasic","version":"0.3.101","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"8d9f1fca64af181f221f567948df7a41b7069c17","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.101","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-qayI+fNOlNf3eyRqQBwCXDRgFK51tKCBez5KI5HzUll3ZpyIrHidw90afgGdRDFkQHYTdS+btqkRcgHs1CgxOQ==","shasum":"de82e54cbd61ad38a15096cda3a26567c0b6a5ab","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.101.tgz","fileCount":10,"unpackedSize":138262,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJefhsuCRA9TVsSAnZWagAAhRIP/3+Bd3FxZ4XXa035wPMe\nBNb/YYXg8RuPxEk6hnhaa1aZTKcCe3EdZriyMYvpzDy/L1e/v85thDx3kp9+\nIS0DzQwW6/NdWh1Roa3u70BSgwxNkobwMlQnU7xJjLyj2tKslOpgoVXUjfG6\n6JiX4cEqogFqs/BTrl+TdUlDOzZyuYg6aN2hOmu9NYAsQNQlYWbokgw+G9q7\n4JWYMoUy/8dJeyAYGiDjKWym9BS2wRgTWcwroCYg83EYQNJP8yj0RwZyKUcQ\nVr9wo2+xmKNQ1PAZkngifkRELN7OhskfpGQWIuVxdcXzdByFcoaYP0DVMwM8\nsmzNepZc934Tk6jaRS1QZ8CVo0070JSOPp6LvI7eGOVjllrLh045s1zEX56f\nFKwfZYMVI/pJtNHALwaX+SQTY9WyzQID87+vCDcTId+i7qlV3OVnKOQxEcfn\nRNKOfAMBxplNjkbitIJpgDMitDZvW9b2lCvyW2PvHfZ2JvmFRZQeK1/vFelZ\nlQEwgAkhnP2oKbKlavybq6cjrwvvSOaOv45FqaGwhg/PYVZFWW8V3yW/0SUw\nmxDRjv9kSuTregRN/XeI4CScMOmhxvo3DB1jMjM3tVH+3QXLMCQVN6IoU7OM\nGydFGdzruDiaEHogIYKjOtOaELsxfets5/6gDoPYTTZunynb6qUc/HkoMSas\n9VUL\r\n=+D6I\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCID3lcg7zgvqntG0tBIFVwcYb7zp0iBUruTmxFoYu18HYAiBhDnrHewa23/1jlQfHmSovMnHTr3QV4LZXfbCbIGgV+g=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.101_1585322798002_0.18694417671918018"},"_hasShrinkwrap":false},"0.3.102":{"name":"wgraphbasic","version":"0.3.102","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"1664159dea1ce71ba9c109fcdb724225e7b81c3b","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.102","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-Jyb3O8zBQHc5D1WxL59dSc5kSHnjevsQDU8XqFDDQNGtbq8FBN7VgZrPyQJlyDJeeDTIcNMPVLyjWk98K0V7Qw==","shasum":"c45d7105f188e0e6f5af06fcee18ce6028d9a384","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.102.tgz","fileCount":10,"unpackedSize":138262,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJefiMKCRA9TVsSAnZWagAAqG4P/jflPU5z8jLD3qY9rcGY\nifijg5uS41jw9JvtknqV2y8xd+qwBPZ2E2RLfrJyLgdNRKwPWA75xIfiY3Qj\nnjeGFDcLJE7mLHuS30ey3Psakh9Jis+hxeA/8FPnYGNWnlJrhRXRks2keIpW\ncnZFB7FZg0tSfCVlVEd8yLya+MmuDCyJiTDQpkPLbpvMlB4igWT+MTtQq7Ho\n11eAszOWY8KhWLpxeUjIadL/me2XDjJPqZVp7yCXZ8moZR2k6boq6k2bGAdX\nW1H1oNaR7xxwZZRkD1fuYaORqROsjX2uiY6THUUBDd3OK/rl+Yu5KDMF69zp\nHDsGjTqTgSQE5rriw31f4sxC5NELO/L+C0YUD9Tf7bF88tcLrrNrOvPt3fX9\nM6I0cW2Vw0dooZKp7r6M/4sPScMJnKM433ZD4D3Gi10l6ULVHZaTAVZFd3ZQ\nJMPMApTR2uPHlId9bwnqhk6/1RPyvdnbHd+KBM/OtdzypLm2L1TOv8W8oqDA\nc4ei95xqZPI0F1oVZvqV3JivR1hb3oA2RcreuAZxyWk6d0jhCBfiBahkoV9c\nHvLdpqSqxK7+jnBCAwh3Hg473TKzTcJuiTZHh9EOgHKmd9EiKKf/Qnw4jB0+\nbkZP1Zxk8RCzHMrw8XTMhHU16mwUBu82cehUDxMHdKYUAYX9RgzCSoZwer1a\nBYTJ\r\n=i33q\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDf3irrjvYy23ZF43zA2kd7XNS1tWE4EQLzEPM+xzBcOgIhAPuUS9OdQNoGOCYPaQuARR8hkHoCbBqSV0UugRX1TD7i"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.102_1585324809773_0.9786564694635436"},"_hasShrinkwrap":false},"0.3.103":{"name":"wgraphbasic","version":"0.3.103","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"8ed6b31b80b806e034c6b30e3024565644aa5100","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.103","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-3PdrkMsiRpUMa30LyQtZp+TiYLUveT9E/8mkRendVd4x7i5eu/yaH/XGYLdpOpCEV44l0+bQxc+FYq+Z4MxWBw==","shasum":"ef93a8cc29ede20d786416a9460dce1357151e0a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.103.tgz","fileCount":10,"unpackedSize":138262,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJegzAwCRA9TVsSAnZWagAAz24P/ioI3bLRTLiHGNSoZXnC\ncl9f5iKshTjKsnEND4ZPksrKAwEWFdaPL0y6n6hhoBmeFc3UKG4Xr2HpBPnl\n+zGKuvUEcC/lMMPxzyVWm0Fkw2z9gk6q8ML5KY93VPJ373Rz2IAHDWXABfIQ\n+VDcKYeVKHP6oUEhfUfjAT2pmDLbPVeZEmH5xtR90bM+TPUHjMYClJP1HjLo\nwPMuqHqeXhs9mfHLTTUUQptrO7yoboNcC8G6mEd7/+xsKYLdbKimHMxEnB8z\nA/HcCE3U2fI7GRdXQCimPFldyuP0XCcm8PL68RLiSlw/3tSUxpA8EMw6JBRo\n70SPY0xbCVUr3gGVsGcFDuZ4c6hhu0jVJOKjSbF7xfdxtcloSc8XrCJyA/WQ\ns6P/IIaWUUr54GNLQR4iCvMi/fhAviN6lqlgWsJF75ibcs18Pd6aBzjSvyYD\ndO3qGxVfUUA43ts5WiVnPPYfl9gJyoG+QVBv9kbWTsVcRIaMvpNP3CXVtebZ\nUQp4OvqH/JkMKU0yfCgQdBW7j/1XlXdTCZtqmjenpEDIPZQQi7+FkYmUMB3h\nXXqFyrKGAVMV0GTUCwlXuQZSNoa5tXxqupQTBVm/DNrTOuY7wb5NLd8C6s+Q\ny6S4vYu7y8jgNRv0zN7oaFlUphAfF7RMd2nTbuuKuDrDJEyp6Sn9fTvGg7Y0\nowDy\r\n=vg/9\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHKv3FT5uENi6gmIQzE3MOVaK/fRaAHl9lb1Usy1Nx5cAiEA/yGjk/OTel++SyNS5uG8lN09Xd9sSwWR46IhsG1V49Q="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.103_1585655856062_0.22740919120861203"},"_hasShrinkwrap":false},"0.3.105":{"name":"wgraphbasic","version":"0.3.105","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"87cf6f31b4dbdc254a253fad68740e29b63e4010","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.105","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-eK1mY/iRhIEvvri88eT6fIClhFo2DmJ8McbUzP8ydTXKxu6sVJtMMmgvuYtAkBrRcoD+483/ipzR8BXcDtaN5Q==","shasum":"42d5cf2fa8f6b75d545fb707274a5d8e6e545b26","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.105.tgz","fileCount":10,"unpackedSize":138262,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeiZM5CRA9TVsSAnZWagAANEkQAIbp1FtLxX1pOlEI+xeG\nspplbyZUNwdJt8v84Kp1k7qr4SqUU1m5AQ4zVK504TyGyeDUs2dnXgqQjd8X\nb9apoNyMdP1wIUDXHB5knaxZ838V/LsQ8PYuquJw7aIrYX4sgPj3U+PdmILZ\n/4HpDf/Y6QkHe70UrSfgyPI2ID95WU4AP5IZz4TD66XTeITUaMt9FTL8Ujii\nQYh9KPiZKmsLRSsPsJXFWXsJS0QZb/rKQNR/Fb2uxeHGxBImJL9VHVIJGV8n\nVL0MzeQVvrMCwOq+FJ9Sapa+8oQI3bcJPn+tJNUZDzKzynYSGOhmyNHtVbjW\n9/FABAWiFELeiSad+V2zMpO5qZhKEVSzZ1feFdgWdndJVfJD7AbRo2/MOiyP\naa7RSJnw4DPmyuTWdWpKmO41z0v4IwozAWIsVC/bMJ0bXOzczbEm4bxPV3WJ\n0aYyO1hxWUqW/GmtPtxMU8fkY+o0CPIyPvdzvlTF/OK1OabV6HkPPqFScCHx\nxPPY5gLW7JRyZlg4JDSzvUDFSKIMhfd6FaQejqd/xiKqZ52QepCh1IUc645U\n3YZud3Xbc3RIZDHHjw2rVb4we0fA37dMEoxqR1wNywdljapGJ1UEgHvBvZm3\nGEg5LVOU/GbZ+0cXXj/vz15R9lrjcic/2O6v0h9lMxxb4/XAG+JERbgU9kS7\nl7FP\r\n=/2ze\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBr3B39YpPmaofOZhd/OZvGzwDcrDjZzqsJWlxyxb8TjAiEAv/VO7V5WuhmjXAp475qf9m+QXicz/oC77KJwDr3nPxA="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.105_1586074425175_0.5997848799330576"},"_hasShrinkwrap":false},"0.3.106":{"name":"wgraphbasic","version":"0.3.106","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"e0ed21a5d32b20c9d116a5a7e399a49b1cc7ce8c","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.106","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-RUnFxYP3oxm6n20tL6HAS/YcfuL6FFVLFb+1oUh34SX8B/wHGqvbOrVcf5jpIEjYX69qQfwPM5NWbak1zIg6Gg==","shasum":"a9875b9fb79efce2298397be3691f1d4e4ee3b87","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.106.tgz","fileCount":10,"unpackedSize":138262,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeiZpICRA9TVsSAnZWagAAKBwP+QFO1Qs6FhoVKjUjDZQ9\nFBjLuUohrDSkg32R1H2JUMnm/JUtS+dSF0RMIYZ3x7ETJOHjAccaR2Z+fT8/\nT/vpEWyz9uaPNJs82MyvXKpm6XDJmwrKUlCdY8fp7xuQ52mzRjuqRS+Q29Zx\nbczc3st6vwR5nryYz6GlA79q4Q+TZ0C0rCxt8Z4FTVPRiYRyDr05RB7BE7bq\nbs3hL+N1V7y0/w2t1+Pups4vWujb5l3cz8GY+Ieiq+qVAXPmUwYf5G+u1kpa\ndwIjxsDUgttgBG/Uy0x7vw6z+2EO7JW66mevKdWrZqxsJcCn6N3PZZsMzKEH\noHlPXaKEydT9I6kiBdKSYb285SBB00vkmuE2OtoQh6ZhhCeKZ9zytxAmhzz7\nWHP9iIJuTsmyFRxFpgpJKKQqYsBg1JtF19tHTPIuybn+OJxzz8zNYlTySK9F\n/QRMyv6kafWdVPia6f8weUGS9tC6GDWumXOLk1QBiqCp5HGIR7mfOH93z5zT\nMkbF90vS6yLZfMnYFqiyK/0Vn1jBn+RL1VCgzwcuEFTUhPiPUwqEINLRUoVa\naFWuKGfKLMcGXH+Vdw54rkjr4ZruKbQHh61p3N714cQF5O65K72Nvkp1lsEI\nDfKTedEO0eS8yK+7mrnyJH53gFn/epiVhuAU9R/YzPiKrs3ub6WIwYWD9YE6\nHYyg\r\n=P86k\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDqBxa381YqRFznNiFYKchKCsUd6RshVVjBvc/+p2DpGAIhAI318XdIeU1goHRfmPmiUO1pt6BjLdnQSQP2d+1nU3EO"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.106_1586076232263_0.3656442537095663"},"_hasShrinkwrap":false},"0.3.107":{"name":"wgraphbasic","version":"0.3.107","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"525d29dc4417c8fb4d858dbbb4ef180518a7897c","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.107","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-qnp87QOAfXFtOnM1t7J7zGDXOLv6MrjL+qj1i919001KaCN5GdHgmTBYa33AO1JUYKFl2yARhtsWIgvNaXsRjg==","shasum":"cfb23f8da962ea61d9141104697d22437097e2cf","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.107.tgz","fileCount":10,"unpackedSize":138262,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeibwCCRA9TVsSAnZWagAAjYMQAIJgOr9W0h2O6iCDHC6M\nk4nW4qCB5ulGb9hPVMxWcaciIl8dZazJ1cjSZ8QBVPxkwWzVXHXM3v08Chjc\ntgNhxAzofLQ7lXuNkNOY2oShYqHUsYwYc4JrwESu+4c1e/3V3xrXbXYT1mVu\nP4k4rWU+YSYdqqNMCahWSrguFQ9pZ3UlE97hZlgfYN87Ar+51q6GUqsN4Nfg\nUexyzxjzFt6f3zBzdFIDEKcFiBXZFE2LFk2NmonJaivVSgOh+vGcbiH1NlCX\ndV+TrTuA4GsokwOYCry0Og3qr+MXIdqyVaG0db1T31jFfSxz9r24Q9BGG53B\n/zS8y4UC4d4gvQHMdM7fdFtYuyY9jBPVv6QWpZfcWCThHWLbvppB080j0MQv\nplNNEoBbVdVtD3H0ZSVemVX4O53/h95KhJoF8YBxM39gVEXIJg5jQ62Xnp5d\nkpvcYgy+m+uAJDN29BbhM3av6dWid6LHgj5wTRhX/ya1mw5/yE+PEbARNLoQ\noIuczMJXfaZ0u/LU5bo9JRfxFmS5mLa4IuOEdM8oXyqExtCCuGBAOnS7Ql7l\nP71OzgAhn+JAUDvuLdEHzLSJ/qElMeDZM2Iw3eyRA5AhknVYEzhyd6k/2c3j\nJcJoO+hOotsftxArcmZ3PPdtnk9dl8GpTwqdzVpYn8GQOJai/uJ352C9WIS/\n+uHm\r\n=yRb9\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDhdYt0/mIzU5hfH654qpYEuhU0rmZjhrW9Z7mw/TWfNAIhAJfAP0aQnSxkzNDL5q7WFZnygK9EPL/WPJ70qCDuPckH"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.107_1586084866187_0.2727309334129002"},"_hasShrinkwrap":false},"0.3.108":{"name":"wgraphbasic","version":"0.3.108","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"a2ee723f9bfe6a73fd71b438b5629cacfe3a7107","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.108","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-6GGdpPjh1+Y9isbSY6j4WFPIxrAWYuK0Y9D7U4sx9AxBFCwqm6BZJ9lT90SIDdz3O6vTM3/N+N2xPt5+lc21Jg==","shasum":"95407c969b2ce5e608f76958cf6162be5f16a6ce","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.108.tgz","fileCount":10,"unpackedSize":138262,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeic0jCRA9TVsSAnZWagAAOEoP/1lq2FIvzfdEcY2zzjrE\nRs8x+U4a+3HCRNz2BfRmRKhC1qfpQxWss2WIocj05NtlvaLP6FhfpxF71c9v\nKdqfHFFJM9onDMLnhcinDtrYfAHG8MwVruvypWvf1yQHs8rLXmY3pKXLh35g\n3NHFAzfUtMXwt0PSEIUcCK1GUfIA2/4lsbpg5wfc8p/OtusIyO5GDHQAoBeP\nROIZ+r1z7sYqK4DlcJ2Kujy5LR3xfH8AFt1zDcghj3BA4CDPBM+U0xoGpyUd\nkJ9OYDF/crYRfjSr1sEmeuXKsztsrV9lY9F9YMfp8L66VRbsrGvx8etM4RIC\nBQRDrqpxm2g/IWr4CRskU2t6T2MVxWtBqxIpFR6RTffuADpQ2DCmtVclQh6o\nzvAx8RORQkdZb6z6uQK3V2eedJzUh4A5NgmsNf3BE6CSE6EuQuW+bKNntatR\nEjSI529Z7WNi53phVrBOYNHKa/SH0V0Y5aAmXg71sOO05CqqSB5W75gT99xl\nhAxj2/Cd6Sg4RvDvbriAu+FwDy3jdCzcL9eRABo2xqIUu/iiI1IcyJhNgDpG\nziY8v9IURntFSmRifdIx9/WhCwuy6+2z/xKP3oIi6p8QkasP/1jmV8jfIrmb\nMWWhM614A/38I76bEiML3WgHGtXuQD9XhKKRzPz8HZgu23Z7z8YqCvzmSouM\nZMHT\r\n=Bf44\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDOSmUvY3eaX9PIC/siYKv/0Zk0fUXFgJZo3hNzoeeWewIgbnQz2YKNd/YWg+7OSBgI21SLktu/axLyL0RLLDxTJU4="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.108_1586089251025_0.8897845691699964"},"_hasShrinkwrap":false},"0.3.109":{"name":"wgraphbasic","version":"0.3.109","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"2e45b9ef270224117855b94c802b4661cddc74a5","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.109","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-VtbSdgFaWBd0lCaYTNzz5eDxOo8JTAPBfLFO6z8DOdoyw54fDf9GhGoQHcYlBDA88bV8VLvYtPo+hzd4glXx1g==","shasum":"73d1168964bca894326dea258bc7a9281ac0d861","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.109.tgz","fileCount":10,"unpackedSize":139321,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeju5zCRA9TVsSAnZWagAAgPwQAISVM8fTQUg6hv6MsdpQ\nthkxCvTPu+S0c/FMCVGGfQUTeKYWC0s0Lyf9NCzR47ZlT5oNKfZIMmvN1uPb\nRFASFhv6YX3yEO1B6ycN7bs9gDbmc5y/6BjKXnYtY6PYvsb2YilcmVMfAXeB\n3BK406e9Qs6qKbeoBX7vYkw4U2pCRTHYouX9Bsmg50wNTm2dXOyrTPhDY9XY\n6pQmumuLg096S3rF64te3iX+TWnhKA33osyF/bLsZrApWfqTD+CVKDDlJ7dQ\n52RoshMxtXu8uwqYd5i4TMB/flCZhLAjsiI0DTUOo5gJHSCDEqFPN+dOlQsz\nQ6WXpXPPFHrx+U5CMLn4wZSLYs84iMVYXLJzsOV8eNmXDyGFbh3+7OZNTdGp\nSnRXGNOmu9sSFbo2YjSvDB199gE1YjlccMNwBj/U6zJbgGgfvD/kvmCEXdqI\nXxbActDXcmsQmcT2HViKUpSpnjqtnrqmgfLnM9pji9KcFQKeP9P42nqMh6ej\n/AiuTXw7EMeSeEE618nUeuCBL5CU82ZofZFifW3UvHuyQr5vWqKuclRLygjz\nA51h3S0DmMcsfUKB7DIINFRYZi4oPCv07ZBJxC8AzryrENZhRjPTrjLyML0H\nKUnOY/vH6R/vCbGg8Xig5mukMWvVyRZU3E/BckxWkwupdEOAP/UtWJTX2QEd\nuK8K\r\n=8fn3\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDM2miLqiJBv+YzmIKz078o6xP+Rsqb9BnrTMjjSEbnjgIhAIwGemhvSDSwfhdd8+Jp6WhZd88m+ZDRqAB36Fo3UPDe"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.109_1586425459426_0.6615818302317564"},"_hasShrinkwrap":false},"0.3.110":{"name":"wgraphbasic","version":"0.3.110","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"6d2e40abaa49d90dd790f2c664d0ba9071946be6","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.110","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-zHdkHIYDzhKqpYOVR6yHNameuhvQNVRwufVl1J8RsK/q2NLGhfZhxtdbeI+7SptagnYP1tgNZQbHfxvAFvyxdA==","shasum":"faec72726ac7d6b790072ce2faecf64c3827af05","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.110.tgz","fileCount":10,"unpackedSize":139321,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJejwYsCRA9TVsSAnZWagAAolUP+wdIc9mOTzYoINMkUTJn\nq0eC1JsfSG/HXH4nTJHhLJiLTh5MisybdNzwXIOz8gmRZo1u/U4wJzMpd9SD\na2ly2+7S8lhOdw/gkr5elW3irV0rCZ+LMVFHve0M8uJY7Klf3p73tQX7bHyF\nCcixgV2G1GGEssHyZmHhx11U4PrTXlBWGNo/EehN0vncO9NG8COTWLe7gZzU\nTP9k4FRVGP3R0Xan8UHaa7oqA2SMHdkVug6cVNPeUFGUUL/xGaHfXUh9cvP5\nnBCbP+PNGdNPpIzyh35LW+k6B8yuL8irGhpVHOoMi2iEVC3UIG5iRphxEvLw\nRNNQf7nl5OUYxuvbv8rzk2eNYeVD8ofISwCjYHFbRgAyJnwcqOeMy81EQRLK\nnz10YrsQITdA4cHP7K9oQXWlrkl2/xuQlB/A4/QfcGN2qhilmdYeTKnv9/dw\n/2feUhNggI9VcVutnUzHnuZV7zxooNFiIp77iGwVVvMX6R69BCmoMq4wYm1Y\n4qu/Ieqw9LMeanbYqO5F8dxrQ0/GOXfytx/HDe2iAwjWh8rEJGWHj6F1Hrsv\nHCb6Myde9uqOUuQxb8vqkpsUupvjLMFkqVR+sTQ+pp3vvttRGxj+Lz/yQQ5v\nm11zbhEdW4JTV2kehgm2H5B5Enm6glaMVze0lIi8jpVFILXQ1lJwd5QlvzBg\nHgmX\r\n=hfFl\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDmRf0HhI0BrLekUT+Im6ZBM0B05O0/SIv/fg1yEc8YogIgB0tb2+hq8yGhyD1+mns2KZqC+qm9ly7pjDk/mNGDHi0="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.110_1586431531524_0.9913861316513248"},"_hasShrinkwrap":false},"0.3.111":{"name":"wgraphbasic","version":"0.3.111","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"c42409c25e8bc20894355a255196434bae0f4214","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.111","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-gJWbT1J5FRbgG8uOFtG+MSTJnVhNoZnqx41HljP66z1m+Sf+4RM6Is+ZkYf1x9IKadfYqIljhaP9JrRRdf0CJw==","shasum":"30de5db0c90e30df6d0ebddf14abd75c3ac925a4","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.111.tgz","fileCount":10,"unpackedSize":139319,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJejzAICRA9TVsSAnZWagAA1qoP/3v/2UCo9/iyk0rL2IRu\nNHfbhdXiTzgzd07sVhfpQ4FnaEFuVwxyD60yJXkM/4mb6c9jHeOpkPcbJH7N\n0Xx09XEe9q3riIHazGCT4Ezlkwwgg8yknudhvrpWoAv87gNbKnMqYCFItZLg\newn/K1ZuciCTcEaXneia/YipMph5sdcZd/jwyAwb3loEkkeEvwC70NxzIKsb\nyvnsCSCnHYrsbzpkRJk8tEPnsjUE2m9+2IhVh1F6iWOYo9iBe1Y1pQCk570G\n0hSTe2EmkzvX0Fp/Y6P8A1BcA49piFvWANyRYKduAgoRGKjAhV1ltglwYQhn\ns2eVJjfM+vKgAUtb/Cqd0zNeW3wOR/O2xgZZRGFjKFblsQngH9oSwFKL/Qcg\naVj+tEAtEZfY5RQQmAl8UNMiwsnOwT9jsOuHs+4tiCh4K99x4vwUCFtIUQEk\n0U86UJE1eZqI98Ln/n5NVLte0ZvYvAGiEdI/fbj8uRNsuMNq11WHIaZqI6G6\nNXTc+DSQe9HQr8qJN4TCyXTEK+4U6SQjx4r0sWy2kfUEiMUIwgsY9Hll2Wyj\nUKsWoHTjlph4a1cs6XTAoYbhOmOK54sqHiHr+eFW+S6OxCJ3qdAmVKxadzgJ\nRAwrfvKLY1LJkh8+3VvDyveULLFSgZIBnR+Hp3UP70mXMgbfE9/eVwxSHxkd\nXmID\r\n=hklu\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCdI6DV2kagd+LhH5YsFomy6xoT8S3cofqdnVRi+nR46wIgeEEZRUxTJgyW4RECWOTrHsTKZO5iAgiG+O4lb+3pYwM="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.111_1586442247889_0.4869436098313791"},"_hasShrinkwrap":false},"0.3.112":{"name":"wgraphbasic","version":"0.3.112","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"b5ec151989669f504952855f85273473564f77ed","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.112","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-ZH9z32E0fstlnjI0/zLktQlrSN9wizJWvA/clS72dZiNmxiLdCtxmLFMGVO+7T94wXzNXh5v9k89OuB/BJxMHQ==","shasum":"d2c80cd31c28a652b1fb3635a06794baeb31c50a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.112.tgz","fileCount":10,"unpackedSize":139321,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJej2GVCRA9TVsSAnZWagAA0xwP/03EAmH/qj2HzESFEPgd\ntpxgUd1rL3h+gliUya2in8EAALYKXBPzlfMHNfgcD6/UjnYduWleRTSMd6cS\nlysrdKS2E6hVowkIdIZGdepbQqQVpRnb79o4swgBm3PHiyiHfDXZL8ROmfHt\n0uJMATrFdKmGPKW3MBKfaMFpYTlBkCRVRbE09yBQPf+WhK6OtANimOczwiMP\nXK/9vj3daZ+XBSl20ZR0z4n6tBqY9IhyOFZhmF1R22ovpV3i77oIzsyKKjRp\n/mV5bUetnOHmH3oeK4wvUUclL1Mp8QY/ZY0cd6BdnEWJsJTs5zIwd7WPYlw7\n10KyOAeppbBv8hiPUUzQE7hD0EH4dzu1aF4jzQPsmfZM+USs4aEwWkF+EGF3\nbZpF9ldmkQZ2YG+GsFhw8/Uv/E39kXR5mPSk4AQ01goKFBH2WoNuqT/KDThD\nbhh2kt7sjcv4KpKXUO/tEgBEREPzJ17XGKja0OIBBOI5lh32/wY/pDlODXPx\nS7z1Sy9terxOkpJVtckiZHfBDpGjlUBICQhAcv8H8j3dHTyrH4Jmj0/2+CvY\nU70wnaeofKstkN2Rhz/lX4/aALWE3r87J5ST9AkQbVWWlABxCbsiGEDcQI2e\nckYn5PSxK+eVje/H8aNwzQmSUySfDhLBzTEM7JPcjPo9OGl4EppG/PjPZCDK\n03N7\r\n=nXoM\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHks0uUaRs5yFMiS4wuCQNYcQAbRs4tw0LLPGFcB/bC2AiEA66VjacMnThYXX/zVS7FES3wMDnr80nqBkQDUSA6sg6U="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.112_1586454933392_0.5627503291751528"},"_hasShrinkwrap":false},"0.3.113":{"name":"wgraphbasic","version":"0.3.113","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"aa44f2074cd353d884528a720d68f291770dc32f","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.113","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-x8nrSycGkU74nXIyrWv1cyUEko7FeNls3LjkkULHtJc7TjWCgqwYNiEP4QJy1qyZFTy0pyAbFzoHDggYDKOA1Q==","shasum":"40eeb1280b6c6fd7b6c707630ff98749bc0e6033","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.113.tgz","fileCount":10,"unpackedSize":139321,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJekGGMCRA9TVsSAnZWagAADNcP/jG2v2yB1hwCe+ev8pPx\nIl/21YT5iAK0gKVOMB6F3+xCfy5NcN6wt6XddUf7AxaX8YxbiglTSiJDqnVy\ns8XXii7hXW6Vm6F0LxSp91bnllmRY7wAN8SPcHE4axhIrYzx6bCzVRkSmRGw\nu7Jk0dQp5RCuvy+8r9XOjTBZu9le7IkQvP/roDqQUl7vB3f+/fn3rL4160RU\ngcdlu2KaV661lbvD2O9Q6UrnS9HHpx7Wuo41T/ll6CKM5A5YQdZ5ZFlfVMMR\nPpqWAsQhVyrZkOLhKaXJrPTI24yFPnzcHGw2VTOS12O/v1MMorAu0NSO6DiD\naUbEVxAdxlAodiUnNxwMj7/jUzRXj/7ohfloPCB32I+Zguf4aELE9Kqb2sym\nXw20Xmp9C63VtA0XiEttzZm6zxctrZWHAL7LcSjmVOuGelm54pT32gTdytiH\n+gKPt5/CUpeFOe+atq1LCm1N/XfvrFdchecRcs9IwOWHIdXol4j87t4Y30ya\nWd+55TVtb7R24O9UlrbGrvO87fQMA/JAO5fdPGdiXH5WqpPQ7JjXB2i8wBwN\nLBWKfLILXSAfxzJw/40+dE/JxAW1xN5eBJQQcN3Fxm06YwC7OxsSPwHxefTd\nuDByZ6uMiqpiLi4U0kyrn5pyZLI9FPQwX7V8do/qLLq2QB8SbTn/nBgIp5zZ\nHHZ6\r\n=Vag0\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHX6h6tMkw5BTqK9qJv8yCaSQ6EOr2s0jUZE7rHl1pWaAiBhprSa4G/UIsMx28Ct7ztLr6EBTms+JhULZxsrajXy3Q=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.113_1586520459970_0.7154194122830482"},"_hasShrinkwrap":false},"0.3.114":{"name":"wgraphbasic","version":"0.3.114","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"212a15cc1a5fee04aa4fc99ca57976683efd756c","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.114","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-+518NhLEzM3v2b2oeTe9ixOh7RhJDvQbDOmMb3HEmcKjwcR0Vy63wE3SEqOcAVJW/uz7ZdKAxWI3nWKgPJTaKw==","shasum":"e8fe15a7702d293f8eb30325f8fa1eae36a67656","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.114.tgz","fileCount":10,"unpackedSize":139321,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJekIOYCRA9TVsSAnZWagAASr8P/0+cTpzk9fpxalWBmwU3\neiXlwLCIyx0prULLhzgntOhU6TvPZ05Jl7QPkBliP50PsZRe4dfWr6cd0MVo\nuWX38/LrEZ/eaZ4zdP18PN4ZQfO+XMJNHpKwDmNUBIExJslEEWd8l6Hz8mVN\n4DfHRm14CVUOYrEMSYpoUnN/jmXH3MCOoJ7/tf/1bXesnyFLVtUQk2DmOnnQ\nsUTQA3QF4SV1DzCyqRTWqB0Cw+TQg6Rinfu79JXA23YGk9wLf46K9K9I+sXH\nQpdjbRQj6hXZfQWk+ec5zSowcHWrwpfJnGw9bIMAyvAjTrKx+E1we8fsJmKB\nw9LyOas7H6r3bBtyvUtA6wDSnEwI0sr9u7zWlGP9dL8yVfdetrpFLD11hSe+\nIjGk7au/XxASs/DAeBmJca4wZkeFkdWJKdf4OWdAqhlyBYdN6uz/ojnHBpdc\n3JUkuA3D+M99dkzFYu3Hg4yFLzchnZKU1hd4/9d+BtQb8qq/wSpyTa7+udu4\n3ZQFo2uE9szC9c05u360/ETrSQfJP6Fw0LF8r5q149CcW7d0MqGgzs/BKvEc\nRYpWShMarq5BWc89IhByoKQ7y9pbpoI+cuzlO1rxufgJJWatxE6IRh98oGun\nlXt5CPopLmfjycg32/TWxEz9i2M26wbYiG8ql2ovCqNhOxZsJk8ukSmsv5NQ\nxA61\r\n=rGVh\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICoD6/+nEct+A1kItwAcZUv1omNsgn5fTfjoaN75E33XAiEA7WsSS9Neh3FkfR6uXZfudoGUZlKNHV0dXF2kKNncfaQ="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.114_1586529176061_0.6784397202112062"},"_hasShrinkwrap":false},"0.3.115":{"name":"wgraphbasic","version":"0.3.115","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"ecaf8459c8f61400c6dc8bf7b2e181e86c35c784","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.115","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-XooF2hgxqcrRss1178poGTOoGPVuAt3mLRPvq4t1LpBw7+w1k2nQCP+2wq6+iPFvd06SjWof76u/xNfssrnVig==","shasum":"24cd0012569c130b5715b4657e26dbaa4881ec66","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.115.tgz","fileCount":10,"unpackedSize":139320,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJemDO/CRA9TVsSAnZWagAAy1cP/0gPI1MEzmCR6xwlftZ8\nNrkdP/o0zzRmHWtwEMcA4WOfbwQQAPQx8EvX/HvbtHVbWnje4eCVSwq+Rvet\n44OEPzpG+5YMHlkTkTL8QELEq3M8BlVrmGNZfdAy8ZLQOQQaTObp/xzvPYh+\nDYP3isFwtmWVo1vMLDehNmstroWwkCDlfoBVl2qqlhePOW6eij1qg3GVeL19\nP6P7c8VFP8QiGGDeKN3OPmCjTQgCLayxcLY/4uU92ZLWkV9u4NWCPykLDIH+\nCKU2MZ7gfpyNXIbx2HW0oWKciNS+ELUeS3k2qtBb7vPsSXRqKJQ5Cif6ZvXF\nKBh5Ox8R9ZVuOBR2P2oOri3YWm+eq5ZKYzt6AGs0ODuowAMubiWUiV0Z1VLi\nvQQJExGM0j59+FvhO5vgGEjzwEAkXqPe4YLy4OKdtmyyaY5WOhL2T5IeCBNl\nvsXZOWQ2/3ClvmN8hBbfnKMhyozf4MgK4EDWj151J6oQv+FDAOCXP9vOj7WX\nKVHF7BB7Hp7KD4+RUoScJOZDo2QGQ0owKjMCnCPt2A1iF7I3u9bbCmiBa6YH\nA7s+enJIdYQjpzOpnT/0JzaqXzXjvgat5is1U/7P5dPuN2pByo1e0UARNhwG\nNrrAxiscfSP6Z0mgnsyPL1wMwd4ZKw76r3L7pwIlkR8B6mZwKZV7L9YBTHTq\nYtbE\r\n=UXbw\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDYu4i/6eUbI+zrAquol7EGLIv2AyrAEwoqGgozJyeJEAIhAPe0tHrd41KSO3m3oshzHctkxW7xRlsvK+NlIuJgpVVU"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.115_1587033022604_0.5962537000677965"},"_hasShrinkwrap":false},"0.3.116":{"name":"wgraphbasic","version":"0.3.116","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"aba187e835928183f94782f1551a46f58bcc3ebd","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.116","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-tuncOuxpxeNkx6zDbf3CbeYsY501h+x8xyIgn3gC6Wm8SyNTSKX5sjJW8X7hUzmZwg+yIb/oQ3SxRhIuTzlh8A==","shasum":"ee8518770d2a1338cccc253cb5c2263eac6295f7","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.116.tgz","fileCount":10,"unpackedSize":139320,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJennX2CRA9TVsSAnZWagAAqj8P/12gjeFePcbiFXlmfWP2\np1ZBEyJqURz3P+8Bo/4WCsgakrdJOHDU/BK5mEdqex4EHnx0El1hWtDU5JGq\nqzKxec/l2oz0khoXWLxdBWjegoIWxs6PwAAilVY6m1EUSN9XyvLOVbsSVRru\nPVNS/2MBT78Ra4eSw9oijv5b+sFGooC9KzctLMtUIYyZj8YLE0qI3qLyuJN6\nTHpo2Ga1jt3k0TXr6/phNe6APVKGnagcmEfLv7JzY97Cp/sShQMhvdt4umBc\nAbh647ykgXJ+LHOkKsqkFVKkwQ3607qKLfQaIeLLyYnCX5Ylm7FeVUstoq6v\npHoHKMy50fnb6KqoJ+ofiycb0HYUVcerw/U7vySJTV3xhHaSTXi5S6h95M9c\noA5gpIGS9LXKS6YdtlSBSb0rQRb2ECfDHcZddQizq/ouM7oaUfhk5vrTBZQC\n7eeAUGwu3IdWHgW+OQKTjmIi6GPbVU7yaGwObA+5WF3CQlyx/T/RldMXZIhA\n8geLBIHZU8IHWD8+x/x5kvwSrzkl3bdK54ZHgidEm9a4wtlcpa3MAxQRZz75\n1FUXEm+7RDr4tkCtU0j54q+nxbtusJ/pSjDACbWZ2FbvYc8xz2FGBEGqkCLT\nhK6Q+49HyJycE3/HCgG/5DymetQ7dc5tc410TFf7K0UQMYZ+78k3bxmmAW3c\nxPi4\r\n=+ys5\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHB85Fvmse3SzMetP8z88xRznbq0NsKr4MGrBWBbxGJMAiBXDsLYp90jrysEnU3FpIGuMXnMvNHz1vD8u32vTRx2tg=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.116_1587443190454_0.7574136480586391"},"_hasShrinkwrap":false},"0.3.117":{"name":"wgraphbasic","version":"0.3.117","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"6c35c485fda698a67c36c670c463da6592688d98","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.117","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-0tgF9uGC/D5+nMfsaIvVLrsLd94/OLqAnn95B+x+oUIS59twJ4FqV/ctT1MlsU9e4QJ28tWSU/zz+Zg1pmWJJw==","shasum":"2524ece9af3825790e297095992318810714c63f","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.117.tgz","fileCount":10,"unpackedSize":139320,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeonX8CRA9TVsSAnZWagAAROgP/0/6SRV6l1RXw5NpNLMS\nclsBSPrfYfZO7ndeM6eRvD4zlH/QR0A/J228BTWRKxMuZZARQ8if0R951LT/\nYl8FQMvl9Sz4Tz3ITiqV1DagmbijFpqcw692m3AY6Km9wq/kHcftDmE6zYrq\nz5eYjkkHqJxAULejferx71MxTAAoqo5dLx9JEPoI6MbvlLpAgIKXjrsvjIf2\ndn0iLRDLzaP9y9CgK0yWe69+/BVmZuTIz6X87box7EWloraPoex3ltxxyknP\nDs0VAWR4Z92egFCDq/fTFF6vS8FTDXdMDvCxyIz1rf2Cc8uOoSfolTbHUuIU\nGyR8U/QL4/QdWnxb4PI1/1Moe8BTvSv0Q/m3DQ0jdhRuKRlpSHb57T+WwzFZ\nuagERlbwRUjtECo9IviVquTAwXfVyY9wt6BCxG5nZLRT0IYh5x85d5v3yc/1\nlWbpLtsKt17jWeuPa3MdC+7B3XE4FSllcnZEL72F06QrNPY1QoIOrz0rnRro\nrzvlunLDWrn+sB3ED/iSTLzFEbzTXOOWYfXPguwQEmE2e/K/TCKhR0YMUt4y\n6+Bu15o/JErKW05g04a3kp8Mc4ZFuuKWwD6xOpzLXDnVcCL6V7HzQ7xmArAU\ntc1nEDGv7U2NFbXj/tUYQCR3+5pQqLeMVtg2JTbnZdyJE40ZmmfhhaE2LfsS\nDLFh\r\n=PtT6\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCih0je4ex6rhFWlFVQO5jOdQpXAuzzwnSaFbRFzHbkRwIhANVeapUZjU52ovJwfW3E7fMAklFj02UehuJ+HMZcxiR6"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.117_1587705340268_0.7815862539684797"},"_hasShrinkwrap":false},"0.3.118":{"name":"wgraphbasic","version":"0.3.118","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"438941da5442fa70dca561a6734977ac8a569521","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.118","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-48EP0cRLttDben1SclO/EzHBU+bOWxsCdnsvW0Betiegk3YwWHxsRlzdHm8fWbNjE72AY2g71hKJRXxG/ROXBg==","shasum":"916eed54da9792e8892d971737bd7c40193b1e1b","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.118.tgz","fileCount":10,"unpackedSize":139320,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeooSECRA9TVsSAnZWagAAeW0P/1+eOScsKA6EhesNs7Wh\nqZDCBp4svJ06BfOASok76wY5+CCpqqnTKgeGINlwAh54RWVe8kX4BGgaKsGf\n5cKaaN0DDZf1xwvrutKasQQSymYtitYUJBH0+9A9aFahbxcWiVLiSnLPY/Tf\nY9046Rw5oo0ha54nsMOfUBWNy8MfIYXM6UvnNQF3rGQZFHE8JQP3ejFd8/K6\n90cCSYu8P4/ELtoAW+09bIKl+JkW3xTqYVTA7027u3nwKHxu/ZRvpUpp0kap\nfRVgrEyMzaigpGV2JGtAvKfAwo6fUOvwEjHCHe1dMn+QjGusbN5g7m2mjAOy\nvbFGaD0VKbGjjWVL4xnm1bnZmY/HO3FXdagZze4VA+VM+/aZ9VlnL+tkSHaR\nAOE0bIB4KaRdyA3F2Y96cYSEjk7WpNKj/m1c9+YNLdxTs11nBlQUCS8+QYQB\nTMMx2AzN3Hz4A+6UOTBub79Antkm7ajmjyNS+iG3amVEhrsQS3W3hoe0ofcr\nUQPUKtGA/1CR2uooQI7Sk+ZcCqmFkDEsVQCMnXTYE5enYI8gjZbtuyUiN5d0\nnqhgHrPxQxVKO4Reb74acpygR94/SgNa71LyYjCGswLuOl3XIp0fSxSvKRkg\nPbfe6C65G18fkXVdA8dRcCjq+YpSk/o+nnA+qAvj1y7LaAnhmD8MbTHeXely\nb+KI\r\n=38QH\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDdDWRM68j+m6Js3rJ7tlyQt7rGDBxahkzCAyz0RDw3VwIhAJ85SP6Baxui2NV1OgJvG95oe1kpK/SUOsnho3dXwD3f"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.118_1587709060144_0.5067501182774319"},"_hasShrinkwrap":false},"0.3.119":{"name":"wgraphbasic","version":"0.3.119","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"0232e4363e4cb530711712dac8415ea640734672","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.119","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-DXrJkhbz8zuYnwVOYqW3WCmKzmQUrj2tRzrO/oniDMIvAwnFtRWRcLTk0Ikalvc15rYWgMvtdFoNfYVHNazclw==","shasum":"79280fc532376d2967e336f68893e4bec7cadd42","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.119.tgz","fileCount":10,"unpackedSize":139317,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeo/1zCRA9TVsSAnZWagAA/uwP/27U6A1ZWZchiJxLrE9E\nFTZFCUQ0nedQmw/EnOd7NzwyOgJ36oGqiYSpDILtxpskEklZHMER1+MnYiTv\nujOxwHkInI3GXsjpvh34++Ah4wUIxXqbqBdQNsf2VvuIEPsxdegvRZu0Xb8b\nUyhCQGRnCsik2MlGg9ghcx134Qcw086Sir+YGcHcY7L9jKMUbVJkPNy832sL\n4q4QJwvJmCEqHVgNVpcXEOBv0xa0EyqgOE7WRVZvk2R4EFuFSEyPUIy/xbgQ\neL8KM0R2XpO9VDmWEP5AY60+dxJYmTfrA+oA+XZBXMctgW/HA1MAtGm6Uloi\nIESrtFzlJnUiJJ+0mXRkklxRTVWlHzHqlLY+G3tNOr56FU8sz8NPKvmISqwP\n9ulyCZYgCrBtJKZ91APtAJgJDZrFkOHC5ggu9P38XiE9YaQzBWXmK2M3gNPD\nUDV8mDnGkEj3lStwOtUAvBwTdelRpX2SHQ+tLQsAHoOXSsvB5caXGOwGD2qn\nDKAB/aq+B+MxSYl6dIDp66yEF5xHKbE9LWVEM6nInxD9NYikI3nbnmnJm8GK\nGScYbEnM2buv05OiHUnUTqUQFNEBGZlouX5Q81UUno48IEOgnjFcSmazwYK+\nLwqRbAbaYLg6EJO6n59+FfOrvstjo+MeaWDbPQGEXvI42nwe+LzNf+JKUDCz\nKSst\r\n=LK2X\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGFv8MqhFaDQGVJpnNb/iUhNTD6Hg/9BVc6XFf7cPsf7AiBncL5EyEt2t0TGRKcK/lEktul6/Do5FSAMYwiL9Hy9eQ=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.119_1587805555019_0.009864034367437213"},"_hasShrinkwrap":false},"0.3.120":{"name":"wgraphbasic","version":"0.3.120","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"ba252baca4c33cc2c8e7a34aeb0f144a6e4ac9d8","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.120","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-N4cMwrdV2ARY0quKhxDYM/QtyBOse0lRvbO4wO/kOzvYT4c01R9pmQfsPsm2+8mPvlq87HUqb6AZfLgyhjPCIw==","shasum":"2812ce555988b73f210f32b88928de10008701b1","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.120.tgz","fileCount":10,"unpackedSize":139317,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJepBCUCRA9TVsSAnZWagAAuIMP/11DjtuizGOY2EtH4Pjj\nZIRwVG1FVFGP7yKWjQCQPLF2vC8Wso+rM4gm5Q0pSG3oe9nyXo6MziyUYXa5\ntH04p8zfuHzfMW5YqcAF66parH9Ju7rVwPAZ+rCv2vUpCpuc0kA8OX5PTAv5\nPYftDyw2qrCC/dl6Ow0mp1Cy0qr35TFdaR2L6T+EoblmVR5xWltuKPNzhVps\nSNq2GmMbmZLqJhBenjA4MgxpnF5yOg7eUr7HbX4W4AMJ8PlJsyM5+2Bzdtat\njRgoovE+2tX5yTB1/+ZOZJ0QE9BdaAZf2W5ytSGE6DeTM7B0b9k1x6/pfV6L\niJo02ToPaiTRsBHYMsU+o4bfDQ4NlsbXVDGr185eAUQwfBT7ZDvxstnX5eUD\nfdIkLHSkJNWdHr501p/O9JCwBjtooB1cXDQrrueFjizu7uLhZ63YHolF8Gsk\nLBPEIuwllOejFVbl2Re6OSVR4ak4axeJsO43AgIz+dw1aWqS0AGtJEhp8lKU\nP1XXMa5WE9dloN8ACxHvD3pztEBTQM07SZtMsWKlGF6rVDH0Mx8lmm5cd7Rl\n1QIywxeqzTqpjtsV8Os0QdzhtZMhAVadRHqV+e2gGPgPlRW0umSirIrZ9nCX\nY6WfpeMdYFIraHVSoqVZLoUcpnvykWMsvOTX2Shch2qayB6qP99piii9vOhz\n28cb\r\n=Y4RX\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC1oALvMs7wbRUPnFsig24wF+0NUDkelvCs5NNd/HnbdgIgf3MUdLs9rmo01pErOCb1paEWRdluMmEoR7OCZVm+6WY="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.120_1587810451903_0.4951409621949845"},"_hasShrinkwrap":false},"0.3.121":{"name":"wgraphbasic","version":"0.3.121","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"gamma"},"devDependencies":{"wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"b54a72cf9f07c441871cfdfa1652bbb63c656ea8","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.121","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-cp0kqT8XcfW+gJczO+rusZOgFMmFWMYlkubt7IuJBZ6nSyS0eQseBsSP5n69L8D7UYxl/NDwrpD2aWhyaZ5Epg==","shasum":"8dcc61096cb8dd1d22114907760ee7c51cfc5b7b","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.121.tgz","fileCount":10,"unpackedSize":139317,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJepFYYCRA9TVsSAnZWagAAv5QP/3Z3Wi/FYYdxJCm+cLVi\nIysUrVXrl3SG1gb7C0lorvYhQmKGBdMyCXJAHz+feDzkOt/k8Zrd4tVmTRTc\nuxQD5tTW2WHPEyJoQ+/TV0rhq3cV+GbmUdxWSrG9/5/wg5FTRhTgaszoayvW\nGN5bdnQfPpY/8B5nPcQgvtzQqpFpN4gKXYjYlOzOPuhUkuwyetwT5OLPf80G\ne9+/KBdX/yI/kfevRZUEy+9EyHnYE+pxFFO+6lFd3yPgWeMhwz3JMbCstH0/\n9zZfGtoAIHV/i0hctEZlTM/mTJNZ8r0x6KIxFqe9puSnnDeKpoNUYJ3jXHKj\nLXvnIOAfwZ9NsiDLAYN4MZs3hnkp4nykZoSbmBOvL+VPGoDOyEVsqvsRK0jW\nRtVZx20rb2RbMhKrbxX4aqfaeKuPQzFcv+R0ZvIffqqa4+WMVSpX2/PvcmZo\n3qBP2BpMn9gMRdJ8xY2+0N865OdohslcAF6K1xiEOX9nvhI1TTS1tMNGWijb\nOQ92634RLkvEuTSaJMALMox14Lsl6XbDdukXecT6u6HyVtWO426mhCxtTcKm\ny8xk3mdUC6U7XfVYxj9IcZrksK1Iq8vS6TlGJa2hd/oAi9GRiV3BpyJCazpT\nMqs7uBpBaKkqOTmc+hYFUFt6/bFRGwa52+uG/wAu6iI+MtO1Z/2kKdtCEGT2\nVYyY\r\n=/9P3\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGmUF8LPecXrN4+wNntzYJsdRHravuwpg5zz4+/JHSjpAiBjclssMv73aCk9qxOekYqVda47HZ5OerU4oUFPlXB8ZQ=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.121_1587828247600_0.9956038328559511"},"_hasShrinkwrap":false},"0.3.122":{"name":"wgraphbasic","version":"0.3.122","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"0d39be8063d142bfb4df3d5da4c1593fc3907602","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.122","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-ZcePnRgfJYQ34wb0dNHvZTZtxP+01fT8y/RkQEpWUvuSq42crWXoyrGqYYZdT1IdFBUUiQgBDC01DVZRWH+Utg==","shasum":"b94193831b9aeffde39da31d2e718dffa30e4393","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.122.tgz","fileCount":10,"unpackedSize":139317,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJepQ0MCRA9TVsSAnZWagAAgv4P/jvop4YsWVdLeLPcLi54\n6Sg4ryZr41ZfE630BnXQGRFlP0EtxPZhSYuPI8D8WB6UkNxz8sIng3cvWPoE\nPVbnoVmBaXwh8Ssr9vmSIwnKZXQvmhZbxU+OM+Q7Y4/IZ9+z+7uxuiVkLzmh\niMGW/yNyLxBBLNkgS5OyZKj8dutAouJmjPcUdPS+rpaH1BMp0Eq1umEWeziu\nEAVg+Pb3GTawQZkKC2bDfvm4n6UBlFeHJaVXai4ydt5E97dpsix8SJZxy9S6\nyeG+qG8Ig3Ucpese2K9KqUXufiCRuVyZuW6mDg6x1VrQ24Df3KpQKTs/s0OA\nHa/mE8mLR3UQMVQoLWPNcEubgN2vawcFpXO5RhSa3RBkxSbJwwZVP3N3fTBi\nJA0Po3BVO+HaARTc3q9/psUqY5vHVTGzCxFZ0z+bM6Lu8Mk7hNHvmH9yfi97\n18RauYXOV2YnE1lYnGsB1TAfs6z30PGhc4wmkrcelU2AcgrRpqfjxIfj+K7/\ngKljNaJy5/MPiHPrBQgLZs5pNygryb9vHVxbG7ad2gRWyvXZKkstaEfma0cm\nF5OFqHUu5uqHxNecga7vDgEKeH/2TrqfKXPftAt0EzSZ6rozJcNq2z+4vBp+\ntHgmVwOmnOoRcYW7WVeNcQYRSO/+wxA9QVN7w6x+bGBA+oEAPyeoj1fkgaCS\nEmQr\r\n=mL+U\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC4/LxnZOvKysfilBZ1Kgu4b5BzSMySt7DlGKFJE2Ov8AIgWKLkwcBOqdm9CkN3THAF71iKLlbrsCy/zDHzxYnfwy0="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.122_1587875084336_0.08200102002452714"},"_hasShrinkwrap":false},"0.3.123":{"name":"wgraphbasic","version":"0.3.123","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"gamma"},"devDependencies":{"wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"c6585f2349fd914b86c81a19db830dbed66a3d83","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.123","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-NaDXFiQSv6/B/IFQuOdpu0CtW3P8L+PGC/Ib2XMa2mM7UN9Y+iBCFF9JX0e7cgkDYt2kpNgfEHsfNTdQmnzhuA==","shasum":"298f75dcd7dd3ed3add3a6f567f37ac9408292f7","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.123.tgz","fileCount":10,"unpackedSize":139302,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJepos3CRA9TVsSAnZWagAA82UP/2gZHn2oQFcWX42BwRru\naVPMQHR1h2OkdS5wEI3j7mheVH02yo51GK3aeutQ5iB5Z22Yn/rFO7wgcbhR\no60BkW82LLgmRg/MxtjhVxIIobh3XhVZbQ9X2eVYA0/IsrN/gC2F3hkWwaBo\nthq5pF7H1oF5wP+vWMQlR4cSiz9lkxns14MMhMRqFzYwI3VZIMWgD/i6P68f\nzY1+c6k3yLckyAxvFRcRbtn1Adxb6evX+LiBrrNhWurT5v4r7KbUyLMUosOQ\nUK1VtVFtnl1yEH430RukQgvxFoFMCqfqUOSofB86KMNML9CNi0NxFxTvtkTp\nJoMmEz3zxJGrtOmALRcFS82DJQqGwf3HOoxakNgXrs/2PujfbwdT+oCRPMwH\nx2QhbHGFdGWU3FkQ0KjZMRIoJXDklHpscrSLp5aG9UMSEaiBkGzyMI7o6nlI\nPn6c9VGSedUWDDmtyEWwT5+TRtvXOL5j/2jG6hh+aSdU83JxVhbF5EwPnzvu\nO+iluWxZN3pLozy9mPE3u4bNEfs4Gjj0tcIYSBSrDKrqPHgbT9zA+V0CuVQu\nUABL1JcH0//GF1vxWrZlIRRTE/ySz+ercTtyUnqzQDW4SLry2I5tRtE+fcwU\nZ0qVyQ3mAHfrB9Gs4OiCIqIKWwbzH+m4fdksQBZviSXjxpR1PCDVC+cui14V\n/WoH\r\n=g+v1\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDbRnRCGsZBVgTCut6p6bw54R1tbEYdGaMy7JYhvMozOgIhAJ1qlpJyWAodJse1fJX9gRWPp6UDcn1hdUrxaYIpRCf5"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.123_1587972919467_0.43039037383482337"},"_hasShrinkwrap":false},"0.3.124":{"name":"wgraphbasic","version":"0.3.124","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"beta"},"devDependencies":{"wTesting":"beta"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"c1e095ef01ca3a498347c853b167a85f07fa58ec","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.124","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-9BbFTSt6KrBgJqHWPOkrzKHcWQdyZUoDsyB/tFizYnTZnIC7o3GmbG6KUJv8LFipZthip3Y1vGYlGQMBl+dTzw==","shasum":"0e42019f7280e51b6eed054be15a113cbb2db731","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.124.tgz","fileCount":10,"unpackedSize":139300,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeps3FCRA9TVsSAnZWagAAwB8QAJyZbySkGiuucSC5lDjz\n61a8l0L5gR9Q9qezXiI850mraB8vqN+Dvsrm54jfGtjUfQ/iwR155fW2a4V/\nKO/EvKPcm0yb2G6uCKPagUUz+soiY7pb3QNl00AM1Q3li5fZC03sAAmmN7LE\n6knDCNoTSaBU1NzizYSPUn6dCaob8XqiUwuQj2UPKBziawjk1d3qO9qHYTgM\ncWZ3r7we6JdO8CGdpSsyIUjpwxgLeLE1v2yCAEZVOQtLhVHTkigFjWCdw6am\nSfbocQ0YwkpKNqg5IifObE6NHVS2rabQaPsQef+WxWJ/V3fUQbzq5+FPBiwC\neVRhio0cO8IHI0/2BaHLYojesIU/HznyH7oun0Sv3snoWYyqe/grjfQQwAW4\nQQZlgVq/vgOfUHNb+ln20IX6309YOWcO/gbMWU3M/Nko8ypJW5HkCWS2k31N\ndvpnsPEOU2rSenrm0OwYRXvduFcBpJMRUAunUFQBtgtrkXKa1sLew9CXnihk\nzEsk08L7f4EdoJC6G0qmHnNc3o80Y6gm2suG7g2vcq6LXTTgaS3v3JdfQVkg\nJ5bfqI471XeSowL3TnATru+KRGs7qKruoErlFTDlWZAJfmxMJnC2cB/ZoBw4\na4CxbaP36726y2WJoPYoJt9Fo2IOCUAk6h/lulWTfgP34z/JrO0UZZ4EfQj1\n471Y\r\n=2/MJ\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEGWnouAXnc3vjVNT8j/DZB1KqEHeLkxM6zYe90cLmoSAiBM6LdPAja5tmuOR2MJG0zoJYHncdeF4aCl68jbGY4LEA=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.124_1587989956614_0.6180432374659972"},"_hasShrinkwrap":false},"0.3.125":{"name":"wgraphbasic","version":"0.3.125","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"6ae818621a4fa9f352cbf41e7b456b061ee787e1","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.125","_nodeVersion":"12.7.0","_npmVersion":"6.10.0","dist":{"integrity":"sha512-xpCOcAoT5wDPD7r6boVSW/7J9lr+vOm5xXsSRlUNjFGn8pXKmPRqDsq8jN1UK09IsIR88lECQYeYuc8qtX2J1A==","shasum":"e36d2270e19ce13cd0628e68e756f75b714290af","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.125.tgz","fileCount":10,"unpackedSize":139302,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJepuyqCRA9TVsSAnZWagAAsMgP/ROkK1KVsRUkdE1ZWsRt\n3UARHDqneMKW7obQTFCaiU9RIR96yktH6/scQw7Dd3CRWgowwNhpNu8hKjdr\nsgGsYcui/KZkfpVTk1PeEzY03avHPrHeHo+USz+W/DehgFqceSoCxkwQhttw\nnNIS3mNaZjbS1C6lPt2KxE9nTVo0InV8GR8noGJmae7FMJOc0HbOf9+HWT4I\nzWhnWPAFNkxdp3XKMqEdbO5L3mRAocsJ6lcT++5ExXLyMOwVQGMyXsk1fa5r\nZJVLLkxsUtQAQRjwClrIHjVVzjtCQcEMLRj5+Q+z6mj1Tat6Rgntu0rNW8+r\npeL92MbCXJzTy9Rj2XbiHO23suvWdKrx4som4RMfBKrP6E7wEjCrfLmZXxv0\n89HQHEINRTOyzDQP6QyhjBwYofBS+PSnnzL7Q39nAVLzxAf2Ufto+Uwll6XP\njVc4ckxVlKltFqh9HK0P+FD4N+KFocwhMWxTMFxYZOSK3p3kPZqFWdCmh1a+\nq+bFja0wKHgsD7/3XsieV1p9Zs/x1WRt9XTJ+Jp9Rh40GT8wZlA/i24CUpMu\n2ipcSozInEAhzNazH+BI3rlWpd5B40TTZTMhHa76rkYP1iLQghfzCeRWxiSJ\n0kxYgnhobwEad1KoKVXlXXEk4QhfM8ZAeSeqCdfSKfwiYEnzfkJgqXuyWilD\nG2KG\r\n=jYEt\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIDif7C7gy+jqjJrGViRObu6ajVh9nzrgLdkXrYV1SynhAiBUPBqP9c0jFbQWirxl1PmPp19Xmz0WGgM0cm2HE1Npsg=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.125_1587997865754_0.15829731265811353"},"_hasShrinkwrap":false},"0.3.126":{"name":"wgraphbasic","version":"0.3.126","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"81249ccf61a03d2e977c03391d29229c46caf670","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.126","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-n0O0E9Tb7hV1lzdnBZezmaStIZNHGP5WZk2IDjOqCjOI3spP3ZO7w4B1k2E8HZMXsvHd1GgX3DKsJ3dm5/0hTg==","shasum":"c9f55879f15b5ab0e60d07ea75442db0195199ab","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.126.tgz","fileCount":10,"unpackedSize":139302,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJerCIGCRA9TVsSAnZWagAA2vsP/0tRaUlimWms2SW10lIl\np4V+Ubqdp0LEW2R/m6mjlOL3MP8l5WNFRTWnh55fHZTx8GXM92JxTnHcqFMw\n+Y30vPpaFt7suaGb5LiPwBsQXyOciQka80AN1PicqDN92CRQROWy33/Uvn9h\n/nzb9xJRSoKo9vc87oPox7tUzzbkMIdSXuD9OIP5ofq4nuihy2GA/RBFQRP4\nBFBB03Fo/eHTSNQ2xxmB7wLhhDOij3MPDzcTLFZnPEh7uBW6wRaGWdFD9DR2\nK1j0wdDm3xbtGIfFTwWxmNt2U4Wn35sZFGOrtwg4/xu8ewJnfeLXydJGCL8g\nP0HpVl2Gtzg5z9TxsPXGJbu61H9MypSWerQvw4vgM5JdaVborfj1qcFghWpj\nSJGs6OJabI6hs+GRFf7Ai/9Y2HdqXyavd/oImjpruC9osuTuvB5wQNkdWsMq\nFzqBCtXJEJKbiQQcjPLjiD8jHv9e3EqrLsPT1fHIInGkvXPhE8wWe8qlWDRm\nBFq49J4oJPDmyPdlkHdSxbAJpFeZICwKX6N4JWhzQeHuIGgBMiY5w8tOJbZY\nEKtJzAkhvRzRpmS8PNFiQ3NA8MODN/EFLUlbhF2a7YSUjJuOqMtm5wefAAn/\nibgYaMc37nK+kQZCihm0ynOZ9iQmUFb53fGE9co308pl/fo5EQxMcOE7IpAQ\nF0zu\r\n=An4J\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIF0d49Vg35/R1iBR3urI/LaqAKap3qKIBEzJGnLGLTe+AiEAsbvy0CaUK8YSszufPIJFsEkTOrI2ZCDrOdJgLiDw76E="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.126_1588339205707_0.7111393133985398"},"_hasShrinkwrap":false},"0.3.127":{"name":"wgraphbasic","version":"0.3.127","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"30d1242fd682a01fe3a187e7b02e7052ddab2205","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.127","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-0u4NDT71TVPv2r/nsiMJcs7aGRqjbZ5evSMyI3S0J5oFaN2DchKxW9OSK101iYHaFelUK6j33CU+fbrxZzjBHg==","shasum":"7addaed64aef9a24df926e8ac3af1aa4d8f89ebb","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.127.tgz","fileCount":10,"unpackedSize":139302,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJerCxBCRA9TVsSAnZWagAAFIUQAJioem/PlZL925rGdpQ9\nOPK1tM665etUWGawRguO8d01YaNeR99h9kgSR6pksI1z6GWiXFDYs1uBvz4D\nhnr/XnQVyr9b+tGzG81MVZGgREiyWNxWqaZJsEZkPBX5dKwf7I1xZNAstMpH\nTnZtt6qxIXAtZt44X3K1hWFdApz3jceVOZDD1L58qLr3IuesmbAtmZ7MRXoP\nvCAiWxr7XeWIB6L3QUKgj4HSykkardukRZZLUfUCIAseoOYKepaEJGdTStOP\nyo1ZBItzlUEZAph1Q4pd/Eo86LO2x95wH5UNkCVme2y8mDfKfOq5RHKzst/s\n4HG6xlJtDVhx24dItAsJtpl5TLghq7/UZ7d1rzGRH/l1A9Z2yVc/gSByYOQ3\noNoP+PWjhGjllErz1pzmUWzTFf20yciBm5x4tOZL8gQjVwjA/CmTPxERI9Nt\n1zrsSxG2XAbAjpP+mUG9R72/7qvtvxCrJY8uXYScd7vWvYc9vSkbq5cAHiBf\n3sUBI9V17DhCPRjZqsQ3JUd/OBSr2+Dgkfll+oT0rSOGw9wzMCEjuLhLW66W\nVld7YwyMu58/cFJpUDRnSNkum9Mxpsk5lARqLIXfNp6cT1Sn1t0ts0sZ6ZmX\nskw62UDnii6rvaWIloF+XqRer8QHeb6+2ZW2YGvPXUPLxs0ABYP/Y7pNDEWH\nf2bl\r\n=2BHn\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCN2gNg7hQTD9xsRa9JRBCK2cvHA8FoSv+dn8LiRaZgqQIgTK6c4T41J1Nh4MErjMN3frekgVc6hSmZ5mZTGJ1Bt80="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.127_1588341824884_0.40632569046451206"},"_hasShrinkwrap":false},"0.3.128":{"name":"wgraphbasic","version":"0.3.128","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"ce0efa9e6b5accfa05586e4463a8433e0737664f","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.128","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-faP/gfOaPXVYgxQvKqYI/eT+MM60YIqC2uL855QCbn00L5XX2A0DGsZkuATPY/H8VzT26TxvBGZr8OjFpc/M9g==","shasum":"410ddefc675a34bfe9eb5adc6e427df542cfed3d","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.128.tgz","fileCount":10,"unpackedSize":139302,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJerD5cCRA9TVsSAnZWagAAJ8AP/RSjCqpH97H+5KCktj4f\nh/UaKiQ24IWXS3AyWT5zoHVwgz/Dyzz/G9POT2M0WFvQFcfh+LCCI/iQZbev\n6VsSQWbX28ghOBnO61bCsvCSwoq5qQWYA+77hNdZWKCLlyizcdbyXuBVQjcV\nVJcX8ptMnI2yeefTz3sKPiEQjS+8K6ufC+fWH+RjHwGFFBRrpMaW6CDJtZ84\n3D8/vgT+0Jiyrz9/Gv5wI2bQRE2VKg7wq9QEbGidoAgD4ycn2eXO9hIOl7Vc\nqSx7rKeD9/FWLXBEdVaz3gjq6bvvrte+l+W17GRaZx+zFjDkzLj51+Cuqc3u\nS03YZRs2TO0fegtP6GekeJ5LNIrZ2/LBukhh2d7Hzj8dsis+bApgFq5qMmW2\npcH0DkozB8gpYrYzVt0ubzDrgxb41UepKAWFiUrhezQ4y+OEwZuWFULvbtHk\nX6QBs+yIHmiHVPEtx7ZvHf520ICKEFXz0RX+uD2dNvC/jpvMrRroh04ip3Co\njr0V5XrRJHxjpOWCursqdQxqNYbzfJ1OEMlP7CLdR5c5ph4aJMKfC+T4deaK\nV1BYVcDAaRJFMCsn6miBqpzQlSG8n5oPuktfV8CslQy04EHeY7iiUvifTrri\nQaP7MeOkkA7rCXQ93Yo/tvuHPO37wkJGEkOgFTiZ586gaulK7bebfFXfGoi5\nsWUd\r\n=zaF6\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHeD5A0WZT41oQnWI0mD4AOgUOMOPGFIIFR6XMDlZsGGAiAeqmJ8yV54zmPP4ARC7psPJcCzjqp+SBGiWroliU/y0w=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.128_1588346459816_0.13082887353697048"},"_hasShrinkwrap":false},"0.3.129":{"name":"wgraphbasic","version":"0.3.129","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"gamma"},"devDependencies":{"wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"fe9fabb71a8a1382a32d962b2cb5cb879b6856e8","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.129","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-1BjPhW+CCkS9VmNslfe1Xb80Z6WTarNk5/kpEsIGHqkePSIZALdqS6wAzCB9taYc1cEqW7VpCbXBlIWCDbBpFA==","shasum":"e2bbbeea4a206dc2a94ba4c244d942501be69d6e","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.129.tgz","fileCount":10,"unpackedSize":139302,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJerFiLCRA9TVsSAnZWagAAVVsP/2HVEe3VqkAs6+blDnNz\nnr2DZASBrPCbbqjqKkppZVVJGoprZ38fJUYfaLKeLHyHpj2AyZ2DSKs38QCZ\nnjeqr7Ovdi0uu2ZcXPtWJcfNiZOc+1kI/aePieom+TFBqRA1Y2ju0N3floQa\nd1Ce//I4nNV3RycijW+MDs2OoHoXoqYwmptgnvT/QiXX3wC6Ap8Cez3rD+Xs\nYJJBqZBTcOQJOWv61FkvViP2XUi8ZgKQHhWkzR1dOd4iW5gllUvZq1iImiFL\ncujp71rSDBodhdmA3X4xH5ThI5WJ7AhS2ARp/nBJFqO5NfTScNsNz/88WkJk\nkYOyH4mmrmz2/fhC9r16aZUIXJip6Z0z31Y9t9RsjXdrA9SdKn6xi6h7Gcxk\nn/xNAshZmIlQXRKRLsVuRakqXWQmc+R6ob7y6o47AOI2p3Eec62Kr9z7N9OA\npCA3vKYo+g8oOBE3pkV4V2bAx+k4pnBW6/AmB5wyTimq0J+XZBYJ7HVJzR3B\nocyb4qkqyfG8ouPlCXMQWN6hAxIta98RiWYxUg48PUFrWj/cSCLiRcQ4g2Zt\nm5T/QzO83LNqD8kn2e92wfviwCyj7uW7gb0gQNbWLdPLTNPR0nKk0dq+RNfv\nAXJUf5YTQ9lOXCQ0gSMkL+6USZoyXFFI800VJAaXetkfTnqJ5X4AqvZTAKW4\nrncT\r\n=FiP9\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIDeOqKsYb3LgqyfhnbW5yXHryriVSCRFuD1swvGX+5o3AiEAnTVtJJ/uRn6nL9ggSDIXdQPMAl2ewpy1vblEoZ2qmAY="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.129_1588353163486_0.7537449003958105"},"_hasShrinkwrap":false},"0.3.130":{"name":"wgraphbasic","version":"0.3.130","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@willbe.so"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"2457ea98631394b7dd34519332981d56b505a76a","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.130","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-6BD5lt/gFi7O10yOo0y6q2Tz0+5jjMQmpx6QMOuQ85KxaHyQLfsOGJGk0ETwVW2xjjf4NaBB5ICrDwBF11eDVQ==","shasum":"33fc1ebcc0e0d2234ca76b3438442f8988ca82f1","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.130.tgz","fileCount":10,"unpackedSize":139302,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJerq+9CRA9TVsSAnZWagAA+o0P/RIyzFK3g7ilKG3LSbut\n1O4ixCsns6DWtqrKwVBKNVHFhiCoCEG6ZoYW7g4D3/ZhXYRDQqWWhMVuygao\n0ootRHFampNrqvv2nFo/hawqakCiwHxpxcW3jatsJ4OtRw2bMJi1aiDYfnuB\nc8/ezd9B9Ere3hMJN8fSr1Utdlvyu8UHolBiWbG8WyAZQhqec/Avpj36byBM\njSVYkVnZQOarDO2YN09HSDnVwOMHvkJEn2GLFmLpsJoe8QlyZdPXBhWMcX98\nztRPAOy2fM6nRZkkicY1osUsOntD05pXYjd2Nyfig4exeNvjRKm8kHFLWbOt\niskZwg7h7Ct0FNUpH+O6gsygvS0kvSZudEd3gIObO1y7/5Gk/dpOd95DdCYR\n4NawG0TE/Rfa/8QGxjZhe1JHzaKnfuS9iDJuEJiTIb0zn/qzBhyOfwD0dsfo\n2h81kpCNPIDesc+GWfN02w/jvBV4hVM13u1z1XUw5yqo7iKTfTuzXU8NRU1X\nA7g4r3ZpuY0GQhCbEJCXGUvkbV3m380hFxftA7sk+1yOaFgdICh8oODEyegM\nxUKtCYWYaPJ+KB3cTFEB6Njt5gxGH4LhQRWUGzXJCmo/JGvbsBNsxxAfC6FS\nAgfed+id22ifH7uKpP4fynz45F5WpxRnxwZwDUdNh9HzdcrokIxLWrRgUsFs\nch/y\r\n=WZog\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHDbmGq9PeIqnAx+V52JRTKsceQBYdLzo9ofYFA8Hx0gAiEAjNpTyjTfTCVAscornVsUw6dI0RF0/uBchuznor7rzMo="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@willbe.so"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.130_1588506556833_0.2218865970241568"},"_hasShrinkwrap":false},"0.3.131":{"name":"wgraphbasic","version":"0.3.131","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"459592d8701de547be7336df53b90cd5c88f9864","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.131","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-v0aVAkN3c2jN4UAggO1Z+QCqB1VOAN/VHW5JSliPOAjnEoaJr6pmLF/e6lZkYHL1Pj765Gqv24b+qQnv7CFV5A==","shasum":"5e9dbedc637ed272d2bab38a1142be63d6e83e7d","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.131.tgz","fileCount":10,"unpackedSize":139303,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJetPJ4CRA9TVsSAnZWagAAlbEP/1mwZCSGVSm5LYAiSfPv\nxqSNUwv+2uaLx8bQEdnt+TfmVNxwxtawg6d/WSDIX+cGBV6s+ob9Ir6U5RQB\nacmuE+SzHB2EmmLAIG80zi4IzQAhSlyJBcKWcEXWOwGHA3nJYPPPD7uAzV7t\nkqXi99U+RBqxyvl6AupqR1lWpgKI7AiR/ZfthlcbwtyIc/qbvEAb1njpsYB+\nLxTjD5nGQzb5drNBNNsdi2zRPTd1zfQX0xp3W4nf/W0zoqlogKkj6P+tLLOM\niaXTnc9J2w+of6eaWSXE7RrAR6IqaoVq+mOmXRR7r0wXM3jiNZ2O4xyI6dAG\nQdjlyQ0OnmXUOzqIny9LBpDJ7CdsbrmQipcpwWNGCjraT/VLbclmAE6iLLqw\nFiHN2Rn4mXwQPYYcfaG6TueupqRInVn5LhkuL5UMm9ngd4a6sNidnYgbe8MZ\nEe6SoMKqF6AcPtT55oOV9epH0n3RYNNp2ojtzT5mveKmVYzYJRR4XKpAOUVh\nwdUC8XLHUdyYCYEQFkHYAtMeFmOe0mnl5iqEGmfkffQK/Zqgt54VgU31GArG\nau73kLEKJDQbqEBvCloX2gGe2GnkwVJMUpDoBf9Ngv7z19YefGnQJ7R9i44h\nb45B1rUU8oX7ozNzReCcySsD2cA37YMqd3BhgwZwycjQ6hr4oHm5Lx6XzRyS\nvf9I\r\n=sERp\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHr9hL3YAeLWEdpddIZ8D0kIGKIdP9nZVzdmiwz/qVzMAiAylkorNfo1E8ga3fs3oiytQgCRP+maH+M3C7ZK1NFsng=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.131_1588916856353_0.006976044675200965"},"_hasShrinkwrap":false},"0.3.132":{"name":"wgraphbasic","version":"0.3.132","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run proto/**","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"028f78b42ca2aef665b10bfe57dfa45522fb90e2","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.132","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-WYqATPUs6ROaYmISCp7ONDASlZMWWQ3FVB1srJnpKKY1qU895+IpMtGDzkuEq0z8WBNHteQKeOXVjdLf4T1Rlw==","shasum":"ffec2aa5e656e57fdf4eb667e77c0805fb2ee9c3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.132.tgz","fileCount":10,"unpackedSize":139208,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJexoKSCRA9TVsSAnZWagAAy2YP/319OonuhUO4IEkYlj5h\nsnaMRxVl0g5I+BQJypryuBxZoGOZ5aLHfKBmsDcvz02PUkocJTFv4nvQ9/Bl\nNaoc2dybuq00Id5zTdRpYzCRtHRfVRZAd7jtwyYj9/U2VFt/61BdGfzCkntZ\nUM9IttriGEeYp4m6J6FciTkXfj/bTxiFpyyU7OzAVfJDO4942DXSWTEisHlo\nsLlkZSgJB4Yb3G+PFLOz1ZpSrN/chWa82XG8LZeZeYTZn9vmvGGUOuKM4CBQ\nFFmaobyIdhCYDlA830kMOvh72115gf8KHrzwFMgAGdMvxne19EOtEDWqQlUG\nV5zUg2sfySNPeqaW+7whueYY0sQirq192TzPMSYLBaLqGz4ww35IKLlzdZIJ\n53J199jzAfrhrqxmy5gt64DsPNWMRNbG7Asnyqc9peynhm8B7yEmk0ZwJjb8\nQHE48iqVcg8RO2dfaGAj0fBgYISQCa5+3PEud86pgsQcQSSizgzloEmfA9rw\nUFQQ6n92UjAxLuTAWEvqBWz6Bedf+9w0iqDTTpHRTMD+Imlduox82zImWYE1\n5mg33DsPbj+iKEYeLwucIQdOkMdzUNc30ZOkdF8PF3STpFiigwUrbowKLzXV\nz+bW8iuQ4Z/+Kw359p+6COP3o8Onw/tk069603tMwEcX4H9QP/95DsdxSRDF\npxcd\r\n=LezM\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICxLE5zGFzVs1YVINz1dpYcHSG8To/nF6I/iPhUF+1pgAiEAn7db37c68ykim8QL0fVKb2Ld5WCWrTvSE+vfBfS+NUk="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.132_1590067857749_0.4971997312440355"},"_hasShrinkwrap":false},"0.3.133":{"name":"wgraphbasic","version":"0.3.133","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**'","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"2b69a24902791d3b7eb0e25303ed9b648697a85e","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.133","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-cHSvbQJUmmfnUT+/YSzzmKUY5GtaAZn4Aw9zrHk5eEx8mIODex9vsy7uZY9RzJKVV/OASmC1q+0KCArosLqAig==","shasum":"5eddeee4b503118a4924f2733705cf73ecfbf52c","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.133.tgz","fileCount":10,"unpackedSize":139210,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJe1PDXCRA9TVsSAnZWagAAU3AP/RC8cFMAbnwavF3BjwaC\netuED1VtHHUL6EAxJ00xSWcP3+kOsnKBR/II1qK3/nMXdfinfkIVUI/9cCQr\nhcVKMLsLpM1BqYqBGIX+PwHbW+MBjou43LGrogVJM7gnTqqi/+S550nSsZ+h\nXg/ZAcBFUd9hM2fHZsfSiFlvIl8ubZUkrixLr4HgX6JHTgMhp4RxvQPo0Yah\nC41Zq31nt02Wvvcxr6kZislkckSvsI/SrTYmG05v3NHbk4RngUDbVjNQ3AkK\n8ybHgsGiJByQTRWxMjZamu1174KKY5fNEZEAuIQbI099NMICw39o8N+NAP+2\n1WChRSM8BL9ZwXZkPLvH8ad6BmbrFX1m7UvH1KeHTYaJLP3VoP4HTq6LIVyo\nEAVzKzeOxV13weDcfax3kcRwmNzr/EywK69bPWhuh/t4FQTQIiTUJgjWcuGA\nBFIUci40t3V1UJaz7sl5ayGkcVH4nd3ixWSVpFuBtck1bPHdXEykAZinzKHy\naRTaGe1/Wg+rKvyibkbWzaSrs25HWxoH606KpwmFlMih6AuPZ5FfEpmUiqtz\nnX9zu8JP9Kw8v51N9/DA0P+FsHhSWGOP/wDIFHp/rrixw61HGCr97vgHMbYi\n1DgirmP4QwIq542oWoGQb9+O2IPlkGN3lMb/m+TE5yPVdMxeWEOZGK06EQty\nqJt/\r\n=Kfi1\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHpNnfScAcb6/q+hcvV9Rn5ncOCJWQ0bzxM5lXR0jEksAiEAtPN6VWD2qVlKh1/RHLOQvOpoE3cEJUpYJSmGIJfTxiw="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.133_1591013590813_0.6425162829834536"},"_hasShrinkwrap":false},"0.3.134":{"name":"wgraphbasic","version":"0.3.134","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**'","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"5d11e49002eebd5d82eab8569310e181bfc7c02d","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.134","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-Koo4/WpVDxBX+jUfWgjaBdkiduu3ukI4UWzlyAfp+qJpF2cfh5hyEc3VQiM9YK+Qn5D0fFdfWJjAiy871G9Qkw==","shasum":"fce9a98c4885b41eba749c8bc07b8987d9910763","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.134.tgz","fileCount":10,"unpackedSize":139210,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJe2QPGCRA9TVsSAnZWagAALyYP/1e+pHLKMoH97pMZa/c9\n4HHkvPGElVTNI/c3rwzyHyFN7NAN7//9e4MTYDUPpSLpP5eK4K3krMMoaoZ8\n7+lYTgFMlRBGL/qEJ47s2fWxZJoZ9joxIfRs4DXAAnx7QMzhrgPidKm82luy\nQ0mQT9u9UdEvJ2xdN6AogBlb9Y6LuOjL6wisWMy2EEDPZM8usPY+KMPWxOzl\nbS4ZpsEzb+r7ZZsywmtWCCiZDimlfiuEUgrkEjKCRPAuTtvm5SqhOWqNTHwI\ncqCZIz1/KwR2FsTPFijG+rC7aZAjagUh12zDUA+6ndrHU1tVaLZ+IGtiftqO\nmCGCMnOy8LIQ9JDzGP8Y0LaQezc2FgYQia0u0JKqvHyRz8dKV0fZGBGDfy5+\nSTlHoQyzQMUZCtbBg9049lrLbttK9k/a/oc4g5rY5e4qroXjTDFhkn4oE543\n2OY7VOIwCwQkMe2Zox4OAhlBwtZyIbKYsr6t7+nVY/D7ilXitG+ZgNlSydZx\nqL4qGmr/4bEP/9JxQltkeREym8LPEY28WmCLVdR2T2ZrhNYKPOIoHrXMYnYV\n3WiyjxKLupc/ShR3YTFzXVncARJBPh2VIinV2kU1UZmptzBiv0bCY+GwGxTG\nwtdwXMs/g4OPr76lPFzkgvZtVYw1NXFXlJM+jC+CNL0Fzfr4s3/eunyt76HT\nuY3y\r\n=8u5n\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIDUxsHfEaSoZ7crMYzHJCRXbrLxQgYcZ0ZOkk/QhdbtGAiBTGvhN8wMCCjr9tQang6qgNliYcATecFXlyIDcec9wEw=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.134_1591280582293_0.3898220040267817"},"_hasShrinkwrap":false},"0.3.135":{"name":"wgraphbasic","version":"0.3.135","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**'","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"745581cea4ddfdfda4a585dbf8672ea301485076","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.135","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-rC7e7PFOu5UnJVY/TCtphJP/MIRJuSUBWppHZdy71/vj/0/Y4Do22jsSoud4UyEU7YHVNGJANq9eJyXRm+rbxQ==","shasum":"4e22c01dacddef283060c7422fde4b54b5f69a21","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.135.tgz","fileCount":10,"unpackedSize":139234,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJe2k32CRA9TVsSAnZWagAACNcP/0Eij9PHrOubAVkbAyjG\nTE1reuCZKVvMD+/PzEOy9APNkt7o0tsgIKjezx7K2+XkrKFuIy+2Sz/Uy35s\nhAFlhc2VnfjUuUSdfsYab8elmNfmKfJb0gLtHlUdms6uBAZIn3vVrDg0DLqt\nSuQJEOOHMcpi3XWtBsH+hEncgFfBlbyxrfJS7o8ejrTrjuxKVeScc6BHcaRn\ngMnQM6TT5TRhDBe4GXDcztAiExpZbziYp8MkkV9iwD52KlhEcQthsWrWh2Yv\nHnr/OC0Pmq724kvIisQXzN0uFLfbrl6468p+TSu+xT9Zci9CWRwqQsQUPOfk\nqQ+Z1oyyaxzSQFabql0P1Vjs2UHo1qzfcz1zYGRrP5ufg/4AkedT+mlPZQnM\nx2m2B8LWYxT1mB0k3HhNpHxw5QbrBqB1qocqwXKDfqMzc2umd9z5rqshmC5k\nonGwnQEGAIWM9FyT3GF8bX1GggIGBCg2bI6avNFWeqnmPCrznawMXdpttlKk\nf1TjnfVUopF0Y+d1m3pOW4O5W4ECf0rTUOiKVQwCBqMT2KqpVjTlIkW4btsB\nxQvQ0/4wJfe+Dr7vN9z4OM5vFzH1QQZmqfhfelqqm8MKfbP9eFQOtbNH15Jn\nwCIvCPkIs82kWiLStvsIRS5W6ehaN2TxcN7gNr/qiPYWFn8PMQi+T2VG2sEd\nM7mU\r\n=XVOh\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCYVV/qtotkxwgPUbVd33gQ0nKrojmYZLxC0lbBphsmQwIhALWUiw0k8rdbugEJRKHoTv1anHl/+89NLzLKXZupkgp8"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.135_1591365110096_0.3187670164598928"},"_hasShrinkwrap":false},"0.3.136":{"name":"wgraphbasic","version":"0.3.136","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**'","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"b047bf1614f3244ecf74c004b8d7ce6ef4a8da19","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.136","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-1gWh4M8SITWyrKewPj/BIj4ga2Rsz/rz9Bzt7VTFCjyEELO3OE/lj/XZj4uhWK1IvFGdQUDLSDp1QzPDA57xLA==","shasum":"becbd7ae16f00a6f2b079fa5f40a9dc4c536c5c6","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.136.tgz","fileCount":10,"unpackedSize":139303,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJe38+hCRA9TVsSAnZWagAAKXkQAKQNlDx7bl8uNJRyoh/A\nL7CXEVEYWWrMv3qgxreyhfjXXv1fvwnDjgjRoYk6pfGzflnrlaFS0O+owSvw\nsN0z2Xe22BnOWkmK6Ja2KnorItQmj9D7NfXkHwwLb1EWNx1zRMHx+n/Jum8y\nuIfEQVq1kXtk390x2EVd7pZVk3wyQxhBjdd1tub+Q1S9gIzUi6ZtOnFHz6bV\nT6kUHp9ecIaTHhLeoOZy974IP5e7MJ/lCjf90PKYPG3L882QzuC5GEO4ocMy\nRCrqYpMwk1AtLCr+AvyCylVEksPFl5Pw7SqXemLVWZOeHdqYfbp7LstJdvkW\nJ2eh+nft0p+1HFXb4TMVhbIuZmNrGeKJcQ2gVVQ2I4X75pstFF5sPEP6Vp65\n6fKQj+nOCdqjirppD7ZkaDDA7p7rngnNSZE1D87WHTVPGDOBdxHnqZzVnMcf\nwS030g/44fvEur5GGH37QkJgH5AUd+uglQ62jqKcw+OlAvRVOrNWwSf1LE6M\nnJVfbZK7JqMZkAyBReI/w722Ef+BX7XxI5ZeycPEQoIHC00rfGq65bb+ydSv\n5fOCrKYocshoceiDur6WV0qeqpK7qZGfNbhTaKn23t7zxTJ3GzCF3bAaogZg\ndJD3/JIWRmt8Uak/vsDbtRfsWk2HZaVU/H4Uy7yQ3Tj+xCNDn8x16thkzeIC\n9ccs\r\n=sm59\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCID0ppGNBHuvwDakizTaIeG5jVIZQj91WJcWIW0H9nb2NAiEA4TKGjkEA3rHqifUdmuaVemzQFvmLzDHmtA9ci0csQnY="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.136_1591725985080_0.8374055873989072"},"_hasShrinkwrap":false},"0.3.137":{"name":"wgraphbasic","version":"0.3.137","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"6d417a5239cdd3eb32fac658e825ac97b2fe6de1","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.137","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-7ULYpDSv0yyyAj9NNnw17BObAKPNZFqrcObL4M5LVCQz/qA9qIl9qJWuBrlh+rMPHf/cV3ApuRgZyzKPScCZhQ==","shasum":"a006059156b83215d98c80c8072326e415a1c091","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.137.tgz","fileCount":10,"unpackedSize":139315,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJe4bdSCRA9TVsSAnZWagAA8eoP/i50oWjbRKmpHfzVnugD\nZA5oBKkUyAI6Cvn8M0bRmNuY/LKdKPvJz1XGSdBPOxAvxJDcWRNTHAuIBTq0\ngq/NsQkt4TaSBBFnpIprnk5fykVmnUJ9n54p03ipgqZsML65tKtaYalCBId0\nYbIHcf7VSww4nj1dUVAofrR9S/wdXzf+D/E/LGr9yJydLZk7/A6lCL/5Q3n/\nPhYdXODjvu8ntjsqH8Uhptyf/uC4f8ZPJcg0IzsIwsK6T9f00KD+zvKpgP3p\noPnFCUz93vbIzs+eNhBqvzPr7X7IuaC9DWMdM4jsZMn/YA6U7+1NQNudu3nk\nrpEOPKq+70gApToAdvI2+cMDho6Lq0aZuAC/5DNvHBLlLf4ZF+x8kWXVOOGC\nIFAx+MrxYl2QqqKAoGyKpBaUDHBz8+cIbFJ0C+tcjiJvOqM60TkhOCg7g2YY\nnl1zWl6Kn6Om077wk7cNIB96VBdoU8nvEp6Swr3glIJAnHIs2BELny3g38OC\nx/QEfP7SlawiIbe93+lXiQ887PUz6J6xWRYtOMQ4dY0Mh+4+8rI5f4vE4Y81\nZwdTF9s4QrFJWTBB3g79SEJOEc4mmhQUsr4ZPZEoE8cYAVJkecnxJIHEcs+u\nCQwLY2BvVx0U8tD+VP2twSlULwdkNe05GgJ/J2KQLGeIPedLlydX86Dh5bem\ni0FK\r\n=X+EO\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCZa47Yo9xka7m2bVVkLggnsquchLuvf5iWnQTJuwZtAQIhAMNVgEHZasgEH2EnKTqu6XNqndkx8P5WMXiLXLOCnNqY"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.137_1591850833704_0.6327340101570027"},"_hasShrinkwrap":false},"0.3.138":{"name":"wgraphbasic","version":"0.3.138","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# wGraphBasic [![Build Status](https://travis-ci.org/Wandalen/wGraphBasic.svg?branch=master)](https://travis-ci.org/Wandalen/wGraphBasic)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"98dfc689841bf2cc4cc8e215e6cdd040a05258bc","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.138","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-/WvVEVSKxtapWw5AOXiuVoueX/io5hTwQMh6dgntcA9H2L1bO7ExNM0vbsfbwVaDrbqyzlPhOf1sSF7Gt0eeEA==","shasum":"c0a34f9f68a4c8dc4834447d47130e96cf066b9a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.138.tgz","fileCount":10,"unpackedSize":139315,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJe44K/CRA9TVsSAnZWagAAhLIQAKAeErl8PNePQatuBjyW\n+Kw9VzoevB5bu5FVhAnBaPBHZPbiySlhEIvD9gThkN5tgZWbKSLnW8+h2CR9\nU1zjOqp+mDOXjAJhjnMBqokYfmXvNAH1zfjIDLUjc5neyObxcV4i8A5YwbqJ\nOyMRYaKWZQoaDKXLPPripWzhcJ43mrCFqBYtDykWhumw74frVrhFrgoMMLW/\nuMKKxt1UHJRx3hDNCWiU6hS0nE2ro2fZwOPJ5wi1GouRQoneEDCzzM2IKL2S\nXxSu1eLy2LPd+ytVsBclJJJq9t+83A+p766eaJ54cEVZEAq6wOWochqENqut\nwJb/k/v3u9m9WwjsPq2QBWBgNbmKtJGdcxm9rmSX91zY/pKGD+CjawPvKjrn\noaTXjxwaWJ7eNEWhCGcyXjXQDM8w+piYRUWtn8zUNSnwcUkfZ1HZYp2Wr1FW\nT9ub5tFe3KsM26IYt50QLN7e2O4pMxdFaoGHc0IAr+Ql2iBIGKNGphTiAvBV\nnB+UZEh/BC2KKO4uNuyooprtPRg3H0SWqoAYJWiGWfEnNLczkP31qw1lD0C6\nC6SldeWPD20AkzeAU0D4nMxRcA7V1FQoG3Me4zjEPbwmCzIkvLYCKWRUptfc\nueWj3jHe/vVzZ9pu+KB4tt/HH3EkGhlUZtQmQ4kVFtpX9PXocsInGmz7z3rF\nJE1z\r\n=drmF\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIG22HzDF+FniOc39ZVnqwwgYOAZ9dmAkRcjwQZJPs6FYAiEAoTtNKyeZF7NGIIn1p95eito/9fJBKgt3vkPXi5yJsTg="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.138_1591968446793_0.7293368624624417"},"_hasShrinkwrap":false},"0.3.139":{"name":"wgraphbasic","version":"0.3.139","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![Status](https://github.com/Wandalen/wGraphBasic/workflows/Test/badge.svg)](https://github.com/Wandalen/wGraphBasic}/actions?query=workflow%3ATest)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"55e16ef746932f71ddb5af6339abf6c5c52c6fe6","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.139","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-gwphiGnD3CCev22tGbNtlgGCBk6p2WZXxpiwb5F3CDJ+9Cby90moJnXV4yWOVOsbUWki84d4RQOodaiwEA81mg==","shasum":"a432ce56a09351e81366ea816d7a3e9527dda00a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.139.tgz","fileCount":10,"unpackedSize":139348,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfAYnSCRA9TVsSAnZWagAAJLEP/1zTgmaEPmU0PaDdnMcG\nXlp2mv6w7TzAy+VQ8NjAFg2QKiI46p+XTcw67Rz1I/tKMaSjpeGwdyDD9lZD\n1CoAfmlaxdCPlXKnabXMd6C3fl4eBHDnUnxeSpRZd7ksDGmpZPCY3VFWPtwF\njosNvRevtZm0Ezjw+k9Lp/WhsWEd0Q9+JsWkODgssMWob5SI5RWnIUTNuOey\n8QnOFDtqNsDKzK7mmrAf9ouRIjq/jRS8aF7cpz9kOozxXWKalEJFlWdMsNyv\nvjnkke0bGWc7fXBMTzMgO8hwtgW/p1K2D+UTUbt6+CWdgKgnbxmrNr0mk4EO\nSj3KTCVtsiXMJ++GMxRbl6ABJRodut7lcPXcfxirTDyafcWASWr2RIGuXDaD\nAQ96Iw0t+VriQGuWD722kfrQaSUMpK7Uq7Thnh7D8jM+obtpTh+rK6NqhUZ0\ng7r9jY/J6k/TN9GqncXSXdNNFiwT9VF5NXnCMs8aQFFxZZcYiBYsjXZa73Y/\nX2rsKKehWRfzunc5gy3y+/bYKteEX7hFv8TqKQ9pQjQXN5BYH4EysQaVJ4mw\nbxphzr8KUmvafRTDMxQ+KMSB2mY5gIxYMHjfA3ixrwvSjYgYZEDD+8YYcLtD\nNSgHtyjjgIYPkQgplVmSN+hO54e2hx7LX7CY1wK14zSO5ceTYE3yB3VgAeSb\niAPq\r\n=mQIr\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHwB1QvsLE7XqSXWe/s/Kp8VdDg3jLh0wt0ZRyoD6qLVAiBqRBctmB5IafmrbWw6nl+1wSi31VrXmVMrxUT4vOQKmA=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.139_1593936337810_0.5272729020375981"},"_hasShrinkwrap":false},"0.3.140":{"name":"wgraphbasic","version":"0.3.140","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![Status](https://github.com/Wandalen/wGraphBasic/workflows/Test/badge.svg)](https://github.com/Wandalen/wGraphBasic}/actions?query=workflow%3ATest)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"44a6c3078353cf38518da7628fb896a8afed72ad","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.140","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-zKF/+15lzrComDmYIKtoQjH4Iz8Ejc7Oq+PxjBkohFUA+tlkVHm6VAq0nilEVx3jWagWgmm4OqDkfESS8qNTIg==","shasum":"44fd7f51f1aa546020fb9414d5163e0fe44cf02c","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.140.tgz","fileCount":10,"unpackedSize":139348,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfA30ACRA9TVsSAnZWagAAd+cP/2A4c4BSeHPhFt/KMJBi\nd5dM7IWWcYZJSRY36j+1FTQCGya/iUATLZ9b+vVLU+eEKn6nr/Y/45Jk+ajt\nEvqFrZhkB4a9e7jVOCyMogfx5sfj8EUDVOBjHjZk7qaBE5SNy9nDqLNnurjU\ngaSA6eFf7BwMatHCglPAJCv8PH//MNbj3WAtlDlTIKXNlrXmma77tv+93nAw\nWkkvwUVZEOn+aA08PUOZHF43OKKnYGDHe+WY1RKGVwlBgWgckbEt6PBF+r3m\nz+iV+3xGj5UkkPllYTkjC44mJwA77S0db3vKrLWxgiVv22Flr8UEnbbuxLli\ndoMKf62/1wSYvOmcPZGznY4Th9QS3NbNQw+jncLJl13Lx2OSus71sBo8f5SE\nOOHELQwILkinPsFOAfFG7C9tC0+pe3D3PyXJ6GwU+Q3mdqVn3wEO4ROI/eow\ndBj/2tqQQ680FWlhkXmfj7vP+eMtx6vOi1JjCdA3ZAnIdnHoDCW3+GVTFOZa\nVK9WqLMFxVFFgjrgDIODHhFBWgMGZNqbRsqgg1SnYPIEi8FmrE5r41DzbJcN\n7iXgTZa9KYClpJlaDxk07jd5wVDNiKzYQqyqBgyguThuJm9MviCKYJtQQCui\nEQl/nWpLIylINSG5X/VRQKFCOc8CrtozrExQNGgBW1r63+ULPH8gAsPwOn80\nFFj5\r\n=+Xxl\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCnM1JGQaoQChmjAcJuTxzgWn3DELcbldGIJSxZSBprJwIhAKrlvfoSuP/VDAL0BfvjmC5e2dUt6IiT6UJcDGA86lXM"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.140_1594064128062_0.539038283379295"},"_hasShrinkwrap":false},"0.3.141":{"name":"wgraphbasic","version":"0.3.141","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/dwtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![Status](https://github.com/Wandalen/wGraphBasic/workflows/Test/badge.svg)](https://github.com/Wandalen/wGraphBasic}/actions?query=workflow%3ATest)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"bccece6b0d700ba01a2fe0851ca322ef5a1a32b5","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.141","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-n1xR1i5nvU32oN76rVu2KSxAAz3VbPkk5OJlnVr//64bhBC2J0LzAIm4URiathRJHYyFrbvGD62zjB4ceUflfQ==","shasum":"adc524e1f6acba67d0f7f3f4ee1b0f432c400ba7","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.141.tgz","fileCount":10,"unpackedSize":137769,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfBIItCRA9TVsSAnZWagAAp7oP+QFs6/DygsDMiO3wJYb0\nNY61lMqeOBcr0y3sLcYYs3z19GH/I4Sy7zc8NONZpa5nmF8cg2j2nfg/qknI\nhshu9h/+26bb2WHQAa1+s4JlJvVHhYUmcMopmJiqu7kJlK9gD+n1rQMy5VNi\n4aEBZPwxEMBFKylflsN7AvpnZ2MMhUW7/JodaFOsZ93WJZevEc/bAUk9YtNb\nXYj3u+pyK94IGzf32lcLBmJWKD0sseWdxGKlRNWhuN8/CFqdbsmjBCvGF9YG\ncBpn93GzNhqlKrUi0VsxKceMXkPAGfxDdrReyNP6JDEoTIy/VId0jRmyp2qt\nt5pxGnq+Y2VgLrh0uW/CcQD44YQEbTjls1TwN6ZVHS1Q765l8SiF5zn0Mtq4\nTmAfv6MJNG6sdwK4bx8U3RxiP0QBNAfZyhbPM5J7o0xNEzx+VGiQDKxv3Dwq\ndAu7FbL5m3nOPhQEPy8XiVjtQe1VQIkCs0MXE6wxLUS1eZboNJY/KLaHdyBS\nqqul1DBFlBt2LmKv3ZNVyRuaG5BRaHBWB759CEwIQmKJiQHJbpEiLerHWMJl\naYW3fR0sWx3bXxWYS+QgIhKbvHY8c7OExEhIre2zoFHRvrzdUWZPqkkcP8DA\nTEg7fXtueDMeJS0dLxQ3B2daJXVdKIlZQOGakL3hTXOQRAA7zPGSGoO22Hkm\na0Gr\r\n=8B1Z\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIH7I5SU2+rsiVQPz/WHtD/gaWtIcLKuba54GyR+AWUYVAiEA7hLGlMOm1ZHyGTw39ZYzyXInRvsbfbgnxgSJAF8izls="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.141_1594130989148_0.28373296463276576"},"_hasShrinkwrap":false},"0.3.142":{"name":"wgraphbasic","version":"0.3.142","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![Status](https://github.com/Wandalen/wGraphBasic/workflows/Test/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3ATest) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"36072184ae8672f6beaab4055394fb3dc977e6fb","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.142","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-RObMTo0SzUcL23TNsww2M1Wykzo0wR7Hqg3cPSDymwOtH0vTxvOlDdjG0JB3deER5FlfNhHPAv/YSMOA+ysfNQ==","shasum":"a507b7f6f3d27e8fa81b082439bfcb3f31e74c95","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.142.tgz","fileCount":10,"unpackedSize":137904,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfBrHtCRA9TVsSAnZWagAA4BoP/19UvkGdABZcxFReTUHF\nNzws8TuvfG2tFrH43eWYzZETDDIHN+MeC8T6Z6tkxBExXiGXA3lnEqjUqGE+\nuUE8dxA9++lHEJPtsz+MIYtsydud0VXeztK3COerH/kODLkZNpIV1ZZamw+l\nyCxZUUwTSX8yGM3v3eqkzz1lvY950uAMiFy7MIanV27f8R745mnyErOjhrhN\n3qcd6+zR8nRnn+2Iv9OI+3cwdrFdkBmKnPjDBpGVs2ohgEIKujL5eUkpP0fd\nxxVTqatYw+Jh9ACZQ5tdGJHVSPj+OQUvo5KVnkO2EvfVN9LRAvW4Zjy/8It7\n8+/VHuURSS+QCGBXV0wR01XWXTWShEQhFV+PoAW2y8LCKDYALhWvyQfEx2pT\nITpnPm6VDkChzwI8PdgNIRv1n9hT0hedYZVxw5589RQbqxECG5oPExy7hfio\nANMtRm24mN/EKKoPClyPKaDjFhqAI3VhI4ZqxC4K2EJs5MjbKoGMlf9ADHir\n8rAOS/Jlsls5CfHroo5+2T3SvZ9eytsbDdu2FDQ88f2WJWnaiS7k08eyP1DC\nxO3L3aCiTS5J6Th7nho9dNwnsAKezENUhDBHHTXxMmpK1HjNFsJvYtwAB2bl\nhg2Rq5kjI/9Vn8Uqhhiq3bZcXLKA0p4yZOS+PjhcxYaFfbo074+igUZf4MVq\nQALZ\r\n=X07T\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQD5UAzxz4msDiDXi2Vi1q0i4CiJBYJLuhoYFYw3TRmF1wIgOq5CtEuiz7eu5dWraMY49rgoSGqjoOmGbZMSsUtxZvM="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.142_1594274284930_0.06628463630647441"},"_hasShrinkwrap":false},"0.3.143":{"name":"wgraphbasic","version":"0.3.143","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![Status](https://github.com/Wandalen/wGraphBasic/workflows/Publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3APublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"5af4f4600a3078420abb2bde9e95f4a45f288fed","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.143","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-2CJH++em2aHWxNc3tFZKc4AO9RLssWibrPQfL2RZ6SQGFXmCZtEyY5ubpxXoTf4SEiU8jx2UczGEtv3XvWW+zQ==","shasum":"6e2d10a3d2bd37ceb786165dbc75594506d7f0f3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.143.tgz","fileCount":10,"unpackedSize":137910,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfBx95CRA9TVsSAnZWagAAp6QP/2KhoQ3ZVpLrx5OWmt95\ncLs4QSWBFT00oC71qdgLGTMgwhm3hsL5pI7BR+5nGYZ581ikut4IRZYSWYV0\nqWgwuthfA/ko7nP7P408jVZs7sLNeUuEJtYU69/2reZluB5SKPAHv/TcOQkN\nNvlbq3sevDxI2bNCkbEvTKwu152AGj3yIW2JcoLDV9fUkGju0GgDB2EwOiFU\nbj772KPzohu5XrXrLc7FLyrHV0543yyNuPGhUlAeAUvIuAQiWTblp9vwRErP\n7brwPf8VuTrVKqB0sJ2usiQFomitXAYq5LJD04DPxdHhf8jsPCx0DLsSv429\nwAKsHjwaPSQkaOpXZhf3LwmFPHB1vQ6t54ljWkhwAP5w6tHMTDD7q5O3NQsJ\n3Ob4hxLjYb3ZNsSS73HXgM6w28Zio7YYhYP1sAaFw8t0RvhmNk7k5Va5Nwgj\nI7sYaHz8AwZ8hKsSpO5ofa80YKWd8G1ikVcWLAPqOkabWrP4TDrCbn2GjUcd\nVXLuq43vXqy/uzzzCR41QjfwUVnzvPpcss7aXRu7FcesYJj26zn1dgrP7Mxf\naoPmteuP5Ru3EwrXHjhUtP4Z2Ap1/VLrVvfweBbaV6gn622TNI4gyyK05ud5\n0E672UJyCksF7h5djn369vtq7mlOQJFZVe2KOyH/VysP15assZ85gkMW+Zzj\n7WQX\r\n=+YoV\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIAG26YXDBf9lZt8Qi4WmC5RR1IgUNmh8kVhBNZc8CLAvAiEAw0+W5Ly33h6kPQX0bsjKqjCi07Acqe/nwH3i5nKOX+A="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.143_1594302329294_0.7952236932090997"},"_hasShrinkwrap":false},"0.3.144":{"name":"wgraphbasic","version":"0.3.144","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![Status](https://github.com/Wandalen/wGraphBasic/workflows/Publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3APublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"b98709443ee0822785c77ef212a79d26dcf4ca68","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.144","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-mWK/qoZg71i9gbSMys7cRyZ+UmFziHhLYr9pqwBaAuudEEPmVuUlxTt7aI+71QXoiL2md/TRyb6EnmkrYxrduw==","shasum":"eb5fd425f91149ed49370dd31b31781bb45867f5","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.144.tgz","fileCount":10,"unpackedSize":137910,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfCGJjCRA9TVsSAnZWagAA2MgP/j1oDL8DuFTOWPZYT9FS\nsPgFGbSQ4fw2DvdMdxTCC70Ij/lkzPXuKwCod0crUwS17+gYHGLowxuPJGqt\nWNM0F7PBVGvktWMz3LL7N/2u8/dQLmRu1/SANORkapJHIIRyXGSf1F6Gn4f9\n5ZUTyi61aNaGqolhUeh8xl4qeFNikZir1gHdFgY2ThT0xNQqTzlb3HYSHSwm\ngTf5q2WKxBdmO3b9pbafLEflTyZtm8yz4WUo9JRmeZv8VXNn27eocKbquKV1\n7s+IyuuU6VCvpradN6wKlaYdwhwzkMIVZJOTLQwCbPrSX+Kyt+O1kNnVVpgO\nk9zHPiX6Z6ICPG25m3O0YtmZmzesXhROIYAMlSnCzTu4frnRM35kNi4YCDWx\nk/HerxnoP7EhUGQdzsztFj9sD0kNf+N+6zuXNMapc35Ux4T++mUjtn0v7+33\ncCTKukhGXKThIEfUxUJBR6BJFElwCY3otFSxfUFCsz4mG/q6q+WL7ZAvE9YZ\n4ouYPE/lfLEMC7Xr37prPtDMuZu80Lt40bjxFuIeIcN/BIakknZ1iIHt5zLO\n3TKEic1/00fnlcyF3tagnXxjbxFrgjaSehuIdeBYJyd0Xz9MMhqwxx46yk+m\n8P2LpCWjyX0sgh5SfygH64TC9ivVPvz8yvvx0j8wFYCkeGNDngnA6OO4lrhk\n/t3K\r\n=/Ikg\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHf5g4Roz/kC/1+GyPP4L9iBUgGOK38j5MQq+ILP6kI7AiA/G/iF/Hi1eE6gHeuUlk++P6CT6XROle7Y5yQ8xxrp+w=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.144_1594384994519_0.6717357314367289"},"_hasShrinkwrap":false},"0.3.145":{"name":"wgraphbasic","version":"0.3.145","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![Status](https://github.com/Wandalen/wGraphBasic/workflows/Publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3APublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.js\n```\n","readmeFilename":"README.md","gitHead":"38e6f0ed7caafe7c09c434c6312af9d91eb7e6c5","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.145","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-Yut6zSUFbGmQ+yioktR39c9tCTwUm3sh8Eqy2babFFW6/fw+sE08UQTHetnYswH61nHnPY01J5FIQBuFNQ3CuQ==","shasum":"8b0c491bf79bd62d4e364f7fa1947dc16af92670","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.145.tgz","fileCount":10,"unpackedSize":137824,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfDcApCRA9TVsSAnZWagAAZXoP/13tAf1nLQJtsZLFrjr0\nyCk6zfL/kDvAi2h5bi53RTBZGUf8YbTuiBa+xORmksypj1aXZv2cQYhu/pMb\nUT39jGAanq0jFCAnuOTc2jiAloJ0ttBw3dP+mYDb06+LtS/+xcNzeEi8M7gs\nBkbsNndtl2C8egWJLWAasNkeG9ICQBfe8nIfNr6J8rm7osU2tNq8F6DpprxU\nvhYKEbGumBoO8MOBMd4DoDNLSj6Nk4i5Ex4Lg9nDLD2oRa8j0R1kZYXrB43H\n/w3YAlPwrreTrt0cZUzqYaxjNCmWLr3+Ri1C8xzIqQ1xqrCuU9fwyl2pBazd\nF7Cms6fDYu+VGuzyVuEBX52T00Y61AJk1GN3E+V5LQvt8iGyIppfGvmP7p6w\nSAaaGkTjrfC0FiTuXNTmU3qOpJIxyCbKtPmX/Us2Jqz/hLxw/hs+d+VwKaeT\nmDMu5ny3mCcE7h7+wxmeNXIa94t9dCJs0WH3tGTfQWUnnOOS33EvxsUOlhkJ\n+/vYQuAFJZOz8ZrtVeR7SHXT/4dq7wwQJ+Z3xT/DrKnSYxPy9ddZDA3+5NF3\n+TlFFLxyy2741HBDAwi9Xy6XHh4PWQHfN3liOJBrj2odq7Ax3xg9mnZwcQro\nRzn4Rmg5dKAAjHmBR2h7C0UuDQvsz/uTWoJSP3al60RmSZAhM8jt43RQ/kl5\ndsAk\r\n=voWF\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC7bO1y2SDuLC3edT0XSiXW5CnaLOkHR1tDlugpiyJgSwIgQM3u0dK/oPPHH8R0q1rR1MmWBclmquyM7KMlU72A5p4="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.145_1594736680938_0.22528013498048405"},"_hasShrinkwrap":false},"0.3.146":{"name":"wgraphbasic","version":"0.3.146","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![Status](https://github.com/Wandalen/wGraphBasic/workflows/Publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3APublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"1c1611c7f66a876592f1b882ad25115dbe705a4e","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.146","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-ZUnJ6vP2w3pDL2HI35oBShUOdrOyAQBsW//lZik/SFvyn6kshHFaXrvUwTBTUpf3zpYXqudpbDIuotPsd42Cpw==","shasum":"db235713b450a67f7aa4260e5687de1a2f82f7c6","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.146.tgz","fileCount":10,"unpackedSize":137823,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfDw3iCRA9TVsSAnZWagAAkPQQAKUs6j1OXoxP/OIvZDCb\nDEf2NSj/p0WpW0OnAB5C+03aOJPm6NfnfCZ51LpRYhCqWsVIBmIhHGMMSLza\nlcH9ooj+SA8AR6hb0JscNGnbjpbG42utUXczcwSu6NfUemX3vIM9NPq6oZKX\nbJcUIum6iA14NhJ4WLZUpRkcg1Xy80zFGlNnnxz0FQIUIoMJhaFn/ffFB0hB\nYX+hWXPc7+TmMtzevDiSO18ae7ptlfC3CpU6xkHtdCz0FNxV6JpgESHjE3nL\nAc9sIB858ul9sNXgzOgsZW/W5h4ZVd4xoRuoQJFu+Llu9Hc1de6qygY6dVzc\n5ODN0/L4ShDhMa7o3umCcJbCxtQGQwrirtbmmcAKI859uIFMF7yryq2fPvqg\nEe4zj0tHHjpoeV4TpNyjb8/hhz8t+N7n2uwrUTKim9Z/pTOR4++d2WtbjpFD\nWId32hjJ6OBKtzxFMZGaVS6/m0dOqvKBrNHWCL1syJ+xmJYntFtQMPSZSwGe\nhJS70pGobgjVb/JjMRdLmj7b3KPMKeHi+pJy0vEctsbB/H23VIPw+0+1f+pZ\n0rsE7mHMTwk733IKxjuTQozFe5N7bpbeKb+XeQ+qmrW78Hm/GJMD0i/GQTCh\nXGUaxOA3M350hvTyI15hM1/6U5fyPQ9NUNipki6xdNEBnhXRvrb4ygpPSFYL\nTsYL\r\n=maB/\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQC0/a7IfK/LhuErp4ye7FyHoCPQkUSdBfRogzouIU6NDQIhAPU1hUJ+tnHSbnvFelQbO7U7gK6mn1t/r+jvFda6Ui4q"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.146_1594822113807_0.6557888312160387"},"_hasShrinkwrap":false},"0.3.147":{"name":"wgraphbasic","version":"0.3.147","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![Status](https://github.com/Wandalen/wGraphBasic/workflows/Publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3APublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"abfd6c26c01f755d1e78ed516454a2541b58f9c9","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.147","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-BducybFOkZlW1C6qKIPVB9zFSI8CltHu1k2E+KEgHMPFwF6RYMyzTCfOnmOqkqHcQ98vZkLzmfa8M7JziHGXrw==","shasum":"eee6fe01b92b7013849bc13e9b961393e0a1f059","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.147.tgz","fileCount":10,"unpackedSize":137823,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfEElQCRA9TVsSAnZWagAAK50P/R71Yf1OaO9y1Hgg71me\n6opPhib/ckjK592jj5xp83XVOea44Bm3/RMUkuHNnVF+Czgit3ZtlOEP1gEM\nuMB2izmBF0g2RJufVCNwj7OvoZp8cOcFGJVCWG7NZmu6r8L1QknZWVgsdEGw\nteVUDfVobnN6Q4QgfZkZhsFsiQgbU+4QAC4nfkNQtDVsWGsfAl3CVEhFyJiz\nF/wuyydiScJlUb3mLJdHunvpbCR2jJW7yF4w+DkrvJfTuILgKE6LYw02JZdL\nV2rHoyQI6gdg9bY+QhpfUAlhnndMySLlIFB0ytcSCH8enMk9cn8NTNZzi7LM\nPtY0ptK8t7LNFMnkZh4HkmE97t6yHttLsBx7Io4MrHv49S0sGWWbvY3nlCyS\nUNFV8uBZlre3QixKPekJKx7em3uTNSq+64OSUzH+XBYbr/vIsf7qDF9AtCFV\nAcJ9Px3g0T0Naop57tgXODKT6IyebBCR5HUIac/Ry+gMV3K/E4NWON+TqWkI\nPjtNACEwy3uxHd0Xdx9Xj42ORuQ+AppSF6VVT+eRtQb0cSL2ngwCjx2u3aF2\naC9Pz2XPZJI/kzhJOMievjKWxUT3h+nhkKAJw9dtz3RKQpk577Ckb91V/pKw\n0BaGb4HOayTjsJyzZhq8lN7GYEI3twvIhvEYC0br5dFTdqFCzOZkSKQZFjtU\nefeZ\r\n=L2Sa\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICH1/MSp4J9c+R/nt/Jz0DAe9LT7mBCWSQx7YJE3mIvzAiEAmfns+TiEXDRrvFNmId67U12M6dKwSDJ3M23KLsBQ/yE="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.147_1594902864196_0.409644769625257"},"_hasShrinkwrap":false},"0.3.148":{"name":"wgraphbasic","version":"0.3.148","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![Status](https://github.com/Wandalen/wGraphBasic/workflows/Publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3APublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out\n```\nnpm install\nnode sample/Sample.s\n```\n","readmeFilename":"README.md","gitHead":"698bc5e560d8c0c45dfe7fabd762c8b108adf3cb","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.148","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-0TQph/t7ERcctwhNdv484Ul22yLnCSnTBtADZuO/3xG8lA8L74hde8kjd4KMPt7KuU48I1NIcX5MiXf8YI6UKg==","shasum":"4d2ffd778a937b91640775bc45eca6934cf56f6b","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.148.tgz","fileCount":10,"unpackedSize":137823,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfEbnRCRA9TVsSAnZWagAAQTsQAI0STLb8wq05QnoO6O+9\n40RKBZ9F830mRQMc2GOI0RRLec7WtZ0wzJN+X5R/1e/LvcYQUKl1aTvoD6s5\nxDHwEatEIUmh3A3nhx25CYTBN/1d69lT5lFZZva0wFqBcUVH+VlRHV/fteuR\nIzBN/FbuPRiC5cux8pRlWrLP20pZOa+zKLtponL05xg6jgJUqqFdY0thnkmL\nUYk2nvItNISkknyT/J1ytWhzdH/Qk2GLseh3WXkayYBbbYrjzSPyXwowvoiA\nFuQRFUudjcfoCi5v2XUiLo9s17if6D2wUjN/LjQis/IiTtwshmPfspTz8XRf\npgdqWWtAoaDR9y49dtM5g0R+BM8Zz+ZmQicHQ+uZe0O1XtKiiu2APJVAqfPE\nhay9eGJkIuJzSvbncg3xVAYvjvHgeA1/dMAZYuvV9p3L61su7KN/A+Piaza1\nuCBAT5DjXhhYTzeWoxXt9fsqnb64KnLaawjITNw0MLiPawzM3NbKJDlgmpT1\nwsDzqtdZaCS1yR0B+my/lBnov/U6mgfwaDhe+UY8R0VAx+rzfdgAKw6jl3tA\nozjrQiSHWwIJkgvUogrC7lFSusTbzEF8Xd5tGuijMA1syjEbTygIE0VICiBc\ngnlxqTMaCJC/EMq+6g3xbDHD6R+5pHxDallPoYuureDBzY8sp2iFo0mepYPn\nuA2S\r\n=BaZ6\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBPmMlyfLzNQ1a8mlev7dOYOQKIr/JGiD8O7bpGaMBvTAiEAtgRxxkFdPa6he4oHlmB46pbW1FRUAqMRVnFUSqSCyPQ="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.148_1594997200771_0.42610894264075494"},"_hasShrinkwrap":false},"0.3.149":{"name":"wgraphbasic","version":"0.3.149","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![Status](https://github.com/Wandalen/wGraphBasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3Apublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wGraphBasic\ncd wGraphBasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n\n","readmeFilename":"README.md","gitHead":"4f713da15940e184239dfeb9a6b1b27c1713d251","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.149","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-2TB6GtNXIPzjaoZmpNR2JKC1M+4dO/xtrDVZhc/CFqMHTJX4d5QfOU7oyGAsl81A+lQqxz+QH9Fpu153GuMZBA==","shasum":"ef57399a18b290ab7a496dab88c2363daab33448","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.149.tgz","fileCount":10,"unpackedSize":137996,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfE11lCRA9TVsSAnZWagAAJD0P/0Lpwj2z0HuWTtSPS5tx\n1GTRGnhEBMps1jVj1hxktFZyM8dGDKz1cWabfBBoxoyiRqtu8i1dct+QjPLR\nsITKdxuE8FRgA+m9OlSe2OoyuEo5auuVcdFpvhWYyCFT6YlFgtUQIUekLu2/\niTG3BwZFPQR0AF0qcog7dfBhGfopO5Uqiy0mVfjKwNu53uTXQX7hE95kt/Wf\nGhdvufnGP2bsQyCLTOIxUDMCAsAOeZW40854ln0C+nZf+H/c32N8FUHKBKd1\ni8D4CsgcTop1/Jo5ziJZ97ezLNcPAiWALaejrVOO/p8DCvMcDvjSdE2LugFQ\nDxlzldB8zCr3Lv9x1+IJBxty4gRsqXz49pY6ecpDdFQbUO7A36bkL14pxDcO\nhqRzPGA1PzeK3ioW+Pvn1nlwgjvwAK1RhA8MtDHahBZtPl7AujIrDV58tLK2\nvaLhDUDGR8xcwYVkodTaPju3KMbfcN1DHiFKG8nRuUnpzrbsa0W2OZY0YQsK\nV1tjx3eg0gl4tEqvY4GKpeHJZ0WrJHZoMjw5MWmN+r1sNePg9c0gqKppQVj7\n4opeq1xV4H1vnXAVNbcavf696ed/eq8PCi2iYEwdiIAHy8//BeMpSuxxcBgm\n4ZgbPaQX/4ylhPr14uBinXQr/CO8uvn8EqOGXfLeFk6CkSr5dhm0QO8bzFUr\ndvK4\r\n=WN2I\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCC5l9Jl/ahoQhB9PuWib3v7jbnQMmgHgv7qskDQH5x5wIhAMza98xW4+FJWVdgeFrR/SD6eysRaNZZeIutTSPt+eSC"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.149_1595104613045_0.5452100890799392"},"_hasShrinkwrap":false},"0.3.150":{"name":"wgraphbasic","version":"0.3.150","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wGraphBasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3Apublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wGraphBasic\ncd wGraphBasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n\n","readmeFilename":"README.md","gitHead":"61d1f1ae45eb3b90be4a7c4e89cf3e274ee359a3","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.150","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-2Dm1/CDpf0FwAdupfoi0G84jby/fQfRZuHS3Ox4e70eCDVsxp1LCUwIMGuUUAsPoQRn1i2WjtoqBd/1Z7HCyXQ==","shasum":"4605a0176fa0afe796b944c6764cf102a3a63965","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.150.tgz","fileCount":10,"unpackedSize":137996,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfHKHGCRA9TVsSAnZWagAAfqYQAIO8J2Wm15dhnoYNtYfF\nd6l+ZHlkpRRZWg6QKD+BPhscgWKk4pF4vRVJNq6HZ/tHsWl9Ni1znU+RdJDG\nDhE7lgFlTiO6dhXa2uNAze6/fyPMqS0N2bEdj1qaUL2HvC19A9PK1TllxHKO\nflmH7f/TwdfhUnroP5AvlOjKysqWfNArQU/OBouM5O+IRKgZDvdrdsPG5aMV\ndCAw5kmdNIXmxqrzE/VDLAg+SOx4fX4QOxIRqrVmQhxXsy0pZJA6ZZi0Zy0s\nctjTCpEZEbOFai1ubv4f/DvxDCjRWSEXpz184pSp6dN1iedhQTpN1mVlDWNS\nJQaI8eCXDMGeHPvQruUPqo5AdPs7vp5glUe7XtQYiDADIDywiafjNEqHQHdT\n/dCezh8maWPtzizytjqFnGn4c0YTc/lXW/WgFeKnDSCZNTOKBeP56Msy59j4\nvQyxQceXEq6ENXoUKvyiI02Y6zUxO49EDKJPeEzsd3BmaVCroK4ZyHDXi1t+\n/CjozSZ7LWQ0/UiiR1Hlhnce+weT3YSs6AVwRGQ6pGMOha5pUoRxI9p8b22K\nf5RpRgoE/lY/ejS9wC3oCPFWaSByt9LQjkk/2yu6nbc1seH2042FcORPQ5JI\nm2MAM74SkQO7sHQjdJOd7iQfEPZGetRHG1sABlprsHWiAZga7Ro/pK6w3Snf\n8+Ki\r\n=jf7k\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDEZN7dt3P9yQ2WsJfQaXvow9Dup5/4RB2WteLtWSOUXgIhAIHIrCDfqInSyZpuuYSpiMXuH+Y2xSAlNsEaxv1dzkYY"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.150_1595711941865_0.24483757581479737"},"_hasShrinkwrap":false},"0.3.151":{"name":"wgraphbasic","version":"0.3.151","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wGraphBasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3Apublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wGraphBasic\ncd wGraphBasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n\n","readmeFilename":"README.md","gitHead":"56aad736581ea8f7a2ce28081edd64a5c6ff3b30","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.151","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-yrqtGGju74Ffdlzmqc79a+LJIyM51lU+RIFkbQJ/5OVVc4Iov9NsDLdhJ1vEZb8Lze0++U+jH//t2rgFYnnb7w==","shasum":"4a57928e279baef6499c25c90e756711f849e2c9","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.151.tgz","fileCount":10,"unpackedSize":137879,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfN/O1CRA9TVsSAnZWagAAwn4P/2y7kOx1vR5oijqIrtlz\nk61gvbQhVjeH2KEblxtVC7WDQzYfl+esB423AVbCBYZbVxtDdWUgQw+4yHew\nOkO+yE+ZbumtARMhI5y6OtOa73c4ZDkfyhcfQOYGq2O2vQqbRMxyUh+BqmJS\n1+EiiIefVdsc/RgBIOgxLKycCCsqtwj+yUpOR7yrTXkbiTCPRPCKLEkIazTh\n1GXgUJNSlCKs4ihkrI+O9TmFJBVa7Fda3A/vCeE0/3eisdMCyjIuCymbtfzo\ngqGBod/ApftwjOw+RreAM29J6pSeoRoe/fSu5omp5zRz1kj3d+bzwkfAOSlM\nrYKOWIVqfJWzgCumkNR5Cfgu0k7e6sXbl8MjDmH9wL3pfJcEgqtJP3ke142L\nnJg/YfWszPiCNDesr01o8tisTWOGYSh4R5WbP1wd2wW5loKTPfmeHXNLL1Il\n3rH+KlEOlAyWzdZg8r0QXfEEFK+v4MeBZcjJZC5VeeW7b7DQx/uTqA84Hmlg\nWXDu0PDvVn5Fxs7mOwml5kOx6Kv2xufppMQWy6RDF0OYZkuKKsPznfborLTq\n0F57iPLWjL+TWDynpFJYDvlpbDUtfinwtxGmg1+7h/Y8hzzSTS8ulW71GZit\nfALnIUSkj84zFFd4xYx6rmxveh5DHy0cRb4Is+AR+4Hh708MAlIkWCXvRKkt\ncIcS\r\n=eYyz\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBk+OwIt2q/4ZQQu1l75PJxgwfHDvETCADXb/UE/a87mAiBoyF7G/LCrZtDSxfunzNBFsjzvTw8PKQR1H0G85LzMxg=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.151_1597502388524_0.8002105758531581"},"_hasShrinkwrap":false},"0.3.152":{"name":"wgraphbasic","version":"0.3.152","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wGraphBasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3Apublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wGraphBasic\ncd wGraphBasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n\n","readmeFilename":"README.md","gitHead":"bd9397e24a5a9b397fee356e68d3a3aa2aefc6f5","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.152","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-c5D23TCtfkikbYtXrRklzrvCHkG+8yANjMGU2ciCH3wOws48Xo5wIgefeEvh4oq+JhcHT7IPbuUJk9N6/2N8Fg==","shasum":"511818e7012171b565211741766c96deb19cb344","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.152.tgz","fileCount":10,"unpackedSize":137996,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfOEwaCRA9TVsSAnZWagAA5gEP/iJ4myZxraPIDZeBqOm6\n9zME058YBjmfY7zvybz+b9nP+SC0HzhiSLIip5afLgW3liZmODxBt52VuYG2\ne9TfBJTWj6U26scwdir+T0ArzoQUKC17B6QlH++A2GcC1+Ged+3ixEeqWBsx\n7fB2fTtBd/2MVOAEgnbih+jIrMV7S60jV5owMDPCFXl5GExYe2FJoqOKk3ZP\nMJYJPx1gyO8JKKWNCrdubcJjv6wlv154+MmjxHB+Ro3c6x6NUkh+zLT3LQAP\n02iIdCAYXoA53OMVl7Jwz9HhwNCT2NbWbcwyns/1M6N+jbLm5/wjDaVMWDKQ\nKuLgDWWvt+2Ese9pKLr6iClhJghPe45W6yaGV39iD2aVpLKx5bMfR77bayX9\nP6rBf/qkvUnGA0zVr2GuDhYCwCOVuOu7yW27HHoNl4/KiivU40ev4ezLpDFJ\np6hLvJvIgZr/Cu9yvno2bDBxh5lpAkUOM83nzN+eZ7aQP3NV/HAeN6UmSnnC\n7VsjrTtuu/xcu0QuIVuW5m3R4qlZrFU5/xPqqS2qJG/uejBopRjqJroarcsd\nlhNWu/hinuf6kK7Nn0j+s3W1ruYpbQxFll9FWCqBVIkk/jPiIINjgK+rGkCU\nYrqn2NMCiMfcxUZhxUIjvN1tOtg73MmDwpv1WxdoYSZlKQD/MuGIFUmyPJuM\nGNK0\r\n=XfoM\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC6rbEuOLnUHdzijOEHW6hJ8VCXBmB24S7gYm+lqETVgAIgSLnYszTMQ9cgCNh6ddb31+h8Ufol+8gbeSua/o2PYl4="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.152_1597525017758_0.8833168156221685"},"_hasShrinkwrap":false},"0.3.153":{"name":"wgraphbasic","version":"0.3.153","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wGraphBasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3Apublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wGraphBasic\ncd wGraphBasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n\n","readmeFilename":"README.md","gitHead":"17480a900cdbff3b4956616c4a9ecd1ce1b9a63b","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.153","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-t2SOpiAinyuM4okUh4A65WU0qVt2FS8y90F0PGGo3v7U9P01pdsk9pA6d3G7/MT3O3LlJV0uGnPbweeGF80gng==","shasum":"143029d87357e39c3d429ca716f3b7dc25eb3931","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.153.tgz","fileCount":10,"unpackedSize":137996,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfPTSvCRA9TVsSAnZWagAAXisQAJN7Qar8VjfHP1C9yh7q\nSZOpgJcbn8v8EL3iNlFL5MNInJaenxdnGppusagKsfqvKBrFDYQUyp/F/tAG\nw9vOMWNLKgZzqR14vOt2FaJ0GuiR5G9PijA4ys/3xLUuNTruIRTQWDUAFdai\n7/P3GgJ05TTUDT9UsUQaYjfVWmm1bxr84Yk11bh154JwECm8mXBAQ5alDeb4\nX0qkAyD01uQAISA7dmjvFJavO89FNiKnIlus2s5s2/B58kYefRmzw76/gjxf\n5TUNqJM9G+HyajXwe8FDYXi1cj9x29bZK21DGI0RKjI5gfvxcb9J5AD5o3Wr\nHwIwD0MOS5CnJsUaUNx4Z4emvUSV+Md/zEqWHX0aiNnCgz4gvRKIOvf84ZnH\nSodNmxglMQpkgHUlW88WMG52CYxKvBCJViv5EfmGhnqzJf1XhfSXE/VDbfG9\nHBkN1dcCk8HNOMUB7yy/Cdv5dsDdTKRjNWXw+0Eg6uMKCCgDStjdGTSXBoKt\nOnXaXEe1x0cOsRkIEq3dH7HAraqXXqnDfgKgr+AvXu9zuNf2O3bnrlDI42V6\n1lhXS2lsGAqw8b1vKZx/W+RFy/ywHt7vGtAACxI/ZzNyTeMz6UupkKMtK5As\nd4Htrg2+64RYxDrQmDIasdugTPDeGjyYX9u/JZWARO7mrZ05Heh0v0DHj3rd\nrj7c\r\n=3kI3\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDFGDRDklXoQ1r2RFbD3+/zIu8RMAYdL5Nqmx/I6v5DPQIhAL25qgd+zHlE/PqoQ2i5rg8400EBeamBRloe4vVEM03E"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.153_1597846703079_0.8708586243380716"},"_hasShrinkwrap":false},"0.3.154":{"name":"wgraphbasic","version":"0.3.154","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-3","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wGraphBasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wGraphBasic/actions?query=workflow%3Apublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wGraphBasic\ncd wGraphBasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n\n","readmeFilename":"README.md","gitHead":"71e3b5ae850f6b9035df4892f4433aaef2917ad7","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.154","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-KDizBzmTtknBBs+SY/rvnGS1DkVIF6NhJXr8fbhk+dfPF17TU3cJnMnFjq0aqQ5vFgITSpC0sTJy7jNFTE89OQ==","shasum":"9584447f9ef3b6e56f4b16684fb11dad70f1149f","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.154.tgz","fileCount":10,"unpackedSize":137996,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfP8RMCRA9TVsSAnZWagAAEBgQAIjc2w6mVYtZK/LKDLjP\nXvx20vGvEt73GoeSZuPzY7n5AjUMKTBoRkDB7gWOvQde1vfNveQc3Ia45+7X\npsEQ72KdGbwJDtuIB3x8XEVrFHJ0CHuijuA8vk41rQKoFIqeOXCeTw6xp++R\n0G/hXqiAIy9WpXxtoivPFzZ30pG5EUm4lMlKEIkKPru3YsdOKgyrt28WIKct\nCIx2Y7NjvbQhG78qbbEmGrQTld9eMvfBRghKglEr/QAVijReD4qfrJDxeGxi\ndlUs1Ou6sHyyyEe2Wfn/Y2md3ZcLXGuj5ICPGC8fLBQuTUZtO7TldkiVyLfY\nSyIc0JpkrLYFBnR0sYIuPiJxiOupsacq7XjEZZMr2e361xH2YiM05SdINS/3\nCrs6hrR9SMnGGKzLh7rsmye8VQ4q78+xFzqWPfrEur3KZoJosp8h0BqbbfK4\nW8/DQzWjE0gHA4XutspRG5f8XqBoOfEuR8agyvjv1KkGtQDyhHneJLbcXPld\n3kkB805g6Q84iHO3XLaz91WQjjfb4RLnAcCMI9NaMAMjQzKYWvmVN2Z/mGYi\nQGM2waQQkvXDuZ4x0GjvdJa+XJYCVN6+sgRkkbdpQ7/z2htl3xwN5P1zVQ8a\nyO8Aov2YRkxh4mMjSPWVxsTi3VbAMenNm5wVndS6QA9lNHaU79LFUvSzBr/7\n97jL\r\n=qnZZ\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQD4XXoReurdAA3tmzb6yllO6HkghcMUPPxXCXwOVOObgQIgbwgW5ASWMq8jLVq/DB6UKTMv4LntdUzHUXr8CP9clto="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.154_1598014539996_0.5592198520262879"},"_hasShrinkwrap":false},"0.3.156":{"name":"wgraphbasic","version":"0.3.156","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![experimental](https://img.shields.io/badge/stability-experimental-orange.svg)](https://github.com/emersion/stability-badges#experimental)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"6edb2f146b8ae09abe74e04fbc303594c775a2e5","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.156","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-B4KntGPOjvfttanbW5jCKZzHjwIbqdthm2BHFswMsJLcT7AH7YS7LNtnjdSAejshC7J86kghrVSIaDTK73FQlg==","shasum":"34c134980d9f6680ea11dd75c5e3b69ad2b039a6","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.156.tgz","fileCount":10,"unpackedSize":138041,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfTI+XCRA9TVsSAnZWagAApIcP/2AJWfZKf4UWTod6Z6QT\nht3Aytzs8Cnl6tRMI+ShSFwRaOaz9v3LBNEd1g4FDraOthEsic1Q4Bw+r9JB\nblgssyeneHT5qjknOtpc6XmuJsOcZ5R9lFZ1xUJAHrMCjPYEEloftFIOJ/sx\naSNeTSRI0KTnAtM/Sz9Z8DWz9UfzBm7RaGZf5CLZhNpi7V1qmOR/Xtrj4jyA\n6eSU7Ra2pju3jy7aGFhhIbjBYNNVgnq4V3s2Q1U5eRsPQq4gQGvTzR0HnZvf\nuH3HLMmGR9zLAJubIJfz2r9mMtuyLuurSQCYCm/JlGl8uk6fRkc9vkJNn2+E\nGeFUm8Ud47XQS3nyJV/l97v+64qCDoQN3BN0QW/pjOcTtY/pzYezySTLYGtj\nnjp7EiD4XAvnkvparcGFCjWPswJH+MsZevJhmt4AZx9005nlg/11HEVzjK9y\nj4MTkngpNUQEhwrCqdPIkwe3A04srOjIzRlvJH9gyF4pUVLgP5kPN2/kCWkC\n/Z0jGUq3l0imZKxQXkjOv7MloYyQy+lcpUVtSrxftjBsaJ1PjnLxn+Kid7vf\nqTuS/q+e3haOsiQRVRIDWkTcD+qCxp6/Bq+6o2XTS0VTeIFTxl5eov735oGP\nOYE76hZx5D6aGFGeo7vmMBtmhrXzfXfXuERpMzGC0o6m8+ewTJhMH5o76cYk\n/8R0\r\n=5M0X\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDGEekVSjjVGOwp6xTfnNt/G8O3nZQgExVCSWV11d6hsAIhAL4aKMZ57wjb07IOG5LFoMx/LJCn3qD/RJh7WFpah1gt"}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.156_1598853014938_0.9125319106817327"},"_hasShrinkwrap":false},"0.3.157":{"name":"wgraphbasic","version":"0.3.157","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-green.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"2b2c48d258442a6b7394cb6baa233b6fe745ce13","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.157","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-oljyn14ciI0ahl+Y09bHOhRd6J9+zUNZx4mJitHIS3kdmchE7BdsfUaNOg3kVldzpMG/75fZ3ucJ9cbHJJQLkA==","shasum":"2ced26636007e2644c34834808c4edbd2fee424e","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.157.tgz","fileCount":10,"unpackedSize":138022,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfUexSCRA9TVsSAnZWagAA5mAP/jz18s2/VaEUUuEC20lC\ngrOskwP6GahzpI5yagwV7k0hLL4yRgcJTp5sn2qzRanuYIgQiRzbygSjBMtG\nGLhjosNXlxDXhtFAERqBrCfFNpYCLM0wwu8UCzJFPkZDEQYbs7zCct6aFoU9\nemPSRH93OaoHxeQ+LYuwSFYddgUxVp13/yVeRek5tGYiIfgRedvB00vS2IAR\nmcRqTr9ynGFCAv2z64Ki/hTsaozyU7njFC32YEJf5ff6Ln9uV8wd2ugNBUOd\nwoORhBLeOQ1RKU9XfiXH7HMbcoiWKycZqgppNonOs0R+v0yO14bA/c4mzgjd\nsweDZ9KFsqAf3dLUexzChB0drc9nsZ0ZC/y09Q6kSM2gnoqvlRmHV8TFtqsm\n0F9gMZvJn28wvAwLycysNmZiXN18SlrBJFcH8yrUmPbcynnTt9qVswhTP+F6\n+paFFjYysi8VH3FNSYSIkDxsjh3b8AQLHv8BHbs93ccVlLrEUrs5nNe/Ihvn\nW6gcna/9pXBIgCUtpccrEp0wyMOxb0Ui4mydD7DEeepS4DzFMbmrtYAsQEsi\nNpl/f7hEcFcy/v9dMTPXNnccubCujlj9o5bTvA57mdTABM9H5HG98u6uEAC+\ncbIDjC/c4sgLglZKGvo+afKpgKJ1paw5czTAaMA+eRPPyE2qbBuGSWY2FjBl\nM7Zu\r\n=Qs7h\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIDg1qQSd6Uape1lOSBOZC9PXoAAmcAvZ9E0MDwtQzfDIAiANvlojYjRFutfIQlwFTe+pSwz9rgEV7rF4a//gmpb7ww=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.157_1599204433891_0.033792442555917956"},"_hasShrinkwrap":false},"0.3.158":{"name":"wgraphbasic","version":"0.3.158","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-green.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"f49e018ad330f2ffa8375dd4ed6c78f428f14a63","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.158","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-Sf/MR20RFmGELn3nfpe9FjeuhX2yAr0r3j3XucINfbdXHzEdsx0NjEgeVnN58+ierC+Q+mnxqkSOBuh+Qx0Raw==","shasum":"f67360585be07d0a54d44ca5e9472cb4e8d6694a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.158.tgz","fileCount":10,"unpackedSize":138022,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfUgIrCRA9TVsSAnZWagAALiIP/jPN9ZTozrgo1N0V+LpT\nKQ+MFcIyvRUdcvNw1fYRD8rmmUK//XLD4z5ttfcP5aXFoA9POdSgZ/4+h6/p\n+Wyz/kGf6UBJGLcyEObdDMgLTQwLy4ZH75DBU53FJwztqd4n3KTxmhhgQRdt\nA35A4+FZf+XFZfYUHm6RZNS2tNnOM20Zaj9b/QshhHe1ma3ZskPlJvlib6pC\n+i2FLDG7aCePNa58hW+9TmXrJrcskixaqJdImMmpnzvVWFIzL4X0q4/MvTL2\n+GqxStbv+S0y99wqB13Dj0yvn+9NSc6b0MJ6hB6z0KE2iPjKxRylMM5jtI63\nQtZhX4pjpsgdljVTgqAFadxEHjfTAcjz0m/dJeNtYCMgZMRsFCUoy7lZMuqu\n2y7Z1vWokl/h8nqJ69lP6d7g1wmSFLsmAp17XXGAqgtAd6FvRYQmwoA1xTGz\nFXVB8To5IlHgCfViwWHkVah2d9WX5ewc7Hm6bFH0IePoTRg2UG6wR4082d9F\nIc4o8xqkueOmBQ0XpDHAPHLtANCyFI11TlZnVkVuhSqvJBg0VPqrvuw3479c\n8yCRdr0MEIMgy7L8VtpNEV9Ntey9sp1/8UzKS3sxO4zHC0NgLCwRIztkpbRr\nN5f5oXqjSUZZIDHj805XO8fV/PiCGqRV0EO33ZlFHqCQd8ehPNKlqxYqFJk4\nqKRO\r\n=jfS4\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIAhPkTDvq0wRTT8b0eq9T3hnkvr2BtEOrK0kHdYm255FAiEAzo5GUYzq+3QLH/BP9GK70FiGa74iAYEXSw1z+17M8zY="}]},"maintainers":[{"name":"wandalen","email":"wandalen@willbe.so"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.158_1599210027087_0.0161707934768065"},"_hasShrinkwrap":false},"0.3.159":{"name":"wgraphbasic","version":"0.3.159","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-green.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"a50c7943eaf5de5f0396a70eb52de6df25f01170","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.159","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-hlr+/WYIl0tKex+GquennLOVWa7pY8XLPnjK84KrKiRT43WAzuZ6oF/Sl/ZqdphRFHvMsqxBYMIpv7LSaw1C3w==","shasum":"fd2f94f0a4a7eae8b468586f3093fb82bdda544a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.159.tgz","fileCount":10,"unpackedSize":138022,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfWH62CRA9TVsSAnZWagAAgmEP/Ro6UxXm8HpN/ivk+P7+\n5D0hFehBMp4/NGyrV0Ow+S2jEN/VobulCuwMd7BQKYUiJRgEZzR8pH6eBP9t\nYgM5SMVpYUpBY+BDWRcpUli8s7ML/nuaCa259IO5l+XU4k46qksVmt/1c5HB\n8r7F7vJ2iF9RIm1h5g9DJC9Rf/MDRlxh0dmsjFgL68G+z6PMS8tG3wGOvYNY\nSg/Yps3QOt2QZaAEO1YAN0BUeNQS5iX97wmCgAOccY5o0608IqTuQs+zakxb\n5HGohFWlTDM0EL8siedfg4MSNFB5MW1IbKW5AXyHAU6NdqJsDVN2cJ7KylJz\nl5d9OQxrp8W+EPXfY6HRIhsysDWj8GDV8kU3Voh8Rbt+r/wCTmDnhX3XcT9i\niXbLCP31AzwHAp0IPzlFbcVkvjwmsQ4dZ6VjLQTHSyuohThy8lBxwv+0QpqH\nnJFNN7yRDuudSTDWo0obg0f1wMqWUBugGT60NeIOw5PzBbWEaF/KymY+a+e6\nBfgMTGoNGdydTCmgRXHTyWtO4xGOi1tKEAEVggTnvzvJjuEsF1oIdgB+3l0q\nnTjYWXf+P+DEiy6eyb29bju2OlAbGg2opb+rEbsmUL3H3WpL+npQqVlBpDEm\nsTUzrRxwf8ShcEjmHle6Y2QGY+tamx0RHsoRJgthNPNCKFUP56WMCL+pvzBC\niq32\r\n=mjGo\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDgUV/v6xDIha/vdmMjakI4cafYW+m655p4bIvzZuNC4gIhAJlNaLpjLnGhHistPcMgXBBmluV9/Y7pyb0Yqavf557A"}]},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.159_1599635126492_0.39583570455845907"},"_hasShrinkwrap":false},"0.3.160":{"name":"wgraphbasic","version":"0.3.160","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-green.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"6d681a49499703c93a745036a4335cfe1e88d7e7","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.160","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-d8AHd2UiapEY05m36NyAv/BYRvZNq2qPDXEF1vR3rSOe544soDhSWQezWrqah1ejSuqOBDQQN+GAUz8QWL1S5w==","shasum":"a2ca568395f874911563a9f9e1c4cc6baaded78a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.160.tgz","fileCount":10,"unpackedSize":138022,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJffZspCRA9TVsSAnZWagAAOc8P/2XqwQVs6NDPTPkxeNXw\nYqC/IDBzh649FSxt0c7prS3gxYRPBuZot4dicPu/xYJbt1dEDfAhYO5nWgdh\n6hU++oaWYqGwOVqDS5FlTAysyNZiHw00So8KBJVciQRx+YY4kt8fUTuMPrhX\nZaWBwMzXK+FAJIoAXfw53BPQLIaa3+r82IQ07xQx25wRZ3R0Ij8W4B+T4qyR\nDdTyh3baTYtyxxZh+rKEHfqq8gNlnfkFQDUdnzPGMabCxDvm6wppWi4ypbv8\nhQhSQR4b3Dl7vE2Ow7wbBOAN6lmFXGbsyeieY9s4hJRM6QR8SBq97YLp0WBV\nIV7AVe77R9UL/1RpOZQIh621vVmZgNGpxMZVodSvl6ntjRQp/PHLqaCmrlm5\npL6HdhfjJAuaRmn0pKCr67e/u7rZQqQn6T7NZmmR57DdE3zHUBtc06Rf6V61\nI8FjbSC/lHEvvvaDLdIm9RPRa1/WnWAzmmwoMRNkswhXaUNHJz4c+G6KisrP\nJA+1apLyM3MjYRFTzK6tkRtYCZLk7RntOjwKwWzIE39DiQJqhy8w8jWGHd/k\nWNaaZ7kai7IUms3WgQZDCVHEIwdTmLIktKwY88E80mG+B/EcXx38AFgJcffI\nEvxQFFy67H/dmiuAD7quU5OmKOwnpV28LgIUTjJYxpmi5YnAwj6j2vX4muCm\nEWEW\r\n=A8gC\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBWMCl+UYx47ZOMAIkNsE/GhWNh4WVnZ0f/MDPBfh1mZAiBXmW+340/dFuDiKIoJr/FNioANNFNvhK4Hxa4XEbul6Q=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.160_1602067241123_0.3211505956002396"},"_hasShrinkwrap":false},"0.3.161":{"name":"wgraphbasic","version":"0.3.161","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-green.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"9dc22a8d22b24d66bd31c24db9192198d14f33ab","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.161","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-tHdOwtHAKnSSgypN1pbyQSpVnAb1j3QGDtCDJDc6BE+e+pBhPu6oLIWTzNYKrGxHFMpjU0N3AhnyNikrN+FgQw==","shasum":"88ea978979c6fd080041eba6e1e69c8fe9579fb3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.161.tgz","fileCount":10,"unpackedSize":137970,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfiCD1CRA9TVsSAnZWagAAfrQP/08m3TCkrDKIjy/pqPzE\nSMuT3r0DsB23H3s37uoIWqAp3XFYjWeWpN+ehYx6rt/8V1ZovXOz1EkDF7V6\nf4X9Qb+46g/w/VDOQRSyZKnGGlw9x513U4BrTDU+8ireqqfetTJB/4aYmKI/\nGuMa76LgpecN28u22sAlmHTu0PvBTOnADT4d7ZBExzvIxcL1BKrk8BRWnlM+\nbd9kZpbTJTi9u1BTRo14lvuY6U+smuSGmMq32XedRoGs31pLT4i6RtCuHXDN\nrh4mee4/Bl0Rcp8qnRUt9nGJV5PlGIZgYUQPIODRALihyV133aY58Qxvr3oV\nNhReSioJH+gjKk2S8Po7tn3KgnmgzmonLxycrN616pBFB0RSOJOsl2cPiDBK\nPh2To9brKF7BhZJ/fCry78brkvdPLmzR01nHxpB3fYnCuhR26izmcUhXumPG\nuQ7o6XtRCWHAKFkPN9LkF+CakQm20h0HajWHV4mp253pSn8jFQiMYkm+M6PV\nk/XkU9S/AY3Xo1IaURBGkEOXxx5UkdLDETruWA4mIqhIFPhgNoSeTUAHBRTt\nycVyXjGaxQO4pfwUUDpSY/O9yJmRwDbWxZLAVuy0vLD2aPgu5mBbt3w9QMiH\nuBXShIj3PwDFmyLEGG8iASvGJDwQ6hAQiFx+6eBPKvg9wyA/o1yy/XUGAQbV\nZ+kn\r\n=Then\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDwoKw02JiiLWzq3y7W9rARlBZ66BDAzwK+9SFP3MwjVwIhAIvvmSCjNCA3uCpbtw2d19035fUl99uLhxzq2YEtsn/4"}]},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.161_1602756853256_0.12754873700023728"},"_hasShrinkwrap":false},"0.3.162":{"name":"wgraphbasic","version":"0.3.162","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-green.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"a4047c1b13ff00f1dd07c423a7a43ed62b86af4c","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.162","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-8FCawjHwI1HKJsv7vqMES/6XQpFeDN7+OJ8q/lC17Mvnnd445xnB6oFOJ3BPD8benNtsC4EoCr4M3RyNCX6POw==","shasum":"c41ffd3428341f6cfaf55e41e2630742ef19af13","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.162.tgz","fileCount":10,"unpackedSize":137970,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfkeR/CRA9TVsSAnZWagAAa/sP/ihTCy67V5ZY1PaovsmJ\nrMItDm7pXTCgkeJ9uApiYHYSJF+dHl6TZtdFrx5kWvJBrR1G4Zt5BO9Qawv1\nR9rXygNd5zDSoqbLVEtUlbKPoxbp4dQQ6RSw92Ic3lp5DrSCMZ8dqIknobj2\nxjARgEhtqQsHtUK8jdUGJPhWo/bfYRDzdFTv9Ql/XbTlPS0VAN0b4m/ypuNY\nf9oPnFoEeuXJBgN7fgBcDjeqv+bYTXdomqLL9UuUex4CRW59YyIzxE94iZVU\njI0ROwlzEPTUjoohGkA09SZSHWMGOT9IRTg9dp9kzrWdSKNRQBodBi6f0ueb\nf4xHtdCri7HTovudWRim++DDfnD2ql4vuwOSIZsWKSSd6wd/bxNNRdFf9SNa\nvC74NPovoLqEqImNfv5Tem2mAvFEOUXKCxgdU3sdZrAe/SL9/svIXcJTuxcg\nQ1h5V0S3fI0iI6TaTisxzeaBPpPeYX/MjY67RbxiTpzgOXJkcDzi8pVfG65H\n6vqgldPA1JllsI7WcL8mNUXZ/OrCl8cLI6nL7ugbCM5Yopw689thJHijG7TN\n7n0891EM9PfpphgQxcqmyGEBGIQycdH7vtRLy01Ss5+73eMnfY6pyM3CLraD\n++m9ERRe8hwoIjVCed8aTzPuCMCr01DNqJN8OUmZ43xVoNubGK8+5fMpAoHt\n8cHL\r\n=FMNL\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEIqYcPHDNeUptxSGu2q2qJMl5rVBW+7Uwp0dSvhdTviAiAeRKsXvIJG+4wCSHRI0LXFp3vg40zp5cV6A/EK2RFiRg=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.162_1603396734673_0.2118753430663376"},"_hasShrinkwrap":false},"0.3.163":{"name":"wgraphbasic","version":"0.3.163","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-green.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"22adf418bb042c5805ed6ca3f9648240b3735213","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.163","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-tPp78EwbGJtzJbJmvQnxCR3XM6Zi50TRhNVgkYRGIZTKRHUFyTqb505yWoG/z4FWZkk+xCHe8jS9xJOyDAJdKQ==","shasum":"627f81e59cf1dfe42754677c2c2c978482c42cab","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.163.tgz","fileCount":10,"unpackedSize":137970,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfktrJCRA9TVsSAnZWagAA0J4P/RuuuuttKGKvwrFc6pvB\ndhUg0XZvs7AnYq6S/ughsPQkq2bJlYirumDwGqokk/ddh2zZe8Usw5vRUMgz\nc+6lDKyhMEOzbg7El2cwXJmdCLyXjqVb0Jz18AdT9k+oCPlXhmkbsLQgeLg8\nO+rriEBmkGdbArSDTCejZthslxMjREuMsfPtGVb19y8mWRSTXEj32D2ixq6j\nlpb8PCTSIb/cRFrYCWBqQ59eiyQIBrpiNb7zyCRLHvY8l1E0f+Dc6/mVxOhC\nGVdwlxyPH4DF+eyCWy+MSMxKIh75xzVw01HBTkwn3hKPaFGH27v6Z9bt1pfL\ngD3CEd3C1LZdtpofdYsVPwMhdftJ1cUTZhqflql6pNSIou3980cYV6LMSlV9\ngf9z1Xbdixkg4/CThTBpUN4BzkXjV8lJr7DRyw1HdmEXLsENKBFKqQh1ThzK\nbUVPAEmRGdTutFSGPcd73VhIfH659o8Rd+tESOoIG+74FTk47jzFqcS6ANWD\nNuwWVT4qzZ8FyaapBSBO9Q7uXnUiFSI2S9uVp+J3/gGAirCcxI73GYcvaSC2\nEGnDhR1MQgrFYTkNpRcwOnrCgM/mkCd2msIpffNlqqptapCHLaOSPFV1lHTD\nrrQ9r4yB48MGAjZaahrzS/6LAYB8iOHq+4lXyTNbNB6M7zJGkmQP88NdD9mg\nPoCK\r\n=hA/K\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHmwFcsGcGee2f9IQueUB+lGZmIM6cVJ1EdiufhCFwYQAiAvHKGk0pRpxdv20xsYUey3c2XzdZI+vzZ5KGookGSfMg=="}]},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.163_1603459784941_0.9423911356163306"},"_hasShrinkwrap":false},"0.3.164":{"name":"wgraphbasic","version":"0.3.164","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-green.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"fe6101656947004ef79a47aed02b3f76a5caf03c","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.164","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-tK3rEuYlkSiA+htcrxdhLCPKd5dMsYmsdXLEKSPAWmAolpjlv1Q/wqVOYEQdu5Fnev2nYr+I2BM50gq9sDlbVQ==","shasum":"ff0b2711821106e118b6d37921be554b410473bb","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.164.tgz","fileCount":10,"unpackedSize":137970,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJflsM1CRA9TVsSAnZWagAAiIAQAKQzQVnAiWXTRinyp1yB\nl1X+/9kNP/X6gxBvwapB4z4dD3MVcA6BXVRbnP36yL4fvamOhLPGCmHOVS62\n2UhcwF/gJiIwsmST6NURAp5tNtcowm4xRFroe4DaSnr5hHswVmtKOERAgw96\nr7RuqZcIsJxkd7BQiq/lCvQ2GHng5I0aCPst3YxCl6kzUB0/6R1NOeayfAOF\nD2xoA/zoJXMJrq5VHViI0B3qWNNM3UzO3a0qKZNuy74wGloY36aQ/SFqWIz/\nqFmoklLbLVuyDAk/rBrYcFNyL0DYjbSh7OOKwrvOaPb0i6/5ds7TTBVykKgJ\nuXyOOSla1pX+ciRPdfZ1TGTvonvyagsnGd7JE2g2hVs34KQk2JMoyo3wOuI6\nZpjH5J4i1qCDFyfgeMld8vpcYVSnmqn8ARhFjUgzsFNqDWfulSPzOUvwfbX3\n0ooHcDf0l84xZxTXy/TGzyLtRO7/ioL0PmUYT2tOvU97LBFyz5ghLXJo6mL3\n+1591YJP1tEXkq5iwghkXLp6YMaEbRvdVRHDb9WxuxEaIf9fT8kDr/TXxfoU\nBt2m21BEzNlgWFnQfylH4esmoeZOY/VR2aNdD6r5YciRavIpdJ8HyyEouZw3\nMFr/TEp0AwLPEBWSNHMmx1IL3X/BRqRFGnPib/w+Q5iRxDUa8SbnELAJYzjv\nZRI9\r\n=K1cL\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCh29+peRGTyhBLvG72DwuTUemnauyIvzAW6f0hgxsw6wIhAJnkA+VfmFAnv4RRIclHtZ+ytSxBa+atdHVNjGFjXmjh"}]},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.164_1603715892871_0.06868351870038447"},"_hasShrinkwrap":false},"0.3.165":{"name":"wgraphbasic","version":"0.3.165","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-green.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"2658960158a291b2de6a1ee79d9d6560b0d9cb80","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.165","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-bvHJCMg4Aj+ROesGRXvpDYRTJGxa6s/b43jHj95MEj3UfFzD0mIN5zwYVzlh0tMH0Ziw5aTvjzRZVEEVFYIpwg==","shasum":"6e86a0fc5dc312c54860e8ab61cac79b2d821aab","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.165.tgz","fileCount":10,"unpackedSize":137970,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfmb25CRA9TVsSAnZWagAAyQQP/26P2T717trU+HrefexA\nfS9OOC6EZdyAqN+ewqJnVZTOPydZPZctK0UxS4fAjUsr6o0UYtmTD8hNugT0\nuG6JoChq3sl8G7v2pniu8wS5ciKoJFftcus7P/tygHHCtjdFVPxHl2E5Uf38\nYXRcZfJVwPos/eKMTizqapA97wDEV6CrPVXITqp6vyi/8c+MWaRU0zrYJ2Er\nSvGTMsi+WiV7rhEpy76Bj9KkUFDJIIhDD+Gpni5oiF6VcOEMXqSCNwsIdlNW\n8iICifm27OLFCU0S/I3527qBrvxxdEqRPaObCgVTgPqBnQACHJLiIWFZ3Iu3\n+Pq1bmuurFS0u9M6suIdmFG2lOz074aapXL7L1WqNpyNk9VceQ4RLjdCG1xY\nhOtc/6HmMPce9qtx6qyo0Q45R5YFVXhA3DZryDXZhI1Ix/NhWGN0Ir5xR9gz\nU+PTLZuOdHQJfAqBiGCSbjcz3wMtb8Zypb85MhmuMIukyiCV54fvHbFojTqG\nTrvoCH3OXCA/YZHXf7+zIqJMQvctOYC41TW5zL+qxrIOsD4jGrJzaulJzckd\nGw0RFMn4Z8bwJ0SMPdShHzG/pTXRdemQy9rBwlRmaDDmWr6M1i+gJGLaxwYm\nqWuLqDJdiXQxL1aPx9fTOX828esdRxw+8+OtfxU4AgJ9S9RyzWfhpvFnqIUF\nVBpn\r\n=LvZJ\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIDR8tnjOsT7g8bxPXjITNSoRHpBXSD4egR5zaY6XJFnmAiEA5zZFmvXW0rm8rTUIwFtzQHXrVUFKBgTYtsao/jZH5ag="}]},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.165_1603911097351_0.9328219095360757"},"_hasShrinkwrap":false},"0.3.166":{"name":"wgraphbasic","version":"0.3.166","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"104977a92d5f5f409b253c27524baf825e46c517","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.166","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-0AA66Em2kZ2U9tfQgWs7m3BD2eF+nbrtFgTwcbKTjHSOi38uOrZ+9RsaQnwsX8R9lVSxl37Zl18bM8wzzCHcoA==","shasum":"088d8308080ebedb06841c747268bf7f5720b67a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.166.tgz","fileCount":10,"unpackedSize":137976,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfm7KoCRA9TVsSAnZWagAAAEsP/jRfYKHAOSfAjiGsZ+B0\nLjGcR5QjpGUutS4ZxtEy+Rr1ju0LksJ9rBjE4s06LBLb8qBP88lUzwuUn2/C\nU3JgMfAThW6n5EhuLH7UPih8sYEEg6ilUqXqJRbfeX95G7zP46vkN3RF/r7a\nTd5FUSfmwNsib52qxVGCVYJIqLMHZmY8ScyIkoIKmhrM/FvBdc6+RPH/yv69\nUgFuO2mb9lasFh86HYobFYJbKHbdhNAVEMNz0QHD0rzmiKEFBtFO0iFONQb+\nkMw6pXjEK59oVjUhihJUSA+1f2YEyCBWODhLorIhvpFeaEYqy6Gx+NxnX63C\nmB2h5hJIvwgAfibbKiSGQqjEJJWkHh86C8h4e3nEqQrzyZP5x/jeMnBdbr+N\nxP9ouKmeTg2Ykodx04SKAjtJbmic20oChYrM6lI1a1Q4DfHfbYmPS3DSR2ts\n4Uzva8OKnvq1Ow0NjXt/E6571Rcts2vnq1oYS8zHiF4hDe85T6RfCb9yED8Z\nn/dcU5kI8uMyB7V8JngK2VINqoILCQE8PleshCaUYYPTNC6yPWzji+JZ9/q2\nAvNT8puNsR9MBqaIa47ZiQjonV3op2nlWlVgFIV8U7wpvh8OGOB5d/YxzlgQ\nK9cB1vwNdbFjJhOM+VeHb1L7eMij16iTT+GRi42jCp1HYLkLtp/NolJNkMsh\n0hLM\r\n=Hupj\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCc49YcasFCOh1/jlK88B+6/Oc2dwT30WJN5PALy4MtQwIhAJllsnxD94S+9U4V8dLP1MqNNNGgxxTIc5PW+vzjE9oi"}]},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.166_1604039335939_0.9061263011132998"},"_hasShrinkwrap":false},"0.3.167":{"name":"wgraphbasic","version":"0.3.167","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"72d17dbaf050eb7da5e1b40745b291e81516ed32","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.167","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-Rm6q+ezwiFcaf6whD6lkzzNm9tqTwJTvVbLv3oWqWLkiMUKLo5m/iMRxVcEK+q1ANGlcfm3b4r7ocHINrv082g==","shasum":"b0a3b8f4cfea1e6a7ab5fbfb0780737ebf92aa7b","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.167.tgz","fileCount":10,"unpackedSize":137982,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfnUjXCRA9TVsSAnZWagAAfggP/0qaowX8yEdz9VftMGP7\nX7DRmat8lXI8PM++oA+Pdw8nK/hwYrWTfZ5+H+ulkePTue8wBSEakV675TR0\nk8UQXxiMAygXSpiG5v/wD90NxxEpv/vs7MvgkrSb3bZjASkmq2iI41d4cpS/\nGRNKUzVCib26KgXvRpCLTzL0P85xvjSFIrO7gMx6Iaffk1+WafGZLq/SarTY\nDp4V1gtYyw89tt0Lc3n9vMa1Ibb52Ndrmt6h394GzOEgCtgkIo5cREXtIDlE\negEX8FjLreReCG5rbGEWnas7WBxYb8t0PXekuaaBG8IgCF49znSLpar4xeW5\nkvkyBeP0kWhwEPJ2HpB1FzLrNiE3MQ8VOz4CpWv71C06rhyeV/d2i7QiDcG/\nC53WR2dDmMQluNpXZchRHjN3ItG53AnOsi4i6cL3WTdAEG04QiCQI0bEoonI\nS9YtLnlIY9PiegZzJXlajMWSpk9obdfqH0ZsIntVagQDOGpkTEaU5/LUKs/e\nnGD2WW6+sbTp2xESF2RA4o9rdzCi7gM5u799dChkpm+VYhgorMVXYCQYcc0I\njcl7ZTm49VXiRDi+5Y98GKMYqhffX7c5bM+O6K09MDDMSHURLzgheSLO4FiP\nMl8PvLqnbkooKWtqlePn1k+84Sgf+hAAAlAxIc2G8VCeFOYJg9v58cvYI8kD\n6U+3\r\n=akvF\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIFbjRQoo2o9+uXFsN7rd5tauAFQ1zvWxCaG1kqbDT4BbAiEAsJsrAnPK0KVqCyDnF9jvpnu5Ns58NRUgamXLawJj8EY="}]},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.167_1604143318608_0.8300645357328582"},"_hasShrinkwrap":false},"0.3.168":{"name":"wgraphbasic","version":"0.3.168","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"48c676565fbc913a7345915cb54b23cbfb8843d9","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.168","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-6TB4/oQJaFPM/GXk/4L56VDTVpkExAASfGwlz+Xnrq0234ykhDq6wBo/90VUlo0Gc72lXRGpO4/P2Rn91KYLew==","shasum":"c09416b706234fff85b49e22d7462c577dd821c4","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.168.tgz","fileCount":10,"unpackedSize":137982,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfnX+6CRA9TVsSAnZWagAAwTwP/2U7AyuHWQyrmZ9un/WE\n9Y7rl5Dr5q6snvAByd343a89PtXH/skJvHVPak4kc4+T6s1w6+459Lzvh/oU\n6SQ3O5QSTr7zwgY+Nd6+uKJopfsLWRktn9xDxoSw6Nh/1TgWz237pBiiq/gR\n62o2kphQy9y91a7ovkWZHyByZjnZW+Yl+tUKKyIXxlt38Ef90F6jLcOTAxiF\nPaO9haOOG1/XSG2P0Qjl4AeY9zj3qjdtYF8XC4kvRVoacUYzW8KaN7B5XmIS\ny2KJCxZnWmzvz1Jqra4h4Q+IlCz3qHlJiLFTz3+KUZZRc797y+GdpGGC8n5f\nYZjuoyEx7LILhDTZYEI9MiRQ4GpWFsWXfXRBBQIesE59dceAU8mhmVG2wOrX\n0ahylv4gUOT268XU0BGHLcDoIIbJQbNAkC7O2Tb7arPUmeBNynaVzZb1bn0D\nAJB16VElxdYiSuxYDtAQeqZTudH+8ZNdgqrjzqUQEGw9HJjIYsBDFq9demLj\n9+YMW617thcvfteZ/84nqPui8uaLP7tC1NCgCj3L4mj6rBEuCPN28rInTDGv\nFv73ePGwb8e4LTxPxwufED7zHzaKU/2M5QnC7/f7ZcfutGpa9nxQlxkzmZ89\nmst9YPa8SSfLU/1Su+dTe4EFCkn5MYTV2nfXZZFFBOjK1kxAXqOqKxymHLlR\nKhCt\r\n=/bi9\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCUxylsU4+4w9VGlsfLxIUsHeXk8duVo2SpFsqCYaPMugIgGSdTGrZQS6Edg+vDS1WiGFunueF/n+oddal3KK1WLTU="}]},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.168_1604157369820_0.8380193189449938"},"_hasShrinkwrap":false},"0.3.169":{"name":"wgraphbasic","version":"0.3.169","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"e359895c083d05bf4d43948f062f4eaafe4532bd","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.169","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-ralKS4s/b5AZRp5LfxYeueZ0K2OR2X9IMOvudyLcVjmTzHIzXByVhrdz/Lb0T0RVpGATDJBKMnqlYhycz33aeg==","shasum":"1eafae8fcf32d465fa278c3b169e4d4201f64b21","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.169.tgz","fileCount":10,"unpackedSize":137982,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfpR33CRA9TVsSAnZWagAAKjAQAIfBYg9kCLVcpWh6zL3c\nIdizmEb4H8wvEkMtMuq5et/Yrt1kupibnrimhAD3xkzo+mQeOpLWzE2fctPv\nQXseprbtvGW4HQz7aFRmeoKFLbJ7DCeLmAWKYSzW0k0vfPZJIRqljonPwuPS\n8P9gEBMmwsQ4/0PNpvM2ey26155+HZ1HiWNjnggCLiYQNQZ3nbpmW2KAGyCE\njoRJwb6DqXh4VfgvVhj988fqcjGXE7HwUFHZJdhg+TMywJ/Si6mHSiiNk3Px\nbEnNxZjIPGtXZ0vWwyjhNPXJZF7h63fTWZhxQ3D82HhgbKqHg8vJqBdg6vPx\nLHfqndUDQ7Qzz5U+ypr0OeeLCQW2s085bsEObtucqIx0Fj0myHl9ANBX8L7R\nGZv6QO4Pjqv5BtxUr9VYJ/CgeAbuwpvodVQ33OUI1bcXBp5cibs84d9NKJO1\nVmWdnxcX9+3AklGWpixXlqTeiHs3ykJqlTgUqLuEonSgIreqo+q87ECdkbbm\nlY30aL5WBL13YYAbi2uhXkUHA1CRA/+KU8ND+66BTS3QUIDAm7dRt7TySR9t\nDUFoEzHcAWjuQobF1Gq6Byq7oclUSO38DWiM+eO0QXw9bE9xZRrtO/vgaJeF\n+Go5s2gbAFPxqgosq4p8hWr6g6NxruG/9iyNG7SbBdtct7+QALa6KnqrpfWJ\nKbOz\r\n=u0AB\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBupphCiTHqPdDrJ/FfoyZABTMoVRLaz5AClPc+Q+a7RAiEAtKq8wuW/r5tlQfLdl2VDfMvsRQm8Hc7nHtcjq00owmw="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.169_1604656631509_0.50621721649286"},"_hasShrinkwrap":false},"0.3.170":{"name":"wgraphbasic","version":"0.3.170","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"122af0d849832ec30291373c5752be59ee28274b","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.170","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-6pd9wc1i/+l8g9L82psdld+uYALtkiKj7LdJkSF9JfFF2wjVIplzX1VbJlsX+YjnK4hNZRVB+oKLUunSFNjE+g==","shasum":"a129d5c299084b579ed0c7f1e47222b94c8cb2fe","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.170.tgz","fileCount":10,"unpackedSize":137982,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfrUZ+CRA9TVsSAnZWagAAktMP/i1Fb33uVerlvExrDVOm\nQWv4Le7/4VbC8y6oNBALyHsj8UnSuJRFRVIE9061bOllRyHWsguLYMdwBVHP\nl1+ABu++buA2G3+QtLi1VpejJc4TEfmDIzmrmUmZ1fA8z67KFd1va4EeRMec\nRAD4fv79hg+/Qqh/LkoXDGik3An8MencySeh4sQrzqwWG3jDGPAFGWXXtnKS\ns6au1oba/EIfEksbmAEzgKN8Sq7HV9TX094UMbAQyn3Sxc2w2tnXPgYynPrF\nRRWWMW4DKjffJxm3wMSlHfirtmgTzVMXdg8nDCJy3C6zV2Pt5ESTj/vqpycC\na5z7d0xkONfc6Qj8xBDx7OGkzlfbE9OVXm2PnuQUlZTbiWzh++jEk2P+5eTf\nL7ZwmSfDP3jJaTu92umLZMr3Q2EJ9Zj/vVcBjiG7wJSa1Gjv4peLYkkKLzMh\ng6gQsOR1QU8NntmJ9UL5bY/YfK99Cmbp5A//9DhFarX5e1U4usDcPh+j+oDI\nj7bHnrGCh4NvbApeddgHg0MiIVEsTiSzXCj26otXX/k8cc6RLu6FH4zpJFSM\nQne+T/AnYqsASSDU2POVi4x+tyKuBdmlHgGaLJLl8r/b43GLQMxogVhu/qY+\nX+ktd0XsfhAxvtGaROmQ+Pjmz4Bb4f2dsj4iGjm7RLUDcN7ucvac/p2BN0mg\nKWqG\r\n=uv6C\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQD6+GI+KyC1+0i235WqJWCvRCUB/d06hFRwZR3TUP82MwIgS8zeL+J3GnAsttcPpXUkh7BtKoZDjlC1nxtFIOKAcK0="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.170_1605191293782_0.33948315019290964"},"_hasShrinkwrap":false},"0.3.171":{"name":"wgraphbasic","version":"0.3.171","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"cbaa7c91289f4e289ec79849e519fc441697e4d2","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.171","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-1dvZ2SsWZBfpOO1XEjj0vGPmcFG6WaE+mQ4l4fmKLalLRPpmakLyerJRRsOPxf7XhInxR5rySIVFRAlbeAORuQ==","shasum":"f40b0c18c5516b9e985eb035a35f23cacb9c8099","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.171.tgz","fileCount":10,"unpackedSize":137982,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJft3LmCRA9TVsSAnZWagAAs+oP/iwBZG3vWDtturBQFz1U\nlFu+XlHV/4iMAXx1AwXjeQ+SgaN1/rIYu2tRb9PYrT4ZxtyLLlmx20BZzZs0\nk40AtYuovfFd4qpWKcrlY/QO96pDDE06sH1ZgBzKyPx6iGb+oK0ToZV5JZ5w\nKjvrEbvtaSE25Kn9BRNqJ1sUDojYJwUO+8U744c3HsZwjyNEMKtHHw2Axa7u\nvU6pBf89n+pysEE6ztumyZzLv9wbuPAVgDEizte+Kx8A1v5v/lmoM3ZHFVat\nimk6AhHdfttyKyvxVOJJtJ6LToxgeUjP1NL3qn1Mp/DgSRYTaYLMqTcl6yd6\n1SGpm4BxSKMpJc2tWb5GUzc4qrT9XXQXZv6sIWmqcPpmUWuva3jdrzuqCFdN\nlJjNMVu4s9RXfjkaJfEtnvX9SUCCE/Xek5t1ekwP5LTqzkxtPpZvwTqRbIFY\ncmIyPEVuURyHaJkX0Q+KMqFP5AH8+ySAqv+4fdDqvlMOkDOnUlnMFaGvwAtP\n6pJ5zU5NCiYkPyBt/Lbl8M1Une5MY/zLheOHTF8OB0laNR5xIie4Q4vpWrWn\n6c3UXZVtYH6CgPyVJtzAvmJct8t8iUVbmrn1pRBq1Yrp4bUF9wU04bw8jqg0\n3rAGPhnbpQq1v7/xu/f5kvoWxaScLBB/33Hd3+SxX2GBKvXAMUFBH9wu5BxS\n9tJg\r\n=mMov\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCRhB/t976tlEikC3vkAkzysTbVbgWfYwYrRZ7RmkUJiAIgfqUclpXgkjaA81XSpd6aRpc5bl8hiAxQtmNXp4OpQrQ="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.171_1605858022268_0.867564076414681"},"_hasShrinkwrap":false},"0.3.172":{"name":"wgraphbasic","version":"0.3.172","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"e1fefd0cd2a2c75c07df44cd6486b6a900512711","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.172","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-KzF4+JwUiJPdBCdS9yYttUQUrllAPsGvSkn1mnbIhM7x9Ezmb/DLoTpAn+18iZcfRdrLG0NuD9tByOjTlGBhyw==","shasum":"21ccfc6df492908f3c8861565fcd846bfe562446","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.172.tgz","fileCount":10,"unpackedSize":137982,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfvsaQCRA9TVsSAnZWagAA2F4P/Rflv17SkpZ561XaOkIl\nVIO5+9fo1lotj65y9h0edQsoM7C6+uZRb3MZwIxDqTPKPE3LahO8Z0jOo/ll\nS3iHVnig17zaMVdkhuCBRk73PDeWDUnw4NMWZVFygxemiT6uelsjHX5E0D5B\nruO0wKlYlCdbHEe2qBQO4iwKDi4czxr3xiJ3m/5vpZjMH2Lvm8FT0qbmAbQ0\nT7Qwl0GJRGrg6rZuY4AJqbLW9DubG5JGk5g/HwOOk0prGuvDDY2ecsjj+3Kt\nnEkLBa7miTaTsMteZIDZ9T8W6HBZUUWqEGYKrXPdWsijLUMGWQBAlxc8GvBR\nM2F4QcnZVQx+iSV8fmrez+1vkeOGUcIuSzOV+GBBXbmwpn0tMu53V13p19YT\nK147WcuAO2OHHhUxgAo/dxAJFxs1P4mFiEHQQMq9MwQRGAfD/eZJbDl6PCd+\nby4oo1gKtqn08fwxlFiFBtzPXvYjExT/j0glEbainL69BH0/fYRa76XtwQNm\n/bltDs/YDxreI+7AtWwIuRnQlNhAFDWJ/VFC/HkjFmlNd+KaiWMVJl+bMTja\n6VfUD+d0/v/BuSoKkAwlZN5J3RdqMj8EA6cg9lT2U6hBiExTQONzQuausGGA\n/rLT4iSs3gMj+eb72+UcSWqSI9HzEjCPfE17MUeS4RXuZsj68DUlvA0zcg46\nyK1a\r\n=mkeM\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDWpWPyLfBhQ8kltLM38e7Tt3vxf955g0CT8vJuqC4nbAIhAKU/Vf/NLdc7O1BcMPuU46vqSU/uTCxwSVTHZ7tnoqaa"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.172_1606338191699_0.4384111759159206"},"_hasShrinkwrap":false},"0.3.173":{"name":"wgraphbasic","version":"0.3.173","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"42f3bcfbed38b9ea35cb9e9b1dd4945c8adf108e","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.173","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-q0FgFuv7H4vWHOUh+buPW2uEP/cB6kWeNA/Mxn3vJh5dACeVHnzY+elmiFjUaY7GXc0nHNZTNM/+Tc2BmUNkpQ==","shasum":"f81a7ffe823cda93823f3d1975022ecb54725d1c","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.173.tgz","fileCount":10,"unpackedSize":137982,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfxKzlCRA9TVsSAnZWagAAOVEQAJXJX2RHR1/R0+8C1Efs\nDRk7fShPtevPAg1bcjZe70EAFtGK+9dX9c3JUk7+jCMiMLVLh8xYmubiYVk3\nQtjw7jGghMUdNaWrFUqzEZMN6xy27UT6KU6nvHQRw7fyx2P7BEXA5J74Ma9z\npR4NYHoy9ig08qegACAVt4FoBnNOrlJo6PpGzSRoHsc2bP9Q+066kcu0Hhbm\nKpHYKtvoQQ4DP/JFDUyfzc3ktEzONaU++EqweTuTPjUiGG9eHPddESyr644u\nzidEJ3VBZwucnaHCIEMJfiauSeP0NQXIvnOItUIVh3P48e4M3Gnd/0hpRIOd\nIJWU2DE1Fia7hJEtAkxzdw+IRJ+dd4cyR8nJNDhoGaV5aw6AKUVTpssQZQSq\nzEWOZkfwOim1NM5W8C+ysDciG7aYZhTT4fJ7gvl8nchRemPerxaoJ+05ejp3\nbXw5+SQNpPnd2Dw3T7R8nSqW6MOhMjxRoYzuJ/yg+YUH5VKqCzThmiYV94Ck\nlLLOfkL2Urat/7Rb3VYTlUpntkXhqZBYZQHrqF9qK8TZtcGjT7dk+ruWsevV\nx0du5SQVhVX4UETjxXS9qCwEUAtLgXDZr2BempEfiCCU3LXNl4wudD07BfmY\neGGN8mNBoav+9lA+yEDBFufYP5ikLfs3mwDjBUiPb+3pcaQ9sUsDcNiJJ3W/\nJplZ\r\n=Qf7G\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCav1IzdMA5gZZFyinm9M8PXKXJVoYh4/hE0GIcYU4quAIgAjLwDQiV4f7uVB46w4KRYipcldU8wNZVU5zVdjHkoIk="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.173_1606724837336_0.10543081949798694"},"_hasShrinkwrap":false},"0.3.174":{"name":"wgraphbasic","version":"0.3.174","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"da838ae48b2b6c8dffe1f4af4d622caf575e393a","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.174","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-Ln4ygs97Xtrw2gwIlSC89qobE/7FyfG9R4gw+ZGHIZqZ8tA6DKuEvlDyHLRcgh2nBY15Uq+EgukKiF1lh7l8Ig==","shasum":"1bc5c6cf5e2449a50694cd9c7603a4289a6adfb1","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.174.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfyKd8CRA9TVsSAnZWagAAuckQAI34JUQipR75hshP7x8x\nb0pBl+bT2XN3ToqlVI+T1M1wCb2erqb0UC1moJ/G7RnHS3AJFccUCFHScR8+\nTd8Z15jSqqYoGRVGASLENfswEOBcwf48ThmoyeLTLh+iyIsuY+uyXO9bqvGl\nse26SH1A1i37LAGzSfzzviuUYir/lHJEY0FATknJeeviI3a12bh4gCpeXvJ4\nXJskqjQrOs084hypB0Rg1r6WnU11G3i9vGtBZbWU2vOsiU7xPTGkSEx7ZOZz\nz186H+NWRqJR38iBzKMukx1J5EfDf4rBXwc8MkSsFDUyZh2gF3GRWnBBPWMT\nPOw9fIbr+O8C6JDG3RVgs8l6kdt+PQ02REcV4iCn2SvhqzZBJteih+tsJE4C\nFWDPZ4xa1dxNFdEv4j7py+Yxrl1BdspweD7qfMtAYSZnYqSDKc5W1kaKuWZe\nZSDx53wFatHoW4gWHu5NlE1pd096QN1yJAjkVuStZ+oTbUXPSVU8ImSxVUjj\nbQKFCmNoPTP0a7RXloZJeXa5haBpWRgMBGKCtgXlU7MNB5NSAUceoVLk27Ds\nHC7q4Sb6fqcDgeh5iWYz87a2LqxoCtZmkzjdoKrk/NQgIpZKYSilwvrK8Fj6\n0psdbzmiNB3lgX7WYe7468EXbw2cHCF4mL4NExwTewqMyGHbbfX0lR63+Txl\nMn0A\r\n=NLXQ\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEHhUWRbOxCjyh4NQKcjaXJGpPsmS32Ehouvi6RRHGg6AiABB3+wrqilPgFS+jqtn9POMUtI0yQtjkXUi7wyH9cQYQ=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.174_1606985595635_0.7876217697763463"},"_hasShrinkwrap":false},"0.3.175":{"name":"wgraphbasic","version":"0.3.175","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"37d1253a33cf9618090d40e6c5d4a03c59b7c47a","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.175","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-oyRW9fUcCn0Apg/mpqSZ4K+ckrzINdmYagceaOOntyybrPMgiD+PpqfKSgZphXFTjOLEliPvYymxipdWGvDKqA==","shasum":"1ec5cdd02b9e03aacc295da00171e1a1c1519ad3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.175.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJf1G2vCRA9TVsSAnZWagAAUhgP/Rtq0N9JqH4y0h/Xvw19\nvPR+gh8dTh8Ku2t1338qBYoLqAM040p1SyRyeb4fV+K9UW02QEA/V/jWcccO\n+Pc2VwjW3TLNIRoUc3rsGTWIFf6hTYNfksrQ7pTwot3QuNqQaZo8uwcunPJT\nSpcXNh/Rn0qfCmexrnsvaz2fk1TMRyOSSAcPaVtBxWv1vmxiB0ya3d11nX4D\nA81NCC8FkcQTyNBIEZ8WpWsWHfNLFbIh0djFtE3spzEbaT5bFh5N5iSQwZdP\ne3jUcVlCxx+L2HAeGkNbpXc+44AUxSjmvCYkLxfSavmSsqUTl0fkvmK+vsNm\n+3kRTdvJlhEzo06DLMdHBacV/4OdopRyPkDU8YQZje6LUgcUgMCwjoY8gCPl\n58Gd45y/R9mQ5Yt9FXRqIzaxk4vTDpsu950jx7CdwWX/9T76VY7KtWM0nHAG\ne0O31wwtAgC9ya9bQxajn6PevfB8tPANNxQ/92h0ffBoTH1xhPoYeHy45Xi2\n10VczIko64ODYyuq4ZWezuJgaSi3GhSNWvZFj7h7rPYp62/Eo5k1QRoboMjR\nPHjzMnzKXSePpUGBJ4E61UwZ06MMcaJb5s9wXGVw6Nl78MCQuI0XiRoDIoiM\n4WROTLgQlasYb6KgIQSuGvGwgvky3aOKiOOKhsnf7VJ7UxXk/tXhptLW7/Ws\nuLyv\r\n=KvTr\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEbNHwwEwnJEJGnycCnFyiCjq1quRP8BkLqdPkeQxtZTAiEAh3OKCmuSAR0W/xX9ki0sS1svCaR9pVPkhyO4IxVbD1M="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.175_1607757231386_0.6361919480791365"},"_hasShrinkwrap":false},"0.3.176":{"name":"wgraphbasic","version":"0.3.176","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"c5e48cb5b421ab45a5dc7815c0991c197fc571a8","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.176","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-e7Y+Ozaa1WxdOZ3elNFBnB3QtPQ3uUXrY8kFtkuZSodyCDp7uPqimLWsXCUWIEidV1CQlbX3iySpJgA8IsZIWg==","shasum":"8e676b6e59bbc26dd7a2883bfe90ba37a50c0100","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.176.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJf3m8+CRA9TVsSAnZWagAAbgIP/0UfAtXxWMFJgMPGlwjb\nhmyypjF21U0Js1Wzn4Sdr8xmk69TECj5bfixaTubB48JWC7+yUagey3Yr7sE\nOLNwyS07fen6s3RqBg1ERzHFXywHiLlVUTfXNxzePg/uDeUKiatSG5Jv2qzB\n6kHikD+wRbWYuaMZN42G2D/Eb8F1QgvwG9FbQXMGbewKe3J/1mofehlRDg3Z\nFHkq7CWjcbFvDDP02PvRTnXyKe/CWpt7PGzsL6q6Gh7cSsR9xhgqW4KI7g+B\nclvZ/UgqxhqJsL+/0H4Y5wER+2zZ2+28CmaWikWt++nymj7++B18zh2TtJVO\nji20NvhiZQahTGFmzHozDS7u846yi8VBHZfCN6+nIpaLfL5mHmS7gsra58EO\nYIwBEsvEFOmxef+xkm7NjZ+nA4qgrImgaKPFrFmwW92cZUVX/EJhHqrFjwWZ\nuwkn+dlVbXEwsc6R+tM50zmt9wmWQr/WCXHa/3e4vT9uhz61E6Pi3i2ylXFH\nl5gKbkUkymnbwuY4dmSKpfPAblAINo8s9O/yKUGUBGYDHpWfMBqjoWqTxi7h\npCdpzrgf9C+02JaQhhJMdHf8o3fqLwQPruB6ePdYg2SXDb3acOt0uUcJleYe\nh9le2havsSwCIkK39l3VhH4r1P3Nl79L8tG7YTSnVkY4L+nebE8/phEfLi/P\nBqJp\r\n=dKm+\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBZgGwQIe7O38Ha8ThxEH0QUQ+UoRYgeKXG/WSuiDwSeAiEAuElnxiWAwTgL/V4m4g2VzpPd/tjIawh2OH+65plKfdk="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.176_1608412989921_0.8851280020999857"},"_hasShrinkwrap":false},"0.3.177":{"name":"wgraphbasic","version":"0.3.177","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"60ecac19927af3ae4931d9cfe8a5df372eb420b4","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.177","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-pCIE5x7btC5WvH4meISo+cSHBzojQNsMorhoGo923LBHY5PgYYpxSIggrQHlSgjd03a20U5liJ8LymnWnSfAdg==","shasum":"e138cba8ebf18d9fb1fe3c71cbd2f5a12b5541d4","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.177.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJf4LBJCRA9TVsSAnZWagAAUn8QAJWqqo9LTjJZL3SGpEKp\nyukWZYuFpkp7tr3nKI69tuYL3HQvAutnrmA63FZACFvw+OSnvF9KlOaQPDv7\ndqdKCKQvuzKCLDNqTqzQZAbYQlPL2+MIGGNyRkRQ0yDHM2zCaS6v4l9eitvD\nj+ScX+c6ysLuJQokq9YxGs//DC9SXkxzMqz0z9BHqOXcpU53trFut+lEXrxk\nE0RDEXdg47E4MP2h4ThocQYJGdsaZEl8Bu8c031eceOY7Q/PovG8WFxXQYxz\nmXwHhzQpV6z/tvraNFWz+/sOvNeetiPacgw5y9qcYxGwGo4tIAXz4bfjO7lK\nQT3QbhExTO6AnSNvHuneKPxoj1U7eD8tVaTYML89+C5mPh6QKeNsJg6/mhnV\n2LdhfKN/332pKsHGmHeYMCt9vwdq1tp46G5NXDbjplW151Ynl+rVqVL666kh\nxQwwt+Xcc5g1ivTXKdcYEzLKGo+NRBbH3JhOVtz88B4VlxITKpMwE2j7iONE\nX0ZJaNFEw2eflXC1Y2V2gZbbjLzC+Co+nOpTuS4ZyfoNPGUPBybBSgKNn/j1\n4GlFAF8D1ltCDFqqE/uJAScgrv5fgweghAy1TijDR2ykTQmvC+y5mVF43JYu\n63p5DiiCiHko9cCHkeJ3Uj2JYdZwqUPL+AEir2Gib9gSk0NboW748ea8C35x\n9L7b\r\n=zcOY\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBB+cTynU1RUSFz39hinx92/Qck6vnBBhTZk4WsTGmcjAiEAvupzICzyKC7hxREgYLNqr4s/I6o38U0XnW5TLvRuGt0="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.177_1608560712699_0.32957628535284567"},"_hasShrinkwrap":false},"0.3.178":{"name":"wgraphbasic","version":"0.3.178","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"edc333a6664dc63bc259a48a1d3a28896fd72546","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.178","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-QIhLC21lz1Gb0YjCnT2L6pv9Pnmc237XY5GaQb8d9H2hrCjORI6yTUAzr61zaxqHYHCcAZq3V+s7zPY36BarmQ==","shasum":"72efc5e461f3ddf14739d5dfc3a2492f2e80c8a0","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.178.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJf4s8MCRA9TVsSAnZWagAAoVIP+wdfUfSRPAEJpm7PuMsE\nTNe3gla4PP7+9hwEn2C0nu3vV40qInjalCfNbBymy8c3Cj1CXb1EGLcnkycJ\nzUTGckmMN7hTGoVi8BOD348e7ZFuvbVCc0WWf0JMSy3PE8DO25TzGgkLE4sq\nRN+fPvw4uBCK6aePRJ0XC7AXiZXw/9LgfJbCXcwIsJgJQDyULVurW/wtxFul\nyI5tmoScOFLG3wLzR+d2QBZIxX6Fs8MzK6c93xDn8+DOQwFFt6Fu4iOyLQXc\nxi1aT5lnHpRt4sVdjR2ZaBbzU2gs+UrvUyLFrtyJEEJ5DUGDWlIX+AnGJMMM\nCFy3aBeS8xaKAp/v4M2SSrlmg8B3zLicD0Yz6ncrlPZldV67G/taaWxPWsVH\n5fJthdhopoyvPNOBZt1DGH6QCZ/rg8Xs3xoKD62FrhNAesHI6pgo/VO7bjBO\nIebcIwUuTwUv0xcvpXhZ9u19sTW/vX0JYpAyFTFvAgo/D5OMQ9GdaRTgIZ19\nf/xQJudKPtpa0FqTkpVY57dIzvky0+vf1H8/r9eqn66U5CEp63Kqnmcu61dq\nz150+exTR4iwWsMnmfQrNtBYBnmzI0siVj/moTdsJvq4Y44gMsSjyEFxwGWv\n9Td/0wbEqwK8IMAPu9T9W0cXhWndzexdBpxlhkKb7oQ6eDOcm/GWinh5udGl\nz2Ed\r\n=KFTd\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGI7dIP+p56zov6qsJlOxrXi9ekIhL7jaNmKyZL6jpGZAiBA06WlhemZ2pIen7H7Un2sEdneSIkBXTDfQvrYQp1Pmg=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.178_1608699659412_0.9130462610396453"},"_hasShrinkwrap":false},"0.3.179":{"name":"wgraphbasic","version":"0.3.179","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"b415517cb8f45c68817bd05365dcaca106042bf8","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.179","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-ioOIi4gaSiQLihLTxnY4/bJq6/X3LnUe8UPdEtCKn9Umaj4KgBS0fhciFtnFp+x7TqSlPj6CHXFVYHR+1f0zLw==","shasum":"a9f4d6fe3a5b10f3a372b3af52390aad4b5a0703","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.179.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJf+1rYCRA9TVsSAnZWagAAgtYP/1d7zu6LPdecKIIwMFER\ngyAiAh0n8BzllmCEoOtu64AzP/al778oFt8pJ6I0TkmCcpOyEEQ//9HKuUDA\nDwV3Hjgik9Bu5lM/i+Yn2hKqvrFptY0pAYNZL/zIUmmN1cTmYzyLrlp/cupV\nXVYrZHkqMHa8xbXk8ZLS7gWI0bjdsTKSq28ab7XjEwzW9qyP4/O0aWdwnlEo\n2nttB6XcWbsSzOdxBikwUt/S/omYPSCF/Tfz/78eeaJKuDYGGX66dGwEV86j\nKApwKxEsGRuzKkODX1yL/SF2y+gb9hNxEgV5Evc1QcFtsosVZso877/rqPQh\nvUJ7G6QKWypn+klcjHqU9jUCnnp9NailkImOIlYriJvhpggGIErIqT76WuXJ\nCP+C/JJzcQeXLRmsJVppXNX8tnCmv2kMQlxwKXZII0c5Unrqdau37TM9giEC\nvqxad3KWWff9YVM0Td0ZZdJehttVK+7P9bo8Bmp/FSOQE9NR1JHE+1yrCXB6\nAllXVeCiCuHxrDWa3kNrXcq7ATPqc63L9p7UTvotScbzh68VlARBPbp180xE\nPjz0DCVTknGlwZExmvPkjsa8SWURvU49fZ023ckD+1HxGI2azMurGsWn911F\nbdsMMEYsRTcJApksb1l2U1/uLI1oVUkcpRHdV3uZZq+yUVsgvyGOHWgQ4tl4\nbQjW\r\n=QS7s\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIH2++ipIK+QLqVnvVbELM0heYbuG6xbMO/ffrQ1V+DJWAiBsZP9c1O2tcaI4J0cjkKN9su5I9Qdgza8LOLQLR3+w7A=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.179_1610308312091_0.980261520404957"},"_hasShrinkwrap":false},"0.3.180":{"name":"wgraphbasic","version":"0.3.180","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"3ba9e88e3f19f95a42c14b345c9e80c492d6db13","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.180","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-anvrMSM3vCkFe7kNvEtHK/M+77tItgiGGmeAal2fSuc76Ds7L3oQ5Q2aomVZClMDqDsVY6A31e1W/79TDvU+lQ==","shasum":"8ea5c012761a24a4273c141a51fb68d8bcf34265","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.180.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJf/w+QCRA9TVsSAnZWagAA2t0QAJldXH2Rbrxizds+o0ek\nRWTxTMh8XfEL2DIQvmrTk8OacR7/+B6V0HtAHwC8WOJGxNlDNHpxr0Vc3Xgj\ngbvJ3D7xnJ4enTXoCdl0IH51Axsk87N/HaLkX8+3SDKMBdkYtTwZcgpKBB5b\n1+w81QT/dx+9D+OT2ZDz7Zx+naCuKGopI4xipqL15pa+yQBdFONLxWNaKONN\nKHF1v9VAW7yf/EXFn+ynqP1Nep6UuoTzZiRFKnT+D1ZvfwtAd5qoyUDgIKJD\n79YsHN7C5KJ3vbR7KlO6t1ybQgsykyTqs1dzMm0eXG3hiwyS0JI5QZ3pEjFx\n/Rnhmi5DGNiKzPI6HD+AnbGAPwhTNHLaeHvd59gUiNnAKBes0TSSLegVBvHM\nc/94Nf7vhlFohls2m3xskoePQXAAP/5duN35KPSiBKjJjuBGpSw3JcVLz71k\nYzO+edfEJcA9ouq6gvSAA64/Oi96zU0CJ4+O4ktnrUeB5gBBBqffRx5wjj0m\ntnU2YRLy6iItwq5DWA7yDwoLU8ibt3YuVs0i02Jgk7sDSmFIktmTN4rRFHO8\nrTBrMEL9lksV5zLXdT+4W78UAwzk6y9DkOndNruRkX5d1KqzfCcjiyP8wXkF\npKM1/cAv0+N4uH5GJ2S60kRIzs1bX/buihB3ag01vqET423MxVX9gykN4Oi4\nflXz\r\n=/zT9\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBpnqXWGZTXaEQ//lNSFlg1SevvSUmydj4fI7dQEA+H+AiEAwN9RnofK6qoYOe2Ge3+g15PIESW2/M/+BWvj3+ORdJY="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.180_1610551183748_0.14567765274706979"},"_hasShrinkwrap":false},"0.3.181":{"name":"wgraphbasic","version":"0.3.181","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"e3006d94bcc0b417f42e2392a61aab36119a1c97","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.181","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-VOh4MvebTDya//ortUjOY4at9JWBSXt1O2/dlX4XuZV1xZOhv3Q+vpucVfsdYIB5pd6R1ZsbAxd9rOxU2B7Bfw==","shasum":"3c63f30b32b1eaa071af6fa75ba9ea341dad0379","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.181.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgCcXoCRA9TVsSAnZWagAA5zQQAIOdec4zQGH+wdrg6TMM\nx72AQHYq/k8Ta7rawtZKWmp9OJMpmhWPt745zK3ondXkpRdJJnxM0oNTuDU4\nhuidN031IUhKsJjZpq24xds24/8/n+wVWuxG+yXdy4h9941s5tFlPDl7XHz2\nTpws/ht/Dl9e3JT4PwVJ1WQCRjTp3naHL6GP4VYvmZGoveLeoUWVK/xhE/if\nGjuApSzdThpJyAgunSMXLrfDRt41DFn9mpsiALDBFtGYSFE7AoqMm5b5Bei6\nFYoAc/YrsccVmB7ApKiCElTxd95Qs112WoezcRh/ltpgJ/dzYtcX+UBSSLqv\nvBK/WgupEqn6jnBGcxbA0FGwImtx5yvP+Cf9WKKwbLCJq72KQf6ieZKsTC1G\n3+4xaaM5ha+XDJ3zG0slEKnn5RRtzau14P2BCTVBgNrDeYBV74zlYTMC69ZK\ng9BMj8bPD5sAULbtVWv5MbqRFP/ucV6+XuGuzYkZ2zxgZ7AIFov8iKyE1d15\ngQgzxwfJ3WjDgQIcYSERVmF+wMv5UfzyhbxDgQkuxblK5JH/+IiQz6OVApFx\nF00Fb+2shz6UdrKsUwcN9QCRwcS6aVUprH+KhOrqbgKu4tVi0trKbNSlKeZC\nAWfQ0sqkXAXSJdj5CrdXRnw7pQYWd0ivacpy5M1PmhovlufZQXRQnI1/GBbe\nwpl6\r\n=B6gl\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDfW0SPkymXAIu7L4ZxHDurbaf2Ux0MXAtDI5mpnkPtSQIhAPWIzWCcqv4wXr6Ee/NdEClJ/t8RUfOk/fK89Y/eawUN"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.181_1611253223816_0.5879088807762636"},"_hasShrinkwrap":false},"0.3.182":{"name":"wgraphbasic","version":"0.3.182","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"d62a12a04786d6e8de877079062d7013eb86e100","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.182","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-4oKWxOvaIhJtqJIZFBY82HeLXW0Lb6AwjULqxvtrewOoPQzNycToEa30HEVjSXsFeE9J+U/BsVfgcoqCVXm12Q==","shasum":"5143f2b7d2e1764653f65bdf61e9404226e38062","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.182.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgCrs/CRA9TVsSAnZWagAABBwP/0YrSkRp66MWjKJtSUDB\n/9EYjXPP6CpPmS720VoVoo7O7mw4IUy69eDts9Gj1PKnZHEt+gIQDYFwmmSw\nuDEMNV12vFpGSpuQaKYlHsHf1trhmGSyqyW9201kvVgt8e8438jlOuqtC1oD\ndGwnVldrIXJa9gFvO8OszciY1+Nf+WtILo7iH75N5iywlmBY6JeZjFyEWtyW\n6aZVsp9nKghSh/qvHKwi9PjGktCi8ENCoj7N+4x6cD9XbRr+53LJG+GzT/ie\nNhDc93ilaKyEe0JV0ITzG0eGNi6K9jXidfsf9nMDN1C44uBp6CWPLcFpN1vp\nFgPxrh8fCKZoxnazz35Dj4g8/SdJvLcbRgbVqbUpk9Z7TviKtF8Y69DRJ6/f\noTLPXNylwtTVdefFWKAV4/E+50w1pXsW1vvPNoWk+DWQkvjVbbCqsWTq6k6b\nIjpKrdx5AlfgVQ/Ww4kdheH0vK6mMP3cLwrCwMv5AtBj1iquLidNm2MKp667\niOeYBrSGdmHNHIpCkA5ROa+/+7QGy2Y+r8Q29Hh3UlsbehcZe13r1oi12mCs\nv0fZBt+4v6YZCD12LxIgg8o8fNFAIPhep0njM75TIMwJ2qOkXGtjgjah3oHG\nQ2kmJZBYy/jlM3nlTmYEFiPywWglux9ByBm/mZiUvzsLub/l8sEu4yUIVE8A\nO1eN\r\n=Kf8o\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCfOy34/zgRNHflcT8MBNp16dQlwach2SOowGZan8xbRgIgK979X5092+qSBpm5w4/T8PnED3VcIF4jIUHcf2sZRgw="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.182_1611316031001_0.0519417365403092"},"_hasShrinkwrap":false},"0.3.183":{"name":"wgraphbasic","version":"0.3.183","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wgraphbasic":"file:.","wTesting":"alpha"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"315574e8c2fce259b12a93509d1506bd2c13b5ed","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.183","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-f9qIO5oxkdr6ksmAhL8Z20ugYIUMVepUKBa5EpeLofTD7atteqbV85nv+16Toh8+iNQMqMSNml7Mgt+UFIyjmQ==","shasum":"2da04ed8d3b282448bd3126c6492a901d814eaa9","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.183.tgz","fileCount":10,"unpackedSize":137989,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgCwwDCRA9TVsSAnZWagAAkFIP/0a2RmGMhbbcWy4TKv8w\nWqzs8Zkk8PgOvtZF+VXLnbLEkMlCcn1Ub3MdgWMr9aMQVUWss5RPzL7H0eC8\noaged38grInTXVGHIjdBQ07fzTcer30wL+jaQPqB633qC0Zla+zjgdGy6D9R\nS/m3XDB5YIkRXfjN34F4Qwr1vhub4pTZWuXepGLbwCEHZxXTnqh6c4GjUhD5\nCel+HavfIP74JGcppBxjQSUrQU54h6DiY1HECIoJYwjkUA+g/bAkfvKanFFM\nVa4oDaXD0el7W3U6a0jvDce6yrELAK4hg9JK4DrnDr+vRcqQA0hUXbeTqGyN\n+fXEx2CsUPFG+7aZoQPl3xgwiyIUiOJ8/B3oxffUCIVvGdJU0nS2ypTI477J\neYAwwbxm0nGOUJkwEa/088NDo1tpbf/vaHoIlOYYkDrEcAjvt81EjV+B9vnZ\nJU2w55UhXZ+tNbC2P9V/WCkkaTPMRAA8uMhf5Klj8FH9mwge+7ijOUBTfLPm\nu4V+nEnZClS/ePsULSqLEi8utlDXUaCRROXOy3Yk1C/lJ6asnZkLzcmA9poX\n/EVvqqyEfQfj9+uz0FzD7HlvTKlVmCZ9NgUlvHk2eKBbZmeErxHWvGH0SXRw\n833Hf2lpH4xrNA+N5udItv0FJxqWqYyVM1uHrge+0+E+bP7YAFCQ2kD+uhsV\noiCo\r\n=N3TB\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDV8a/NY4azXUJcn6auJAP3XYdGsRUE8FZBOHYaBzis8QIhALMsRJT8Yqrpu49EqmthsVDW6yN23NmsU6Bm7ET3YllH"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.183_1611336707423_0.19980440513146758"},"_hasShrinkwrap":false},"0.3.184":{"name":"wgraphbasic","version":"0.3.184","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"0f13f26da6889d3d89aee4fd9b1dab73a12dff62","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.184","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-2kAlul6A6PhayiL6+ZPQyWQItjCitmV26L8uBdGxi8qooG40CN8DCzclGx0FrpUaoLLFjddjwmqoJwxXZ9wxow==","shasum":"46078e2fe646518bd017f052909370fe49a50422","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.184.tgz","fileCount":10,"unpackedSize":138017,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgDYboCRA9TVsSAnZWagAA4bYP/3hHRfMVMPgN5wbXs04x\nNucKIeZngacCAs1lxPc97pRjZq8Kzt2p06jV/QPM1/1gX29QnSSKa586BCft\n19ehN/flAFkGY3EdiCdtxK7ag/OyPQewpN9hJ1dIDG49VCYPx0ES201M0MQn\nyjLooOsk7HHetHp9/gqd3/nqaHRlX6i0eVv4WeBqZ2kL6u/r1PNGqs8OJxM5\nu/n/xHynd7S4w3E1LERupiulVUlRc9Yz1iT4lNPK7TOk+mca7h9SeXBcYHou\nEa7hLW9pVzkJ9WlsY3fH1yLjoXn4qcK1tECAY8+r9nMj5yjlde2Bte3oiMic\nISAoUAu0LyMB/8c/a+ay5avqXxR3JvTa+D4cxweeKq+fFnEji62t3g9o+dtq\nVF8rmUh8d/qUCqEtco+KzJRWCcxevVbMf4CDSNoV9Oy2DY1APpN4UwEEq7N0\nyUlXuniWnIwwLEU9fqZUctgUaK7e+TvwjQbLBy9Gj6/qGPi/t4OMNT2Pi+9f\nUKzSIbmk2hwzWI9Plfw2wxctnx9Tia/cWq/jzvSn/JIqiHWlSjvp1H8z8dt2\nkUowDAu6lV00mmW8FxYSJa3VdyCsMtzYgRv1eenIKRZUiOonjAbYQErwPbN6\nc224gIsgYEx/glpeZBuodAv4z1EV1N0JkxluG8C6Ai2yXmCK4txslKBlxoKZ\n4RS1\r\n=u0h0\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCVNwuQ9FkzPpC3DuAVTI0O1J5CRzHKVHLFqDx6SQiyFQIhAKNvELQ+sXql0vFw1KNlhtvj6wNLBuT5fBLXUJeuk2PA"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.184_1611499240343_0.6462770384503533"},"_hasShrinkwrap":false},"0.3.185":{"name":"wgraphbasic","version":"0.3.185","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"20f480ae1d28f424806de3cfd75548bf5d5fd865","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.185","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-HToh0SzN1X5Z+3z0HW1JiLOvLa8zbK3LC+UT6x+xiL8Qn/oKBE3kySugBKEpstDrH5m9rLZWEQcsSAMChuF9fw==","shasum":"3782e38b82904401bdda974da7f3559549c29c01","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.185.tgz","fileCount":10,"unpackedSize":138017,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgDyBpCRA9TVsSAnZWagAAzlYP/jhP5QnIR+JHYYCEw8Tj\nCxbQ7M/Tw4f49Eg+yMbPOr4vFUf8IR79SOSYaMJ75Ocd5wUhwnSsPLjlkLyj\nZ5x/14NNmEg5Fow0YYPZQTpeQexM7Y/4s2kk1Hz0AB7WEy99v1TFwD/wsKZl\n9mUFc56UI8JtbwTwyF1fsQTW0Igq9labKlsitMFx9ooPRQ5SpD+oCNqU3prI\nIuPYreHGx6ii+n/ZL1SfXIXt9v7FUPTJey8JPk7B4bakeRAn7CPrX/2Zw2kU\ngXPOvvRYXhv6wLCFFMLJzbQljUZ204XAw1/nIpW583OBhj9Pn621SyikSwTH\n+P6gmtylhvEECQbc4fs98lTjO5w9VsxDs6eC2nlxEAaT5S/RSxlCPpwv+L/i\n7QuFhWFEaSK8qBdDUQq0eGo7kcsskxClM0S8LjZK+B0sqsr4CvMyhQjOGav0\nrzEEAjABWz8RxtzKLRZH9ZvYmlmD+bzDdfqJcRNyNjV5Z+ZRq2rCJbgHiQs9\njWns8nGVYb3vUyCFsXJhOl1qznK4kGjFU/buu7xft+4usrPsf/WaNEy+djDE\nHIvV7cwMY2bEurfihn1kctp7SZshrnqRAX6H46fm8AnuYTteDLdWFFnvQP1P\n9AlhiQi97B39OFFMyvZy4g0Z7yJHxm2t1iJ00p+tf1PfGWnoiaCrpYDVEovf\nP6zi\r\n=7ka7\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCOZx1JsXwRkrGLhskDj+j0n0I6UuPihjOJYpf/SNmh+gIhAPw0boB4ifWhlgpBKJqVfUG78xQuOTDAc2MggE0VmdR4"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.185_1611604072875_0.18149411365802925"},"_hasShrinkwrap":false},"0.3.186":{"name":"wgraphbasic","version":"0.3.186","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wProto":"alpha","wTools":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"05283a47a7c727eb1b35f1fe74e95264a4bfa1fa","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.186","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-OAR0m6+g3Sg/I/Ep45X2hYhUzSSgWQxKPloak9brWNR9nm+yKjVk2t75ES+KemN/s+ILqNf6/W+ppfSAS8TKLQ==","shasum":"47972d00b8d299a144a3a86b6480c836cb8c10e9","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.186.tgz","fileCount":10,"unpackedSize":138040,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgEHrUCRA9TVsSAnZWagAAcpIP/jWZp+D+Zw724pLxtuT0\nsjkaY6pXZexnXCIgpMI3ePoMkk9ePhvT4tkIWcNaNgkeEPiWn5IxzlXAkJOb\nCvvy6sL3Eo0LTFr/weRtQlsVhIsbkKlQCh7kOLec38bX/pWHKi6Mc0McTAlB\n1anUvTbbJ2D3+srmq2ea4q6TAKvwtL6lWE+6GRTv1TYWgSUFrlqxTHJhZ3Fi\ngwDETZ2DgYuDf/QkhC6z+kKN5y8uwXBQNBtk7at+Mj+gvZYYKEw5o4eDtCMa\n0AQd+aIwubSdSnSYr++1ogr81A1GoXzQzuIBwyJ8PO2byn7mOTJBcCRbm/Un\ndrmkr6zcc7ntIFbrO8fdkYvZFw1QeTenlBCYwGlv7UyFtHHuUToCxElKV4+x\nxJtBoLl2l2NLyE6rK+JZw9hEnburh+317IZhV6XhLbXIZIA42hL/A/cc7BTR\nTsUf9zL6l5S5JTBShC3jAWMZoOkiEPDxzgWr6blK//Wwnks2W2sGg303RlAk\nxfY6YsV2ajEowcOevoYVWb8FOqVc/cDzdNN66/7yXcm1dLRrIsHzx+JixXw4\n/oODxJQhZr6tVH3x7QD4PntaYn4TTf0mCqhGl1jaFVHW13oHUq23RivXBN8f\ngL2rR+oFFA+M7+ySZ2nuIxKQz5pmJ/bkuMH2rAs60hyUHTL7ymcoWH89NHJA\nbWmt\r\n=iUmz\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCGIEfzXC9bwdQTbHZgoreljVOIlVhS/kI+X0rt3DV1PAIhAL44C14iNmhoK6Xmnw6AR/xxxgky2GKy89OSgooK6kZZ"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.186_1611692756054_0.025442874715179586"},"_hasShrinkwrap":false},"0.3.187":{"name":"wgraphbasic","version":"0.3.187","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"02d6e4c8aa6ba2d0cb05450beb8be11ca44a65c6","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.187","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-pfWR4G1LHe6ZoSSLaoykC7hHKWQ9sAvjGvYk8SS9Gkvb+cDBpkkByX75QtGzcHKkXQFYvR4HpaOHfTJ38yCEzw==","shasum":"a2f63cde966fdcff943edb6a731d4362c855601e","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.187.tgz","fileCount":10,"unpackedSize":138066,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgEYexCRA9TVsSAnZWagAA46wP/0ieoxjUzfMw6GyRb2c5\nxOx5eQOC3aT9qEYHGYkBR7c2s9AUP8II3uUUy6Dg7lkqCEy9yX47vztzHfc0\n0VRmPWAhyw7ClkG9MQ4Z8pE9S1bkvRPEAQm5cBlYen0NBEkLn8epAzrdHfEf\nRuzFDCJCQzK/h9WJ4IdDeHwTrqwXlZ1dV/xmPjXdJ/B6LXAqeWQLIa0jnmho\nXl5CeOAnmXetw4nIW4AUpD3gSqJOAPpIL8Ehl/BjQFALKwQ1XxRGE/HM1y9u\nP+ZzTjfWf+NVRes0TCB9b0KrFbkJu36P97pf2WOYGwvouamK8N3u6RQbZGyO\n5jJa6opQrp0uRbrMSDmw27NFlkeQ/DK1qse68wCoZ22bIMUs5di7zojqNu+2\nInNSpDhjUk4EujRNsoW7AukmHLpx2Vdcms4lkL0IBm1ruhHss7yEOPwBkSg1\nQ+BCHHcU4aQ6vfmMtGiuD/6E2QsRCvRi6NSVsomxErwWr4v/HYJidxOtMkoj\nlBjcOLNZCziz12UgnoarFyzXEwd9OnoamFDQ4YwahN1lLoOsfZKMnVz2GMAA\ngJeqZVm8DMnGltfcjAmGArlY41hI1D5Ud3Sy9tS0x1aHk3kag2+DvF2OzqeZ\nb/P7S//nVKvf0XZG2MssBHwe8SqbCk5fHK8QPuSUQTtU2ZqGsy0B03AiQh1O\n8WVb\r\n=qOn8\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEFWwL2/CMPHmonkZgJ6TD0VC6JIuvF3jNIeEpaabynbAiAsqL9Ih98ZrP09r4CvwOrJnl4dBQ1L+6KY6Ar/8534aw=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.187_1611761584922_0.39544446808958145"},"_hasShrinkwrap":false},"0.3.188":{"name":"wgraphbasic","version":"0.3.188","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"f2a66b2fae9982a7d2e9594db873c731e778ceca","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.188","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-i1+dmuKc4oNOD0MAZB5qY4slXfLHOtWHeTRA7a00YmQiKhdLZkjcmc+s6V96JwPahcyvq4YihHWPuCCx5aVP0g==","shasum":"f0331e70323cc579be02777dcc3b2a375bce4e05","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.188.tgz","fileCount":10,"unpackedSize":138066,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgEaHiCRA9TVsSAnZWagAA86IQAJSW0BdsLp1qj18dixtq\njeWqF73C6Dxc/gXZAFztml2mGKeOpWFFmCh0eaJG9an1wGKlN6VzmRoTw0CB\ngr7RrarRrLNCkDHypex7i8a0orOFYXUFfM07MeKSSh0nXu0CpTfCkg/8pfmp\nbnRPjPp2+nMwSc61KmGib5pZHrYtZy+3+/TiddRfWcFr3dTtjeE99e9xhUvs\nl5GecKLoh5oR2egwwO6gyjFST9CbmHD9VK976LhdYMx1oIKSFy2CDc8cMvTr\npxOOZ54zc0jeHuttM4+BHSUpzPsoVjsXKifhnLZLnB7ET+m7/brPnKObTHH/\nr2jucaVt+wpSmMZBMysZCWVMDW6YUPP6Wg2iGbz1HafGtY07Sz2fgP4D90qD\nyo7+z580KLKB31dg60oh1K8AdcGEugn7B9u1P7S2KJOBFVtOmQY3lgXVhWz4\nCzL1KB+6gm2jwIwbXIauP5/vJeM1wNSSJIfWCIJvyU6UdPMg1pIlugxmRw60\nsfcfcpGEb9tqwB/9cQPCcbV7vF8nqkQ0GH+CSUr6DceVLdUwdvQ8lPNY+tx9\nF68MOU3coIk0h27vadpGreSQeKAU+zZ2tUUNG35H0ctOm5rfQOjxCWMBYIEm\ntgB3ADyA6GiKCev0tRZdjs9DBZM4y+qnT0Q+n8RFVuULNqIRFpJo0uX3my2c\n4wri\r\n=+JXS\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIChtFUEjNpWRLAsxavQUzV9diy2+aissn3cICt0qggOOAiEAmYhsJWQekSIS6Quyl/CrMAYf0ZMM21nxgAZ5dDDNN60="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.188_1611768289939_0.6631992785940828"},"_hasShrinkwrap":false},"0.3.189":{"name":"wgraphbasic","version":"0.3.189","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"c6ce6d4669977cc66dcc36980f967c97c7a1d790","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.189","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-F8dj/j2gCYKMiyIw0zNrY+Z2VrmyZPhlQEwHpuEF6oQruBP05qzoS7Iq1Chj2rTYI5bolyrAsUWj5GXyHTa6gA==","shasum":"3fcba69ccc55c5f35ff074728803570e3d6b86f2","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.189.tgz","fileCount":10,"unpackedSize":138066,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgEv3qCRA9TVsSAnZWagAA180QAI9xf6bemYrfDKPZDZtV\ne+iHc7pJTaC+aQAXatDTRnEeeHiOL+rk8XZ0uG5B7AI6P1/GRjYwlGGQBKuj\nojoqnhuW3Lu0MQguYNTqzF3EjOIA+wI3PSHgY8Gm8ih0puMr3qNe4Wq7zLm0\naFHqAnTcnIh2gsG/DgSmlO5RWsTCmiQZ017DNWGKIxqVvl4Ei45HEg6uZa4f\nk57xHAJjsRD6Oc16kNjUSMSTxAepbAGVfvK1U7noTNDbgbNK9YCFBei3t4pY\nGZg6PIw+PuUVoDG5DXU80zqxsFEMCxlwVBrvZqh1HWY8IUhu2ZQsyniSK3Dq\nYIE/ALYJUICBU0DWLF3/A07Qc9eBdV3GHQV0/vYqiR35pVasFxziC7qRkcvC\nLj7mG0co/+xjXhEunPQJOKCkkXrER53+bgnXCgXlgwixKr7r4odEfcclGGjk\nbO44CWJBZxO/3YvRKOZbzvQM86nDz4rxfLSrw+3NUmc1L0mcCmD8QKEFOWof\n3eAFEjgfvsOOsAJB/oVlygmL3oSTNbVp3F6/uMwc6V76UhQBgmvWJp4IE/wF\nHEjQJ6vQlf8eD7G6ScUiQ0H4JMdckbXTkO5k87Dw9qhKkyeUm0g9x2GiwfT+\n2eP30dMLOtfKqD8R8jrai/J9hI+z92sBsBZWNe/FEyfKSfC2eGgD1yy86Qot\nnUje\r\n=GIfv\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBiPi11cYLPoEp23xa0Zq1My0ei/kD6BGx3R/eWY/XOKAiBL2xvpjlL4r1QE5uJ6AWcO1L2a1qx/co+X11laxLFcKQ=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.189_1611857385855_0.5733348828297777"},"_hasShrinkwrap":false},"0.3.190":{"name":"wgraphbasic","version":"0.3.190","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"b441734eca30ac17c8bb6e6b7f9db0b69e2afff6","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.190","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-KMWQrB0OmJhPAk+4bibz+jCkULb7SzebVfrrsS4GGpIJg449Wihx3e84M2MBCjytvlznGSbFo4jtovWDQZ0JZA==","shasum":"364011a2bb8962ebf473cdfdd01d3a659a6f64a5","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.190.tgz","fileCount":10,"unpackedSize":138066,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgE6oKCRA9TVsSAnZWagAALswP+wfpFBNUHvcNAOD4u9us\n8Z/HB8Je96+ZYXa2pGXENEVVV1vNt+eZydJRU3GdnGuSMesrHVblbnwg4Ibe\nxewr2wlRCvSOo2Wl+S1eW3IU+WwxyL0pD5613ThlWrK3OWgbFBDrP/+qhK3K\nVI2ZVBsXRWoGXE5UoRHFUbfjIh8hRMUzGGCAN0aE2U4PNOXC/nGfJzTCOlNz\n/1/u/tqQ/dDhMxI9Bumtl8BPrxv+2JqttTucT99uNY1yplC62sk2aiwJbGsX\nq3W0UynCegDq3YqZdF+7q7DVQvdA6HR5xJ5TQa6mbYkZGoHno4wk0OMadQJo\nTeQuAfwxYNsBR8KwVhN0ZZNS0CvMSi6MjmTggF+oY6awD++2IvBX5kQEtYUC\nNXeh9ZJHWXfKAJpOVqA8y5M82kjKdHzZ7MguuPMU/isM53WjH437xFAl9RNW\nT6mjDvJHNDRjD0BZOImPuA0niS9Irc6IbAfjs7IoYbu/4k0SLcq8CLeAXpjb\nW7PZRXywf7kpvxSa8UvwlL5Me5bv3FHIORPXnWdr14QAuw5Czs4eSSkOjyh2\nIcy39r63reGjPBl7yWkQtssChGzHfzfG2boCDSjjdMa7yEX/vK59hQLm+QZA\n52h4w85mqwA9AJ+4FjIh4vNTMpoRS2iwxfqB1NAxeFBa67CSaBquPSWAAeH+\nRTQT\r\n=yr7y\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDzJJk1N5NDC+LWvFqqXabdrl+vm9E+ddGNwzgSH5pmqQIhAOXnSFR+NQ9QFvOjYA7AuGBGS/u73k8Gjh/4IWean7KD"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.190_1611901449845_0.7227937019408557"},"_hasShrinkwrap":false},"0.3.191":{"name":"wgraphbasic","version":"0.3.191","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"2639a7965deedca7f77c4f94bb064e8379af60b6","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.191","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-V4mTk3c2Es3+yI4LR3vUxwIXml5vpvhiVz0FwFT2ygDsvXcvaGq1vQCdQCz8g/J075C9Nq9bKDyT34j7O3F3fg==","shasum":"e9114214b556ebec22af81e0cc4364424a587b94","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.191.tgz","fileCount":10,"unpackedSize":138066,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgFC2nCRA9TVsSAnZWagAAxkkQAIF3LWSuVw+W3ktNbUuO\nw7WokTzlo04Gyq5EVbVTmk+rHXaE9kMS7xi0ZmXRvmIAeso+bM2UtCTRbnTI\nsrHGrIsJYoSMuqrwsRNXoxg7SLB61LQSEme5Dd87SHtjFK00l+ToAV/RFhSP\nnMx/73f+DP74WLQKQb7GktCJCUynIdSJCaI+79Ic8Dhd84G7H0aebO9fuICC\nfAN3ecn515RDJlg11S9moxftYBO8qVbOmzmp4N26UVI7V5jY54m0wYqaa7EY\ncufEnrEUw9tIAShWPF/Tw1ojVfOMmy4eV+5iByEQlFTmD/gjF7fLv3DBg3kM\nG/Z5VBHmUzGwpyv6xA3KaB70tN3CctwTUzMO9kM0fSgR+USe85ejkYOE3YH+\nFa1nSMUa6JRAO16ZBQ73Jx84NMTJZpbI0leVwC/XJP+z2u1YLE9H77khrOOI\n5GCKSXDYhFipn1B+4jeq+Sfn4sVowcYyC1LzTCXIMxnyc5CCH8pBpwB2XDv0\ncmwfeKBB6+3DRpYtxA0rNs/8VbXYnOlGHJ7NM3Vahm4U2uZ850xgfnYfKBjj\nIG1D5rLMcM9irKuxumPvPNu4DNksZwOKKebyfUN8ch7dGRO8AGtwFGwY+TbW\neYk8Bh4Rj3iM5MkaXJV+aHQTch2xZ/ciuZbj6TipUi4RlyfA7zYX9fXL5yeh\nfEyy\r\n=C1A4\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIDYYDb2P0gLguMjRDjjgDIOYwKDJ9+v7wAxBalaqnoivAiEA/FbyTqbWwRVkDDQ3HuXDRXwLAgL5QSdBMcgx11LmsHY="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.191_1611935143008_0.7838074453102561"},"_hasShrinkwrap":false},"0.3.193":{"name":"wgraphbasic","version":"0.3.193","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"7330d25213c7f6c039e52c18d80b8906daac6c51","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.193","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-vkS/lVaZ9Q2qf/laeI9/qAyWm/dThzSUQG5xGGAe/RBuTegGkxiF2p0ct1zn2Vix/5KZCWc3lcbkF08unSz25g==","shasum":"add37afb41d7a972cb417241f15e6ef2a232eefb","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.193.tgz","fileCount":10,"unpackedSize":138066,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgFGo+CRA9TVsSAnZWagAAUhQP/01jbA5WGT0nLW6t5Koj\nKVXhLBda4VL13l75QIHuN4g82BAAr52b1ThCBqDHi18335pRtfByvzL3LJpA\noQLYOTpXuSOqZqHQHU1TrgnCOYWsvYyaD2QYuWOFFomlbGZA6p5oRwPT4jFH\nDmltTZPjYAz/m+ZyATHK6LncvI90jlxIoRof3GGc3YXrlfrImFxeCOgC+BtZ\nWpe9j/Dq69eqwn1Zr1IZkz9A1wirQZJkr2Q/FBZH+m/Zr+G4kuPAO/VHEpVj\nQpJY+lN4kD3Q4cntFfN8ZZpkllraXWwkJAXhyTJAP7pf2LNj3d/Dg47IR0KT\n3W6lPDAqWPU4ck2kiV+cPvbglYM8jIVRITtpB02hb5JL1ZKT1sFTrUS84TzO\na8ZNMCakI5ZNirWpxNxIVgL5uEG4xmuyTjjF/XQI+GVlgRx7Z5QCMLM/5wyz\nlRycNZdnW9/o9ItqhVn11DFKQMwHZBYNT1YYszqrPkFq1phQGfpqomKnau0f\naXypTtv/oHKHjF5lgMVa4Nd2k6NSriZmYBXUJvaYP2qodYrUpJJQley2I+0B\nhQxHI1btMcKnKerjvqoGidhvm1mYFzhw6vQG1pc7QCWkAJwg0q68AKB4ociL\nlzT+yb8sEimfBuLqaTLrp6yh48RLVCBPnCy5ZZSCPipLK+j2KzNeynOM6tGA\nD4/p\r\n=jsW7\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICbbK7pw1RM7ZNTGLelLwkx1JRceLxF5HiFoNAwC+9gRAiB9++undXt0rafx1PErSCQ6kkdsWKHOr+Wcjsg9LEvzbw=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.193_1611950654123_0.21087155548902103"},"_hasShrinkwrap":false},"0.3.194":{"name":"wgraphbasic","version":"0.3.194","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"88c249de1a6911487a9e152ea27811b03107d156","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.194","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-3nKPZ6slS4l2M/hyiL+EkWLIA2MzTOrNwkyz1BXVoDOARo4cA9Wk4CJskHOZ5kKGamllHSM9mmBVahpjPLfKUQ==","shasum":"fcdcc2295c776e6304afca67b5a845b4858a5ffc","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.194.tgz","fileCount":10,"unpackedSize":138066,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgGQyyCRA9TVsSAnZWagAAq3EP/AiF44NCq9kqtytfgqJ8\nFu2t2n2JpUFR+JLprb9nZShcDWVEXNJLsFc69Z0kTtdXWzUd0vz36e93BcIa\nJJlzi8VPv7oo3feyJCcRr6rb1UcuagQx+YwH1NC3Qxr7dTJum/SMnS+6w561\nBNcZIiiF+gT2re956XAoVv6m9wOD6HwV4gaU3z9uR4OHOS2Om1b3fp4HWzcw\nrjxcyjYPiFZCTcfHWecnOk+UiJxdCFTQHTGCJQ27U6nh8arhbabfjz1VNa5b\n/eMvKjXZs9hulhtV1RH47fAiLVu1f3SjtZPZjae7XEe4DRbfo4hBp9swcCoJ\nGGyG6vJbi1eg5luuIL5PPbr2GYNqT7nQHNehLk2KjoPWOvuh3oV1ZRAAnNpc\n0MDlyukS0a3aCrY7ZeQV3AkzZfFVkp4vdfS2Bjbf99jSqVpWzc8Uo/MVEyMV\nkyTK00BcLqI08Aj1RSfEDLmef/mSSMHGqB1C5DXryssZSbfw7QyRFpL3hjpp\n8CBjh/1coPxy2R6u6Uy1lzn6tQxfJJPw/83eRBeatxUMCEMP1JvvItQrmYzp\nbSLY0rEZgEB77MU3XPKxdgq+fjHKdc08MKFMG2YUUsEMMuV6Hk/oSe2GxsBT\nHIrqFMkZQqTMFkAgq50Po/s6eE/QHIs8i5u+RzmKp541133ChDSVqkVuMNBa\nhhtN\r\n=XV9E\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEOJwE17tQFKVkJSlYBpDPXfNwG14t2dXEWMXUaVHfHPAiEAqN3V5E+Me7vYH+N0TEJJj8H6ES5SU9UkYwAgpeEO2k4="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.194_1612254385563_0.024454248411066803"},"_hasShrinkwrap":false},"0.3.195":{"name":"wgraphbasic","version":"0.3.195","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"4cc4eb92fc84cf6af7e9489bfe8ad179be927719","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.195","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-ZiJyCOD6HPLRQT+VNkQuupWmuuHnUErbS8zbWPuGAx4KBagWe9r0Ou9ea5EEDlUIi7Z4VmA3NKfQgHthn20jfA==","shasum":"97cd64940e813eb94ea8832c53f1562a9c0dff92","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.195.tgz","fileCount":10,"unpackedSize":138066,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgHG7LCRA9TVsSAnZWagAASpoP/ix68s1T3+/hX6wag8zo\nK6DA+PfrfaC1w0455QGVJ3X02PpJs0D9ljO9g/FeJsIN9OK8DWgOJeWeTwEu\ngjXXXSFOe0qleFCCcajqKHbFjg2rpMojH4vifKuNqh7mL9DlV4X2Mh7uQiNH\ne1aTPTfSipRxK2nf0OwUPF9sh0KGwj4wi0aWcOAJvDXs1Omi1M4+6GsumRps\nfgIlb6bGh5IFdtVi98diHIoS+iO0YUttpvKln0j2oFHk/IOtPb5IgJsyJCeF\nQe++waIxqoY4f304+ccbIXX/i1kK7TK8tLSSmrKDCOAK9osUBqmYsBb8RQVp\n+Z+Uppnqh81MCEMlfcraffoZK4pjHOaPW/G/G+NciIEY1u8rpEsNOceZll0C\n+3IPVLK9InbxSX75udiO7wymqQNS6MdJh7hefXVXhlX/ZZfxmcWcpqc9I/tL\ncy6b5QHwHlHAaoiDUvwqex38tOLNrS2KdrJ/2Xx9OhLr6XltzcHhbNTloWqE\n0d8gqt4ScqZxW8zH+heZvrcEDKDPzAKKRFNe7Agzz6y1mxDo2AerYT+5b8Q5\nq8olX5ZolzckJ8wNsU4vOZmo06atRc4Q2+BPSzqEWsDT25QBwBXo2oI5kvmg\nESbSjOoVyuHqPsAOz6GC/Bheo1Ry0vLrXeZnmoVBhGjJFpGceuN84eJmE/U4\nQBQS\r\n=zYJr\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIB+8Sklw4yV5czY1xFFgd3+LN3zU6GMDSJFZfR/KNpcRAiAtVkn320zokqfexwKCBxlkDIXknM1CI/p+uoqTOlXgyQ=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.195_1612476107448_0.9215383155442205"},"_hasShrinkwrap":false},"0.3.196":{"name":"wgraphbasic","version":"0.3.196","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"70c3f7079937f4b52cbbf96216fa4b19a2a47695","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.196","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-isyzGSjQbB9/BYWXd8E6KQvcIUYFgU0+D33jB9iVo59fSKOgDOutavjV7skWuFp71lN8VOHRBJpRc4CSf9qs4A==","shasum":"7668af1992849a410ac3db2cd526f1b6809986e1","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.196.tgz","fileCount":10,"unpackedSize":138067,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgIi8zCRA9TVsSAnZWagAAyjkP/3Cul63caPfqze2YaWs3\nrGy/THt9HQWk7daz/p7RGXQ23BolR8uc55ERa6T6a+cxFYBM4FaEHJpiwHEJ\nbdaEGHgyhqb6aWWIZGoiNq9X8QGqWSFUluXu6SxJx/twJlFskxXpd2SOppIF\nUHYOceKBW8Ia61paJofjfxu/oEnQMyQMeHyYI9fYoNOrpDgVeRY+qFJ5z2Jl\nujLdxUdgdEfjZqUDMXZJXuDlbkJr/9wfCdIGybfGaLb4wMB8Xsvg1WEEdASo\nS0fWcCDPflTxzyvIRKpBszmO5ibd1l+hUjMQE0FHhhdF7eiWvzxxeJdafJlD\nGrevAaN4Lbgi7CG60xc24OyX6vtf9a8co0yy4ksGOQMvXDGhJ+T7eo2LeWrc\nZ6LA/MDkInISDBwNPLcOk8Et3YGZPhCTw+uHA+1/5hCnc5uTTggQ4sTDrvDV\n9upPCS8y33VEH2a7pkYQK/enx6sHoMKkHm6qfZ9sy7sbkAEx6MsauHUsqsf4\nlHIOxKLxethBK6EYu7OhJcAQtHLaDXkqTdGwmZ4HtF/fsNkAlDeJ57J/rGnr\n5B3Nm0YdlDG1pIHaD1+0r3eZy1pchtZ+YQUW2fFHDY23gffNHNlA7rJELEa0\nEldjTBVpROmcDVmU8EPArp3480RkqKeu9PsoYfbu+jFUF7VnHpnXmA5NmdzT\nWiUy\r\n=TvV6\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDGGIUmFaJDSClA/9e12zMxjTdgPah8kTf4/OigNmRT5wIhAJK9NUOgznH411Ht2bP3cCOYPJ07cAdDmYlUZItjO06j"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.196_1612853042912_0.17442422054212048"},"_hasShrinkwrap":false},"0.3.197":{"name":"wgraphbasic","version":"0.3.197","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"e0890b3534ef5431651e12251dace742a55050fe","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.197","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-zvhizOF1HgoExtklk4P7suGuxtMaI3mvn+EHmyAYFUUaLsxFbzBY2AmBAPWloeYTCAh1NSjwU65YNhcr33zRgg==","shasum":"1eeb0abb49fe36d484d688cd980d6708baab1877","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.197.tgz","fileCount":10,"unpackedSize":138066,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgKYURCRA9TVsSAnZWagAANhEP/2/m5QWqMjVRE8pr/vk4\n7bCY144FUuCH6+GQLEM9/2lxobUnTo2IH/WcG8quJvGtvENqZom0o6FeI+Ao\nBxXh6VddYlFWKrl3SWht2hlcrM0y+1q5KSVEHwfKq6lk7R0ne+lPkeCKDHOA\nqtjzZPxxGmWofS7DoGoCM01bn1zeViCpe5KgfhXt57UYwsDbR7wEY9u6NQLS\nH1vLum95/4AfwXXGJAoH11B10BSC1/QxxNknv5Tqt3lWEtWCZxp3oPKyW2q5\ng5I/M0bpQvbnjCDBdpt15sm3YSRSqbxBe0/y/9awodUgmGnNStkZPnPwDGyy\nRI3EW5XUysRgvIVAOZ1iDMUrwhO/++zZOoQ1SDVS8p85rRUmXgBAC7XIQqCu\nS0RlAb8Ewsb7rLmy8VnT56EAJpHlY00cBz6d/Itjoc/MfttLd8XORg5TH959\nS/inED7wJmHZU0jmwwyn1lI4FEBIMiFqPt8YyyYh2cj1NRv64+aWDuDSr81z\nME09WckyRlnEkko58LRvl6X6dzOOmbxalxCtdqzEUzD04Xda7dE6GLj1EkWm\nyAhga5KhAc6zh8vzOqRhwhBJhrKA8s5wpEmZocGYHPRU6i4E+iNm/xiZjPky\n86E3V9MGAr2aamDZAsgN4uCoiG8z6a8O7/2udJfsP6RpdApzmAbiAQ0Xugak\nVhy5\r\n=f2lE\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDOu4EznDZzzLsQR76fY/OLbm/UAZodNkmWD35SYe7MfgIgEPIcp68FlVuq783Wwy4tFwHNEq+jxaYlngMtxE3ToyY="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.197_1613333776911_0.038905032664330985"},"_hasShrinkwrap":false},"0.3.198":{"name":"wgraphbasic","version":"0.3.198","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"8f0e5a1a34700ed2e4af6e65e46a4262e5f1c711","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.198","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-cN0umHsB07qdr4e7xzZehw1nKbl5C4xU4bY8BfD9U4jAPNIcj6MhAbkNIjhNpHWptDEGbnGDK8MuDLAQNFn4DQ==","shasum":"9e917939b2413f9587f8be4a207532fe85982421","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.198.tgz","fileCount":10,"unpackedSize":138066,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgKrVwCRA9TVsSAnZWagAA2qgQAITQOZse8DT7b8eCn2w0\nxd2V784f7TyVPZWfjlXf9xA4DkUiHcwh+UIkkOTzyHHc0R15OWpdydWK3wrF\nOQkTSR3ive52MQ+ElZhc/fenN64zJcAemQTlY5R/pVAMhs0um7Gc+p3nyTlp\nMgQVX8mNAaBlI3WpIDsz51jqoFcRvnoK4aoQpgT4AfnURYkZm9SAK001LQ4s\nis3aC/Nc/OxGJbHvnpscDedaBsf8tjQnDsLoQQxfGp7lSfJHo4QjEGGGMLQ2\neVb1oad784kZjVpYx1VevVIKcnutPYEY7uNyTh2FCL9OaLqaHgnby0Ha99Z8\ncDBFqz7Aj7CinZcTBON/2yuzwetzs6X1ahUBptzl0iLswWRdanI0txbE9qfS\nLbKLTDizPUTkctDApm/2jPZC4L/FP0uivgnY4Eu9d2JSMu/6ILZS2bBfXDYx\n2d+nhjhE/IzB9IwmVnInMXDWLE5vMksAoBtyoiroyKBExJfkAT0yj+DRmAQQ\nh+64vhKO+neA2Tm854lj33SB87Szi51FZXGdar8+i3CecVPu6FDOZ0yXe/pM\noGJUgkeozb+rviMDqrv3KU2A3FiWV6KogmwVlqufz+7qLG+U4+dHUyVLEVnW\nj7IgBwU3DQ+EN7UdB+zy+ur2b3DgIs3YNluL960jqFokO4lG/Qn0OIRD+kX4\nZluW\r\n=NSwk\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICCvHDoCazSY9IYefdVuCqZwaRtHApSLxG24YrvDg+kIAiEAucnZtL3LSDz0xxioKZAksH5y4nDVSWhrAd+GHUkDXKk="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.198_1613411696367_0.566451019538533"},"_hasShrinkwrap":false},"0.3.199":{"name":"wgraphbasic","version":"0.3.199","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"6ae23e49f262a70dea6d6ad6b5a4dce191f7ec0c","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.199","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-M8u+xu6My57EKTioJGgrwW/LIh/oujMaVZyXM6xNxdGFU4Zh9mID1zUYOhelCd3uKYTUJ78yuXDDD4AfK9lJFg==","shasum":"738cd464c38df781e3537499851bdb4c4e14f95f","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.199.tgz","fileCount":10,"unpackedSize":138071,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgLN48CRA9TVsSAnZWagAADKUP/2LAlwJ0S+zeJIqBkOt7\nOwwDaYww6aCVQC/rym8YRaIa616X/ztH1tfDTs6XdnIt1j4v4xsyDX5xVE9O\nW0CPLddFWynKaooEMaCVaPiFNqM5AEbSqZcuFjLyWH0OyAHmqELG3ryLXB7E\n+zjNkAtMTVAnzxdch9JnkvnQ7G4oSNRwBp2tXbNZAB34xpuTALxjH1whgZA9\ngOhPGTo+13EcFAXv86WBbTzJTP9SNUZxT1O5NCVInDNSWy9tH9XaghIUtPVA\ndU+MNzFJxkGpDj9c7JjnZkc5Wfz91Z20pB52HlWirkrvdRqm7zW6EEyNN+r5\nDvsoowOZqw272qgnT50/5vZdWyIKseWFoCxS/xRhGaeIfUtOBJHPtBFJd7v9\nZsdjj3fGPkMES4AG1XAMR5kxuZJGW2QGlrTbEqyf2Tk3yiwPuw6RJuxBK5Gi\nX+SWNIPjBGj7RJx/TsG9xYq0GvlhE8+LKYmuWDoxBZxQ7dwTPY0ahulDWir3\nT23mJfnU3v/nCCSzhWSR5qhrnp6wMYvjgMEq10OTZx3gxIaYwmArk7xjEqC4\nvp3UWam+8Smp7fBn0G0Tej5U5HVvQ3WbJPsSzIpzIbQUp8LWdpUv0NxTce+o\ncdqUlxTMojaXcnHcZkq4erPrOCOPvArsSM5hn0JHjG1QKCNoF5bdQF9bJlad\n44fO\r\n=ev+n\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGTSyWEMlrbId8s5NrKiLLv5q2O+jPsBcYBR5Jln/9RsAiBnppGr06+ICIt7m5xlQh/4HTrqJg39mgPizrXHz6GW9w=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.199_1613553211624_0.595488760086077"},"_hasShrinkwrap":false},"0.3.200":{"name":"wgraphbasic","version":"0.3.200","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"e7add38eb896fbe2aafb0d81fd5a2f6c778338c2","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.200","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-0+AMXJph3WChQU1ENcmsAi6cLE25qd/cLWRPod9lWhcgsLwf51+qfNlmzMCbUli2eKyUU9M1G7FCR+6HeiKFSw==","shasum":"4df8852873d189d2d2f3c58dabb3530658d1f733","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.200.tgz","fileCount":10,"unpackedSize":138071,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgLXBlCRA9TVsSAnZWagAAO+cP/j6r7m8D3ipeQ32WHpPx\nByZMIV4Mhloe4mOJ7dyhAj0huX5+UEPukCDpcuYoGh/pDiuaPI0S/PHss0lu\nesimX13R9A8pY+UFokMLpf+YT1CCYvJ8Fs6GAvWESeNoVPIkisRS1W2GrYDx\nLhDmXemrbVwagpWwVXoiVtqHwRBkxLHwkUVH3BWu9+TZoa3JPke06zzR4RfC\np+U6Iy+PyZZp7mNnczo3u0JnnJKzWsXUEKa5VqrnTElWXkyFP6jxKCgDpzsh\nzKZn3WQvCMKZ4lnVvoPrgTLKSlJvXuP8dvGftTZpljOkwMg8+zXym8VQLMfT\nuvJmmEY8nSy+ry/bhZQByHSLYIgMUcTQUvcTAFhzNC1/FHym6gMnzh8uRezN\n8doBfRi7Gp9+A61SkNc1d/f1IYEH2j1ML2rpYHB0Haf0xxtzR44lgrhF/15Z\nt/bJetjrRcGNMZ7NhI/GSH0hPNA53mVnfctiwl0MXCEozy0wv/R2Tu5PErf7\nukZlSbFcpiMqGD4wpdPNtzLlEc5g1t1iRj13pjXugic71V5zt240BPRgo3fh\nJTiNfeGOuUON1PFySs1qFMSPt+iRuSyal411rWbTUMilLyT/O4VtMm2N3UII\nqFyqXOvPHr4Ha7t1pCgxxuIT104s3WPOynv+Y83dbrJuMlJVyCZqqGGVMc9n\nl+QV\r\n=khE1\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIFa6B82W2wgFHPFJ76AMvJxMOnNzvJdq2gdFUv3PXO32AiEA2Iaoihi2M/xU2vvhI0jCv7EQPKFTwivgqWBWsOzvH7c="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.200_1613590629121_0.8578620828607353"},"_hasShrinkwrap":false},"0.3.201":{"name":"wgraphbasic","version":"0.3.201","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"8a08839c2dde6edfaf710dbc41e06bdc6f1b4b8d","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.201","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-lXIjqw3lwQSvlJwKFTdTXTw/JtB08REsCxJlSDsjH8nJSmPA6Bqi5g6zmhDy4kED/iHzhB9FrSlHjNWPD2HRLQ==","shasum":"afbbdfaa53b846f7ebe85277d9e97fc65154f374","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.201.tgz","fileCount":10,"unpackedSize":138071,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgLqs3CRA9TVsSAnZWagAA8gwQAJjClG5ns9KX+BKweaKy\nMfnzIFh6gYkNY9pHfCbOyO/3wERje3m5032eyDO3VOgFXwudpZFON8P+d7sK\nQg0WtrPvosglNXtxHfALMtciUfy6ecmpCWaFdb0/st0kC3Jh5D2iGjJnXHf4\nCKcOPgQxKrC2RrHVFPKqYOwCdx79W1sFi6FhhvBMyy/+83dASuGjdPOArJ5p\nJriCs7eGJ+FihHeo3rwrFxaafAnGNQnhtx9hnsvHbafvMZyahMfQSkPgce0H\nTFuH5Ddkwyzd0gGC6sSjSAyhi+Onep+1lZjYyYpMCGWv26kqsezkGKYvMfgE\nymTuGT8D2la7iTvOYswczHbQXTVZIFywGviOveROr8WEwg86/conAdLTBL+7\n+MalHZqR6GQHl+QjN5twsGp1hS7OZl6sNPAn4ZUtZOyDvQYm9h0W+QNeTfY3\n0NJRRwNDI55C8nYUdZePBtofRgszSRAkpyqp1ZXCQd4k9r2cPo2taeaYTvws\nktqOITERJIlIoxHo+TkXrQ3UgQNOPIv6waCz5MX6dWDZnTJ3GckkduJ7gZqk\nupzdNOLzLcT8R6YIdpsTtf9m++XwAWjG9kLGyO0zo2VeqsXrrdvKnoZ8qxPi\n//uJ1f2JtY3GzebSHzqkQSMxkZA50hZfNXO5t7Tf+9heUawoC7qIHnxKnaO6\nhWQI\r\n=Qqan\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIAGfa+7g8pNJgfVz9zUuf+BV4fVr71S3SfSj9/1LzqnSAiEAtusPk7hbb99GFiWI+3YH3OyLk+cddJdUfvS1MRLW2J8="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.201_1613671223047_0.8510387020671131"},"_hasShrinkwrap":false},"0.3.202":{"name":"wgraphbasic","version":"0.3.202","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"0db28b4835a49d135b142a873c19a1f599f1a190","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.202","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-bMfOxNVMe0eK6mxcZhYxOOCy02hwNDpl8vxJYIMsBJkMBUbbDsjsyQ4nk3MObTkUq6Xxm3dAud41R1i1uk946Q==","shasum":"5ed39268585f368a192e2884b0c1f72092025094","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.202.tgz","fileCount":10,"unpackedSize":138071,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgMF9cCRA9TVsSAnZWagAAlB0P/2BxkQowqMeQrVsmm3Ge\nTDZfIV7dNu0R7V18ggtoNo2ojwL3ogw8EUW3fSjyWgN3X2kxvPLoJ3EEw1O2\n0XzOkGHZuY1coIP7Ch6Nm9mR3aiEi/OEGjpEEXZ2reRX0RVsqf98juPTQDeI\n7iMlFxrronQIjywIETAaTLG03uVoKX9rLsUdhe4CVZqUje4Rfj//gx2cc/kQ\nis1INzJf7Wx5+WwcjFSOU3G+piMYlnoK8AQVUmZ3hTbEEjQphHziCXW1yNGf\n5D8JDxoYYUkaBhK0mdAXk/4SxUdzaqAOmGrPu5f+htEjOJ8WS+YRAlk5Lrws\n9oY6xkdKwNPvJHIrXNp0kHkDbKQn5mIh2/zu9KVDw/j1xY2LV46yEvj1Pof/\n2vAUWte0Rf7F/m1oqeAm8a/IyycQ/oSS5uN/KFpBNUnBhbFGsWeenctEdzM1\nsEfWZvlusVKXbnC5yuO9GDOBpjfpmqcbcDfMdDQHoWXb+wI6jCqJ0N5e8l5K\nxlr6eeKCF7reETDvaUD16YTSoOc6ZCqBI0YszNlSuzeJsxcNQhge3F/wuKD7\nVKniAPjwd2N36YChNq4nHuSoY3oA5eKyDR2xGK28KxnCnAEcVDJrhxdaLNea\nUER69T4fvJEG23fgS0ZG945uLQwXgW9vUZTYpvvK5LjLFSC+jSQfEQH6f0zb\n2L2V\r\n=9vPD\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBzGgW2ZZ5T/+xfM9foM/LGHiQa7FEeDH0c0vgs02bdpAiBxFbcB3bz+PpJuK68vVYFc8EDg3ZBSNg4Pkxhb1loD3A=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.202_1613782876335_0.690321325823759"},"_hasShrinkwrap":false},"0.3.203":{"name":"wgraphbasic","version":"0.3.203","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"89ac79543c1b53e4367b0e94937f12b0e0d53bf5","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.203","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-h4FKKf+qnMJRU+cOJ0QTr8OTNe/nV3mQybfI6Dz/JF2iqpE94yKfM707TckSwV51r6g9/e9D+GkkJlDm6ZQZSQ==","shasum":"99df9991576cef4fe911c0058564739b2e710196","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.203.tgz","fileCount":10,"unpackedSize":138065,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgM74pCRA9TVsSAnZWagAAvmwQAJaMxYkuRq8pJbC0NB4B\nFSG4OuIr3BIdCu+npPibiIyBrhUuPR4DQP5hLTweWOQ5fpTj7D0akU4TPdLH\nJ04sxRUjxJsABPnIE+d9ZtOdwDnNepq9VOimURKepmhG676AsGddpr48v9Ad\nmEMvTslbMjJW9MmT1tTdKHFtXA6wUTQyS7H4506KD83pXALQzYJshuc3WegD\nOWTFX462zfFyjS+PSYxPHOI9fKNsG7/0u8NaFx4BGJPoLkyAt2bT5NQumU0z\nbpBr+ajYRWmWAq3AWuJGSyBxkbnNE9DzjdN/7wtAZz5rgfrYX7MDkZeh0a0R\nFs1U6XAGL4PFQ169RWVcPmDKsFKjVU2VR9h6wi7hClIqUDKa95Y+VRCU1768\nf7tjz61OorjqYpph3L9X7jLc4+okkdw2nia7iotUf0xn9S6Zj6ch/AsmFxpa\nESEoE6zi0ANF42L11qqQvvhBE9zjHBz6072G7aTHGG2NWsjaTdSlTnyvDHvO\nHnn76G69eX8UFYeWQDOghtim5Kjk65MrO40eisyinAtypLY4+0lfRb88EUzg\nW+OEmFnaTuJKRjIP+VJ5zdBa9r72l75HyhmzpS4yfkRG7ZxiXFTHhsXBXoz9\niKH7LcagaWEnIHayRFiav3lYunJzSikS5YIAJdgssHGoPtcMd8LIFR7eldgp\nSp+n\r\n=AIiX\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQD8O50+MT/w7dxt67kd7aeQrppbi87VBWZfJKnpeYuIrgIgA+5Re//pZLCp1RduMRdHtc3fxoAiWxfLJs2wX1/kj4I="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.203_1614003753381_0.5445721189433887"},"_hasShrinkwrap":false},"0.3.204":{"name":"wgraphbasic","version":"0.3.204","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"b030fae4823655c2426ade95cd2f62e52ffad318","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.204","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-EZq1k1XvD0TKhYyPEn5tGtHJjbvKo2kvzWQij9vNJJVmB6XVobgfiMmyHnQ1DJbGwQlLXU/iRlzWh1kcZUVx/g==","shasum":"cf19885a25a5785bb309757b86657ce74e6d9505","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.204.tgz","fileCount":10,"unpackedSize":138093,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgM+KuCRA9TVsSAnZWagAAjRUP/iGyKPzdzh+0TQzz/tGn\nk5zSO5UCRahyQ8YfW4tgfVovqfWveYkxIF6KbHmYWzIjKNWSTrbqw9fkVKff\nWtjRvZV38So21K0QbT3KbGDxB5nIpttS04Uc6XwwFr8qJ3fAiwEZlP70jmy8\nGmGF/KzMdSTAP9Y+R5Kk5F5+ujeDEAHl7G/0dVCRFT+vY58ZUdyXW+4nX369\nX3mD7FBQPUBE+YiKmf38+L0g5266kwjPHtoQcfOtRyA9F1xk9Fs9GSFvl2fU\neZxpr0zpO9QvF1EcrrX8I6Fz5K8NmlNsApFMIDbL/am+FNnb1XvQD33u3QuF\nN+M0vkkCGjGtqd/gFVB4ZAlNbnr5Sfum5h3sHy2+ZC8fZfi/h4c5hgxfjkgm\nE6VgqywyQ4lQ0AgFAJevcYGm/ZzaQQhj7IXtDEASDX0/m63pGPuw0hMIQixA\ntLHyNrGtGQphieKOoRc+dueSOFnGbTkHTLFsm2AMn9DPmn6VVxaZ/sJIQIqC\n+6AejiY/6nMrDVeQda8T3z2aH8bezY+UgBaCsVNCG6XLC+zlQI0/N/VqwZqQ\n3vxUA3GfWf5s6eeg8gw1npOMiUYrryYdQ9WkGmmljSwnPfjehY1pjh88el2w\nBVkkYCLaC1DvZK/MZp6G5fxjkaswlirkI1X1bun1CiKeMhrvtlV0iJ6GXQe6\nhz9N\r\n=70ZV\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQC/OO8HNm+N9xDjP8hYdq8umup3FBW74nWaMEKPIeC2wAIhAKe/HOfBQ7Qfl3R8lhfbqUYlDjODf6+rj//A84z5+ysA"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.204_1614013101829_0.1653874229806782"},"_hasShrinkwrap":false},"0.3.205":{"name":"wgraphbasic","version":"0.3.205","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"f691a979b48b9f28219db91bd99aaabdbf314600","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.205","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-LZC2UasGFMBrOVDdCuCfjM+OxaxKGxKV8QRIglYWM8c20Fxt9dA654fgI1zjfgmYMfSPnYrB1dMOWAtckGiw2Q==","shasum":"1d95c8f4eab631859b325403758165646f68e436","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.205.tgz","fileCount":10,"unpackedSize":138089,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgNA3xCRA9TVsSAnZWagAAGWIP/2/48Lv3r5VG4hObFxPo\nTUkzqESNkO69aih/EpZhzUHmjneC6R/Loxg7M3Xq/hO8u3DXNtqgSFTmVpzW\n9W02nWCsdw2BR98spE6NzpC5hk+7Wy0ccXbreLnr6w4QCPVlNdu+xKYeu/4j\nmsxC0p8ITdIDjWxBmbYAvq62Z16fPlDHjGCRNVbdZkRBhj6UUrsAVgNOU7p2\nyRhovblJxNeiAwYvvOLa1PCfiqQHppZejJ3sN24bLNgLDsWEfX8Os97+CbtJ\nCCQ4ghijzVeInfg0s4UbMugbnr2SX0iqEr4QLpR9iI5m4u150GX5p27XLwY1\n2fbr/7luIifbST4FALOdtahrX7ceWm9edLDrn/a6ph61XFDQFZCkQq2TCh7v\nPmqOUg2sgnCjlaj57ijReo9kto76jGt2FIeYwmFWCIebBecBVGnFQULsxjhU\nuksf8kXBkQ1o8QKyNjD+ad3CPkYoRFcUs+IXuCZH/qruc3VdfQ4xeuBL7Uvd\nbFub1wXoeUszAFhtR4kQqn2QWqNtUVQVMtVCO3AYh517xazolhJ6BerZm1Dm\nlMja5SIHzKTisHBPfWTttdvcY/qwdIjWIg46RcCv3R4ZwOFqYx8bkem06PvN\nTpbm9eEZgXQ2rP/Gz9+x1Nx4atvJmF4D+gwwQeHdq0nzQNzqq31e4uauNI2+\n17vG\r\n=WQfP\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCmWOIEr868VC7YFXP3Vha9BBqMqOrTEyCLINrLS6Ty6QIgfoTWGAuSN4z8VUIH36W8gl/LeEqEXSd1fxLXSNZSOhI="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.205_1614024176694_0.26772435378604276"},"_hasShrinkwrap":false},"0.3.206":{"name":"wgraphbasic","version":"0.3.206","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"ec1979a9f365a70371ecc65240596f70a643d0f0","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.206","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-OvhkR4TaUBOhHMmgSs6HKsiAlYhgpmS4ZIT6zy51j32kbJorjnyOCpMHGy6qPdlnnStymdGOOexyu2vvd6aFaA==","shasum":"a9eb90427f65bc7b574315116eeeb0a48dafc672","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.206.tgz","fileCount":10,"unpackedSize":138089,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgN+gxCRA9TVsSAnZWagAAb6EP/jCDniK6/DY/VpxpzvZg\nQxLDzx1PRLTaXIxrBSwqBfynggTvN6WphRLfxSsuQozKgaScNxmVZE9cFhcl\ndiUNDDAh2JovVNWHyv7exCy1rnh/nwqIm12MvDUJkzAzUo2pld1NHZgUZU8m\nTmwNfB3IVumXQqgI+Pr0t1CkO7H8D62xlLy0CK4RG5HOHjhazZoaZbB9ZvBt\nLsK9Kz3HqKlUeKTIUbDtjNJ0hPuqDWOBqRobx99IcO3GAtVzhbPnc+Wff8B+\nLJw/zOerT7OEHVUCrOH5dATsqCWuZ4+cXXWmlc4NbX9ilscRvP2aEUND9xiT\nW0McCjlk8OhxXen77zSJx5yetn22cd7qdo5z78JznvVDlZeGVTC8RfV46ghW\nfsCUAhOw7iNXWgbxIDSqg+qvcshK3YTywrZ3B7ZsP8gNd04mbUjQod14ms06\nXkhKN7M6Qc9hagv/R0FHLYY95akJPNebJxvFnsRzcUL86CST3rzG0wvf8xH9\nK1oUCe66Y8ENORm6kpFK3QN6tv4Fn1saAOfoPqH485oxS+cmkK+PT+JGG2Zz\nqLd+ZBVwj6jndRw3JPKlK7Rr3977QKhXvCT0347KJRUlHz2P9ub11qkDaMvm\nW0HW8czZoYL9ZOMXgVt332MuEg1nuY6IGu+TCamAat/6xKirzqwz6YUhQfeU\nE1MI\r\n=FWjh\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCK2KxBg6jT/ShlFxU/GBEOSRnWaa2eFKNxw03/+nzOQQIhAPuOP3fd4nZic7OLg3XxMQYMo/7qxF4djWoio6we8f4T"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.206_1614276657301_0.07336412104518253"},"_hasShrinkwrap":false},"0.3.207":{"name":"wgraphbasic","version":"0.3.207","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"eslint":"7.1.0","wTesting":"alpha","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"f4c0055dbb911fd00ac8a6c755b447c009446c35","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.207","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-eHlR6SXrl1r8xPfNy2rb+l+YD3ddeNyyTMp0rrl0ID26I5hXEaHTI9EYARp2bdhGgQrrPIBb+TOxRMMT0vO5pQ==","shasum":"3ccadb02f822787c1585da08ea0c3af1d0aab692","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.207.tgz","fileCount":10,"unpackedSize":138116,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgQdjtCRA9TVsSAnZWagAA638P/3crIg6d5+XEdO1MSWxC\nG3BBhGkFiE4Mc9kPL0iDuvU5qkwqs/8JdMQYbih1X/LtvVPJzxuwIEdPTnI1\n4G2sNgUwmLF+7oiGVfr3fj8rEzQKI91EKMU+XxNzVYWsJHE3aWe1P6ON/mPW\nxqoEEhbPsUhDhvFnDJ5oZqhv5vyEGiCq2/Zdbu46IVQdHTyj5U9IEVNteE63\nZbouWjKp/1udx/fvH+wTle/aLQUa+qkV6F/CJfslJJHQWbrGP7GeLSym1Tgk\nu7GlZUrU+tDiqyuLSW8Ob5uZUYaQbmgjlAaJgZxoZnw+qRjhXCwirBSGfr7Z\nwvhBR/D+MGx0f3lG1JgLqG3pRe96phGW2bdfWCrL2RA9MepWCfw1v0YCWiTL\neurZi+qqcOYUenWf7ECIzmgKZhSb3rHtq1Crfg3isruUuDyXTFox9PpIamiE\npjEPCYTx3EBfsJT47WOr2NYsJFaWx75shhRC0ZGAVf6uZjQUf6+B6jOJ6okA\nKv5qT9sgFq02GRRdmSy5P79oXXyaS5Nl2UWqOIsXWt+pkNA9NOR4druFZsjf\n53ZeIvPIXJi0NhEaHCQjVvUvM6His3/BEpemqLl1enQBwHmPIzc3E6K/Ysm8\ntejwLSS433s7yWJfsqcahjS0NumWb78fBa4gl94sSsrM+u3/O5HrhJJ4oZjn\n/DrU\r\n=Aayk\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHKx0e/tHAGSbDVCyqS/z6SY52F5ZwqZSz1hximATVyqAiA7r/myc2vjF0osdR4Iz2YyKeRfsVVZNyDKPFUeCf3VBg=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.207_1614928108712_0.9836392570524182"},"_hasShrinkwrap":false},"0.3.208":{"name":"wgraphbasic","version":"0.3.208","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"fe4a65788f5bd9d1609fe8c458627d7066664376","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.208","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-lhnuXGmp/hSI/XFfHMXhcPA4lx/VXTqG/4NklsR4f4uOJPNmuTBPDCdcFM+se1yHnDr3+YeG40a1taddE0Hjuw==","shasum":"3013eb856f9296ab3e2cf028358f59f5589755f4","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.208.tgz","fileCount":10,"unpackedSize":138116,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgSxokCRA9TVsSAnZWagAAHXEP/i9i1CLrVb22MOysSIHf\nqr3Mjg7XCiulldCDu/FnXo/SIihXqmh8Yp8qylDiKQ5rvzE3bDOEJ5aP3J7V\n577mvvYVPeLiWTPTTauuzGiwK2TdYGJmpmMvYE3O/64rOwoEMSZvEyxFSwfl\nHcOMtpIbMDxzaD62yAXWU9eohOnHPNEXBnNhvietn7E41fpXPw3n69SzeKBK\nvT1e5bg2G+yOEen9QV7cAiP6zM+6DXxHJKaBdAM0L8W2Vnxi6pCS0r4xbNH9\nRsDKF59JESDEcQ/lmYoCFYOu5bSF5F3tV8pO6X54/7pCkXMnHbfaGvbyYIkK\nhUrwAN16K7T+6S427CuM3o9PjBnfBZy04mITv8K3xtVxPfbHlfvqdCgmJiT6\no/9ZLamvwM98D0WhsBlS5rPyBfn82/gE4xseXJ9QLSSVL+BpbhrhudHqzQpw\n/rbvc/WuiHvsmAqykBFomJYfapaqOD3+sT/XxtNI2TQArOm6Q7anEuSznG/K\nR59R92bTmp3oezLNumVNu1ALx1CiN1T7+0/uhdW1SBVk8Lk/q/U86s8xQyl/\nFn3HovmE14xD3fgAecISrJfTSyvwkTQusyAD3alRes1RnUaat095fMEwAq2j\nlqP4quiXBdwbxnStatspXw1b3mNSLxdu5Lb8stMqxzPEx9k1xm0tlF8boupm\nro0J\r\n=UdTA\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIAuUlp37XtYB7dusAePrGZs7OOfGuf3L/Kmy8gcs28CqAiBOgiFKMaPT+oagPnkqLy898G+MWIKNbdJQlAemhNokaw=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.208_1615534627565_0.32459842936788785"},"_hasShrinkwrap":false},"0.3.209":{"name":"wgraphbasic","version":"0.3.209","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"a945153454ee01fa027f2d925eafc0a6daa2d140","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.209","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-qID0FzAvHRYUpRoei3WdHJ7f9So6eXywGZdKJIF2SDwEZhp4wQHfl6zTmVc4XvxLUpPLenxacuKYH2GlXJ2Etw==","shasum":"34f6c5b02926fb0c82ca063107adf1d0042a7aca","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.209.tgz","fileCount":10,"unpackedSize":138179,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgTQOgCRA9TVsSAnZWagAAHogP/Rq39Oc3x4bma5Z2l58c\nCVALwT+QqSciMkySRYMcuh7gwC/ZgWgdooUksjwyDVOWIq4XD598gHRcMTzf\nWi2vR44+sOyoMDUAdOPL9F0RSr2MFN5qsC2pkA2MwkQXxbsrCEzaVgwXjr4y\nIMvlhBZA5bkJoVk4sX5VIYRMlF5qeWbrSSaRMUt1bG+NruberCTyuq8OCK+q\n249M4zzQnk06x75qo7VRZNZr5UiPn/kD6oRUGm9C+UJO3un3nz8rsfa+xhPj\nTQ7ZNKqije0eRgyxrM4bTXSDzasbin3ndNsIT6I0y4t8EPOsfR88eheMnmBl\nnjRiNM2pviE7UaZI5RAal77uKYrqgs7mbVPo6GKJDOCWLMshZXKx1YbZL/C9\noBUAElDNYKZALPA1dJECqeAVbcPpnvDMkK2aJjU5ipUmaufB3/t+XVOm+6pb\nlPAlnKKXCndDssTzlX8oiooK9TK+aC58H4wFeyYQIVIeMFY/lTBu8hs2JGbf\nAkaMRX62oKTBmbAFr7IDxr0AnVC+nZAXss5/fDU8J3ZYyPgWD0CE3tN+bUDO\nbhtJTefbRmfSPjLJVLHSR3VVDp76NRK1J/tDV+eTAaNJde1zVk43/YGQoO+U\nmMGwkKk3hvF0NAKZR8PyhLiXqDmnH0kCgCRedUmNVgSTkhzX6/hIAO0vysu/\n8OZt\r\n=pXPA\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICP06XXUqr2oIB0Fk7yHGFEj0unZOaRicCQSraXTaPBbAiAjty3nZ6tEx//8UxQIFWA09ZAomuoJncyi/8v6M/pFCw=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.209_1615659935666_0.1663259888280748"},"_hasShrinkwrap":false},"0.3.210":{"name":"wgraphbasic","version":"0.3.210","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"7cbac493be75bca46a0185d6ad58827daa05a623","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.210","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-eE9kZwRxV0qExhBrW37fQxmocc6JcdA4v0yUuQTE40+yf1IoDUzTZgWKvqSc3IQGHZGKdcyxfa6kNV2BEYxBrA==","shasum":"7c2b15dbc3246a32789110145104b97a75b88d4a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.210.tgz","fileCount":10,"unpackedSize":138179,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgTbp2CRA9TVsSAnZWagAARSwP/AgmTz+g6D7qGpzEZCBD\nX21SSpOqCAbQQR83U4bfckNgNw1gPp+6AhC3uU4Kae4LeEAdj0pgVeTmkj6O\nrxsx9OuPk8XjoRWZuGng4qDhLsg8WEnZayHV+KgZnzaAQj+raIYwMTYXR5aY\nxov/w/0OwqLYQs2EUX0M6kT4JMcOnebDTZi4X9/kFPk56WBU08xaWre++W/c\n63tTxZBxYsTO6JlFzq4MNiyK7fIEZdvhtpIc3mMmzPg/o65LnmocqELQVamq\nSeeh1to1L82p0nZNTa6X/00FjoNfrTvLNNW4XAHqX5K5BONIr4Dh9PunPE4T\n9nb2VPPAssSyIyOKgMgn3r7xppquP3AD2pPLqATzVXEDdzqEDlWN8U+PjBta\nA4Rf5Rfbw479M4gaMM5dz4innUHfOe/lSV2Av8MkHOQjFKyDIg0b7TzzyUbb\ni+dumXuHzuKRMpRexvNmEcDhIYjTWlzMd4IxdZVjIiQeCYXNNgDqSJinPw/P\nvBDcl4vBRkWWUTD+FGt5IZgXiT9Y4vvFRUIfGHMIfFDlyUHOWlPDvmjAZmnf\nBJ8cw4YD+EfeL9QoR1FYiDCxNv/wuBWF12o1u0UH0k6l920oT1saL7GAgr1Y\nv/+hG2ypHC3d5gLUdVZgkaM7qowInBTiPW7kec80QH8dJbctcsJtkYA/AZhY\niQKj\r\n=FAaU\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHqixp61UKWU+pbNRRMTElbWt2fr+hYjz13CmgUulNdBAiEA5sghuDMuKEBWr+PC11cLu22vey+RoPyKJ2NE31PigOw="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.210_1615706742041_0.4380265473560787"},"_hasShrinkwrap":false},"0.3.211":{"name":"wgraphbasic","version":"0.3.211","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"2ac0fb914c2d2006721ecd6cac0d5a98ab15f1ba","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.211","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-C768BEmTxnu5COR63rOmxfgIIOSK+xsZh791D5iiZsxrxwjcKhvO0Cn1PvlTGa760aMAkrdy852q14h66Pg0BQ==","shasum":"a3c6a9cda587a9cad3ed1de3a996b38eda53419b","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.211.tgz","fileCount":10,"unpackedSize":138179,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgT5IQCRA9TVsSAnZWagAAdd0QAIxNCOR0U8QkxBcA1NY/\nGOn6DdeWBGuBR2ddYZMEwQhfP8fWWNFKLfLcVuwFKhRPwZBNwJqrdnMLLmnb\nzIdCiOvEmY95Te1A2mWC5Dfh4XpykqOlEouFtsixQg3UPwuNUjbfz2UPC50D\nhreeZZVfdEG4kvmLMevBrjBr6tYKXUTTaPrScXtFkqtQM5sGm7/XUEv+qLeN\n2R236au3v3saejiYMFElm11EPuN7GnRIwxL7HaxXtUEEpaM4dh/cfOdabiY7\nKJBv+E9MD9JH21pbB0UWk5fffwh+y1MsC9Rt+VbPJojLZ71ubg56i9+rBB9N\nUKIYkPBOTkVva9tb+TFF4J7ydlW7KlZXXxm9cKuLCghlk6b6W+u/pPoadwoJ\nq/KZ2pX/4JBdkCLURQGMXWU0w2Rf4dHUFULd/a0vONUCuHZSXdmCYdOfRjcP\ndAyLWvosxVjetO0WizhLl5GNqkPSVWZ4LPSEKe/huVz/3VQPV2/Sb3bffZ9d\nJ6OjTy9Z6mYKyuCWZokcMb6kWoXPc0RsEOXxWHMpX+Lk6WetUt1yjXli5xEV\nPWZSzu1eFJZw7nqHa7yy//aqIFhhBkcXCDIdyRP6f3cjIJ0UAonbLKP/jNKV\nv356T0j0KSm4SjxjEWsALmHbFpUUJl1OUkP6CTUHaM7NzpCC2PSEH8rC+xrj\nfQI9\r\n=Nx/t\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICnVU3JwZCOebWYmE7qZUydiTisT0AFSD5pRXdP7yAuLAiEAgLo2TY/af8ATFo5xNYxJA3HVwiGbTKVIxedgk1Wqw1Q="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.211_1615827472337_0.6495818306127794"},"_hasShrinkwrap":false},"0.3.212":{"name":"wgraphbasic","version":"0.3.212","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"0913be2287e18fb5417ab06e80c534995f982efa","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.212","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-lQB4tH6G2unSqqee/aD5J/6OJYj1D8OvZVYhRaJqFQATTopYs+i56yQoZd58t2mii4dFBhlITqa4QKp79ZQ5Eg==","shasum":"f8715723b64ec09cb9dea00bf1d5b090ed98033c","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.212.tgz","fileCount":10,"unpackedSize":138213,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgXgSWCRA9TVsSAnZWagAA4rYQAIu5UJrKC0cMUiewVgcz\nokjJH3H8vYGvsEp5c1m/eecI+rYWUVnT3VaD6we543/MfS9yPnDbVym+K6WM\n8BYQ0UwWSFc5ZACmKAqwZtrc7IgPLc8PINJpseHkhyqqA2p96Nm5eFE/cNzh\nbWwPKJhNp12UaWQeSIqBIO1WxSblB4KQLcHKCJwXTL2pzveUf60ySO0AEK/g\n27ckrg5661L7PCbDG0tBgAeymAB+DVhxaW1HTIjOL9LekWyDUWd93hZP+ATG\ndomKdfkOBiBmls5LbqH8agvxg10Qj8zrAqPLiqfvGXkXZwG4UV5tEyj1ICZ+\nyiGjAu5qwXKw+QAV/raTEh0HiYJOKKalTOLSUUJn3lSjeVg8UCCNdY6zPLOG\nVOz7NFsV9NPniPK6VPrn4dVPhhmMVh22m5pv4nX8oG1MOLVLBEe5DjdWH/eC\nfAdXjGBhWczGiiMGx+N/IQR7ao+SNFrXyT6FLlHkPaFDXOWNvUTKCYMASHGm\nuSRJSOWPcRkq+BIOJ0z+GbFndcD49D8OUbAFgiMQcCktgSLq8svHIkTdzuDK\n6RjonW+mLRkpIzyI8Rw4GPFm8Vd9PBT+fHpqcumcyuYH0pGV+nounINBxEKs\nb+NWg3PLGxs+UpsYT+cvHksZvGsDNAzmxvbCg96WuS9r51Tkvsfj+d9/YSTI\n2+rr\r\n=B+uD\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDAoo5FwpfJ+qVwH3v+jEqWXnlzGfa1k3Jw2qm2dJUcjAIhAKry+ManS/siQA7h1xN7BVsUENEd5zbBfbaSIx1KrJga"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.212_1616774293600_0.600683376011055"},"_hasShrinkwrap":false},"0.3.213":{"name":"wgraphbasic","version":"0.3.213","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"d00897c7860115eda0cd5000d26996e08e78ac34","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.213","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-/qNXAXf2+T1y2wNTGe8PpCPmz/seagASurmwRttuJ/TpE13EqlYsvrd78zO4rIw8mIZfCTcO12fXab1j+adWDA==","shasum":"b9d00107d3456b0d1a926b2ec2a2827285077ad1","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.213.tgz","fileCount":10,"unpackedSize":138225,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgXhT7CRA9TVsSAnZWagAAxa8P/3U9MH0sLmfuqe40ZyQb\n0TVmybVeZial2w9z8Ckl/XAp1Umsth1sP2TYH9sElbLwA+wCjTxJkiZiUYhD\ngB9HQu1qywbISPD7w5/tqRXRbGa/iiJNXyUQKAg9Xxvgi51XJDvMg0aeOQNV\nHUnDFFImrIqS1uA+CUGzf3nDo8nFcgbdd8XVSW0lE2Q4biiY14lvVJRJU5O0\n6ByZTtMR6gitzu1RVnuut70wpCX+WNSdkUBQ284s+6qBQAvhYugH12gUgEs9\nJ+/MDvlT3IH/Bp2qr0dOJWTaRt3I31H80x/P8ZbU2BK3gXlrXvitu+hgmZQ4\nl0VVp0Yq5v2N47+xzhmoAjQwGg76gXfg7ip6AGZ4GF+mvpBrbl/L4NyEotiF\na3AbmUClKTl7fFgCVTTDR6c5fQnDcwz/Y+nK5gF37K/1jRIzywNvknBFbmoy\ngPV0xcB3ysKwBg4A8q7dZAu0/tXeEF4yvFGYHITAtu4uq3eZ7QWYuy2iBJrp\n0S5oWpVblYvt0OWqc79Uf1POjhfISl/a+TC8nXG9wvwTnL7wVgV10b1zzDPN\nYInj8WU83gIuZKKv6EUTWMo8/8Wr+lY8/eqmPkCF9ceRytp84qK3y9CRHl5D\nLhZDUZIx4ueXTag4mGLe0tlrUGJ8qqVdEbeg/GkZM4+dL/HZQARTLXxOlgMV\nTHkH\r\n=0rc/\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHGWrGEJrsaRsJUv/4torKdoPLWl5FKMiaK5Av711GeBAiEA0TrZTFVufEza1NFimlSDPfNj2DBfRDt+6nRZoiQOhyI="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.213_1616778491012_0.5553291736723158"},"_hasShrinkwrap":false},"0.3.214":{"name":"wgraphbasic","version":"0.3.214","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta","wgraphbasic":"file:."},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"4f38bce906d8547071251340381463aacff3c6ca","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.214","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-gkBD6mN/w9XfpRiWFGBNw3yq2cAfMsdNQWtuOqHEWiMep4EwAZOXmhUq2KjMPdLpOZhhk32v+/QnEarJk6QqQw==","shasum":"d70fadb640fe4a00ec679135a88d0e32e7d0d063","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.214.tgz","fileCount":10,"unpackedSize":138225,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgYW2sCRA9TVsSAnZWagAAW1EP/0sMZbpPd+ufPG47T7tK\ng1GGi2RjOP2C38tKCsyoJY/9TL97Er17o2Awf31FW9g6Aj+oAWHFgrShS4M+\nnsIoBH9msRXiXNMWpdcB2gWNPpk7dZj5Twm6J4BLQbmSpFE72Oyr7A8V9zXT\nDD44NOZuSYpaQRFs1uTajGxhyWtYbRqNK8lnwsHpW0JMxMKTSQTsdiDz56qu\nJyOE1+WLPaaumcMV3WzSq7aZpfpZByqEyKzQyV1ji7GwXZ3pE3zL6cSK1uUU\nJ23D+LNl54Et8x0oogPtnpfCXVEAKeQhlrdG451S5WTm1gKJf+9c8TYpeyxW\nHyYrYel1G9bDV2nThYKlPgZHQwi68Xj+NcrsMS/W9IgSInem2sNurZp2mBiL\nri5ZwVeBM8M/JZ5WHfuZiEPWfWuRFdFlSfCx1LbpfK3WBm9/hj+5cR8Aer6Q\nrR32fflHqYQyjki+pAXhKVn1RL8M6xvyVEhM6KNc7VFG9jrv7CAEMxiPxdbf\nUZ2IWjehUeXGJWJMleo/bQgBpSrG2W6AUXS/8w/NHKcu2/d46SY/6TY9t3jv\nzpPIigRiQlWA1fD8QsGAP/Vytrjs3kTu6mmdysOr9yPfGYSLzqToHSI59V87\n0xcoT1nNsDomddnW5KaPlpddLptKLMdys5DjBDPjw4TVgyyZG6y7ylxeXzc8\n9ntW\r\n=1iwY\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBTBnBx7KgLNmwHmGfPnJD4JcPyFggxsUo4Ct+i9KvafAiBs6juOOheo8wZ0+oib34Xw+4ipc6LPZBZlvnTWx2quUg=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.214_1616997803578_0.34351774981170125"},"_hasShrinkwrap":false},"0.3.215":{"name":"wgraphbasic","version":"0.3.215","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"8ebc8d4c982df8e17cc4028aef2fef1131e4ce52","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.215","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-TUuDrX1VIvPmz71OI0+St5dhNQf/xlEu3onoUKI8/inzaoVwEtbcEnD4Pc9TG0wq4SplAJHf/F/BpKBaOjXBSA==","shasum":"01cf38c0a7a4ced2d8605913395c91f128ed4ad5","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.215.tgz","fileCount":11,"unpackedSize":138277,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgY0s2CRA9TVsSAnZWagAA31sP/iwcjoI//ucOBAP1yZcj\n7T1idF7dzkZpuDz/n+VnkefM2PLf8oRKw5WfEtxmxgtWH9e5+ZruL8OrDX48\n7Rw4j/kWei5li6ARtEK/ZyDsTScpeJJIvcriuk3DmbE2b3vQeE5QN52vno7I\nt1eY3k3xlZO0ts3j7nJ0+eFFdG7YI8vcYHGhlWIQ2j6uB5PuPCz0W/g7E/wg\n54u5Sfe25cxPHBq85UxzYl3/PBkjB7MVE3oxjiM3Moh2VldWUEGnl00JA1bE\nr5aTASmgpuQu3/FuhzjjFuyMhVb0pi4MPnnw+P4HZ5Wl4qwhKaORLfBESgGB\nVoCLIl5wNOM6HKdocO/MDXD/OGPgg0zzT9oNxgA9Km8xYdZTga4FVlpolaw2\nppNJ10kPKCTRS5Adde7ZVUxo/F4Ai/LTfOgKN2Nzv4ju+fvQAwllSYq2ni0c\ntMo+c633/wCI2AUcM39Dnyy7yXwKXhA6tiAD0Qr/MV9lHIrAFvFB9TbNr0JY\nr54Mcv6TDiTNIU6m95klX2VZBwrEGWfcwsH+Z2S+0NiweSuZsVBlDZWpSMDz\nqfpgnAEtC4w941v1V9nFysOI3bEw96Xqlq7Zl0m7BPU7ZSNUihhfH0FTLvVy\nms/Dgg91NbuEmUjOSBIiFTN8oecOaE97+6t2K+hJmB43L53YHgYI81D/hcj3\nJcvU\r\n=eMv9\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICTzZ4r9NpuQ++QevoBZlR4F0/mozNpFFqXAIF/Z/vDIAiEA1KfURPqT8YxsCmFAhKi30xvgf+PY+yu8DrpHrn65fCQ="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.215_1617120053999_0.8924857791614753"},"_hasShrinkwrap":false},"0.3.216":{"name":"wgraphbasic","version":"0.3.216","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/wtools/amid/l1/graphBasic/IncludeTop.s","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"2f111cccb964bbf082d0ba2d0da7de87fb40a884","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.216","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-6wigq6ZdZ57jhtai6udrHF7cusOJaCqtdsNOF7wYNlbIq/n1+nS87DjTLMsIL1E4nB1wMFCQIGQbp2OkL0RmbA==","shasum":"35acc235a55d998f21a696c53e946206a575c3b6","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.216.tgz","fileCount":11,"unpackedSize":138294,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgZWyXCRA9TVsSAnZWagAAUVcP/iUqlF6pD1dljMn7iT86\n32VJC8gVtZaNKKK0ttek0mAnaE7oO7iRX2sbbm6jWoQ1Pv+74PmaF7yhSRno\n0QSiHDIZE1Fd55THLsawfiQm74/7JLGGacp23CTzqc+x9DqgKuOoLHcinH2d\ncvqG6XefTKDmBv1ynAYlE38PpkFgJZXDobxNoMPXNNjgCAER6OzKcwv4s/uL\nj8ouP7ygdK4c5ut6CUJQC3byJeTS6sGNQo1Ofgg4REtSEgd+BYEDpqUAN+ra\n6QfdmsTcSIh8nKDKwiURqTD7LmuGhkDfrKnt3POuiHcuZJ2lQGoXCwnyq9gS\ndJ28iHkE4kYFyWhLEY8o8AC0Dg+tB/+BX7XI+n+0+NWSvk81E7+xRH8fydEx\nXpY+LJhU/8XRxRSj6wf1LDdTgFq4ViHM+nuiSi6+r7EdIMgl/5oSETeV1Fw1\n/G23MnNHU32nNLdwp8w5gVnjqOLWlSJo1c8SI5EBTSKy33/wWlGSb0CiT1rW\nD8uHMBFWXZYcLITcLFGriWg/g4Fj8nV+f8HXJRXjVB5nynpvQ5pLm+JNFYWA\nco7boAlcJLaSruipusVz3MBfjED3tCH1IFOezswrf1KPdRzo4L5hX2/QMW5w\nSWwNcCOi/lp28QNkzKsU+iiVgwVsPIoHjUrwEf3FfOrYwR+J8g2+Am6MpDv5\nmEks\r\n=w0i0\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICbODxtgnQ3Vps2KiVizIFX9v8rBxQoiU2jHTbbeUiaxAiEAv70BVsorJWa0LPRv0mQX5EOCX/CBS8st0aCCoZirr7g="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.216_1617259671467_0.36439045092030975"},"_hasShrinkwrap":false},"0.3.217":{"name":"wgraphbasic","version":"0.3.217","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"/pro/module/wGraphBasic/proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"2fb42c2920d73aa6e4dc5b7b80f8ba1de6a286e1","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.217","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-YogE/wNb38QfyDUl2R/b/drk1dS4xIwyjhZAbWwEihBNUVpMJSldonGWoDQua/FpuSSZ01uP8HCnCSnnaPZN/g==","shasum":"85bd4dda58666c045b51fd5db28e5ec75bb5c8a9","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.217.tgz","fileCount":11,"unpackedSize":138551,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgaHXxCRA9TVsSAnZWagAA4X0P+wfHxo4ITssFE92BWJkc\nI8xPkYyWMdsORh8tsIINjIFj/Yj4caKKSrOaqgA+G92LMQQRXTZSjB1IHVKB\nH7vuPS0wheZ5gLZjvx5dzgoymN51pRgXj0OtOx2RhtnYzU6d4S3abmtB3k+7\n54mZooTA+9ZmaqGWmnMeImLAyPR7eyPn2NB4SgfhbYlFCf5SypNKBMdNklZF\nEnK8dJiQAapLtJpqmwqYyk7SAHkve1/cItLMRlSGNLQI4gjYOV53LLn/P8Gj\nC0rrN7gnT5uWik3QC02X42cxuv4D+6DidUbHmOqlcIwWu6RX3oTBezuGcsd6\nG39u20EvBfaRNlCTGUP8GCkt8zM5K7nWaxkSMKrDRoufi7VL5z9HbN3XJ3s8\nNu40t82LKcnLkzwukrXz3dVhHaRkfrsc1jwpj3rdUP5BA3Iqz/cPwJj5qTbd\nrPC7Sb/JTjWLmLvtSg8WCi5oszqh5nVtBoq8G21nvy1klkOqCHrxwEKgsum3\nQe/12bdA3FE9kiD4/kn9E/crFRx/daBTG0hPBA2y3EUBVGv3QGZBN8nuhjWO\nVZV5jzHu75ZQeNraxZr23Kw2u9Ragh+9tPXWuR79ixUX9bl+sZqRSqp1BBm0\ncMBAGStMStQwu1L5AlK0bsd5rFI5vizY3ou9+6QmNvp67VhSZwb1EKrdnzR2\nn92f\r\n=vdpn\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGR73qFTXsAr/RLHBI9nd/AVUgvUFX5QvtnBUl9PoxU4AiBuazoCBr1Nvgy2QeOvEBN4RS+nyolqrOXhf40pUD10/g=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.217_1617458672662_0.6330506534400318"},"_hasShrinkwrap":false},"0.3.218":{"name":"wgraphbasic","version":"0.3.218","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"242335bfe97751bea2b343a52128fb1e14762665","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.218","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-lOAJtJKutsEqcKc4sSmCZxT671CJ28hxuUDbpylhc2zpmmNmNlBWucFjnRZOz5I6D3iYntjTRvDEE5ggOK8i8w==","shasum":"52675fec9661ed811ab50965412c83d07acb6dd2","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.218.tgz","fileCount":11,"unpackedSize":138527,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgaMlACRA9TVsSAnZWagAAL34P/271YnAz61p9tPVuNRiZ\nkVldsSUK1GSn2/Tk0a9Rfake+O2WsCTN6MKCjvLTux6RS1iLi7bv2bqu37s1\nFoPikkLSuumHbsAXpYPky66PSIsKvAQUI9PsB0YwDmZz6JkTL8enLk+hc2ph\nisECTsRKv7tAY/+p2dwhWfsBjC6pMnD5R8mcvPGcLv5q1LzsFWC8kZG9ncVg\n1lfbneAzFVi9fg+IKaD+qBZoWZPPXNiGnrG7j2/SV72OH6opHUkIdV4c5zvY\n40YS1TOUk9uICc2GDTa9AfKWCmumHx70DRrCE2r8eA9LdZpg+52qDvVPF7g0\nmKqkgCVx2V18jcaIK8FwucS74o9bCXlQT1Zig6+pJSLKuv9YtmaNugbw1wnR\niE2WhL3Y/5vpsIXVZoLoVekIFH3rAiNF6jzmud6CUHvPutRkjIcDeJ1Lw/ng\n8bY3UMPdmc/H+wh7mt1ibmFP0wnhna6HP8V6ooC9F13ae4n0xpveQBVgUIwk\neDe3HZsVMnUYNjDGoWUx+4+uiTLWPiVXN30o1XuuuRwA0LthOSvAb3TkR015\nAUv0R2BtuOSS/xuc2M2lgx9+qT4gu6luFZonuuTuO21flwp92EJZc6G8ONGE\n2SPdihWpk4z9zixUEi72wCJWLhHYcj0WrZJzh3oeQ4BsmwrV99StCYtOb2FG\nvouR\r\n=0Q1d\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCZjPSaz7e14ENvBDOIwgCTwDKkopkPxyVpVqmgDxW53gIgH6ccp718ZEocC9kyy1siqmkFyjlxM/S0julyZ4t1/x0="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.218_1617479999739_0.9441397910760669"},"_hasShrinkwrap":false},"0.3.219":{"name":"wgraphbasic","version":"0.3.219","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"b46573f20b621dcf283246a8a65a86f7ebb9eb2f","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.219","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-WPcufwpukEc3QZycOLsIKwazvFgriplnOyb7sAzTQYlzEe9eldprEykQN8SlTYHjP8ljG5gfQDUXYhPvIf7gnQ==","shasum":"e01c64e8474f7c7510a41011be3f8d76f9d3b1eb","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.219.tgz","fileCount":11,"unpackedSize":138527,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgaXHLCRA9TVsSAnZWagAA9xEP/iGKCAyJaufoL4lANGco\n+6eoDrNDWzhzP4O9NMH95qy9RVyquhoHbXWjWaqTIqy94CP0Upa0Jg+bCUNg\nw4QwaI1dPqfL2iYMvagzs9DRDS7CgwWRTc3l/6vQO/hd0xEnpoUZydMRc6hQ\n5UfKg03NqsPn9OYUH5hJiidxjr8K8rvTCEjkM+hpg6Fnsz9niU7a+TSFzkAi\nqF+NMyLRGdL8khPDokYDufI2fufZbR/w/JQS9oFGWJZxnzL411QqUcbkrEgW\n0Q2eyxrPIMnw4cQh8TN77PDHJ4E/kFjGQJbElwSh0jISrjsv7d5vbpnGUhKo\nn1iMYqLRGDPobWPKZ0YQJzPv9RMXzoMAfKWyjWwV9YsxXbjH3JgBg+RZgLeO\n+/sBsYWNUrerwp1+n/nyfGcJe/2d1uQTJ9v+Re0q+Sg8HtJpnoln/8OjNAG3\nkLHSyJbit6SW1lVfmr0SNQJsinAZgJTWsGU9bi543NcSmSmoP/wB4DeVbKXD\nKE2QqWjIfvcc2MFBU5v4LCKJIr2ecGmPFqNJG13CzkfPcIPOs5Uc1/XvjwDN\niZEEeAUxzYQ059ANdGtt56JoW+AMxr4ht8f/sQvvowE81rS8DciRF/5nGXqM\nzC4uyXV5+JlHmi80KBEYd3DQmSronSqKwM29Kw3glt7Spz9dIqEieUif2oob\neiQz\r\n=Rl36\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQD8wR0aMdVMTugbI4SQ/KSaiu/zSUrWfcsBZWCQCvik4QIgfYy9PkyxDWqpgpFd1ylB32BSx1thqjfMIpepMb8+3+0="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.219_1617523146876_0.14311344483029975"},"_hasShrinkwrap":false},"0.3.220":{"name":"wgraphbasic","version":"0.3.220","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"1b1443c15fbc2bf5940eff67aae3ce3e8c6a14d2","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.220","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-jzHSntHei4dQ90wc4LQl8USxwKrlqKgf+L/zfZJ4Rwy5oTIfVYoZd3TwPL5KZ+oCTXFM55pAKiDy2Fb/eZEomA==","shasum":"e2b09170825b729664fe6bb7ee51776c209c2a50","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.220.tgz","fileCount":11,"unpackedSize":138527,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJga01pCRA9TVsSAnZWagAAVR4P/RY4IkKdr5VJj0K7XoJH\nyEtkXlOuMtJJH2XokqCgmOlNlEUeVBVsbWcP/BnOLao6dxhr+AyYB4f7jS+5\nP7Rt2Jh4+WBMa+EMJgpmYo59V8vNnJp8vP1d1/krS59ZpnoQoB2/5/JJN7/8\nw+RUmPIZcTQXVfRKs1o/yyVlT7Xcsd6XetlilQy0lnKfoUjiAFTnWBCF2dii\nKitenJ9qIeojDoM52Xqbq1AsYxs+YPjcluOHco5VZi+PMPL69dFti+D379Cm\nj/LrNG7mLdYg+bbvzIAluOS1ncTmXTsigpJhxXp1HPzsrphlaYuQ3a/NRcha\nUZE47eFatR8GamVgwBaEudM2uL+/MS1fnXWAjwmKZ4sdi3/aHqGoHKg6Ky6l\nTG/THdl2KxQ72y5ylm7E85Lx/GdHQHrNF7VbsZ3RQr9mwSyP410LpX+2t31i\nnLgvqZcLNjJmQRoEOsBQn6TCUcO5Et8GYxpWrlDmDugHuH9BpmkcITqrvkjK\nru/ZaSQos1CvBV6DNBCLLrDShoDmWOAn1Lw4ycNu6TkPR8eKJN9zzfc9l8Kl\nVbY4HSi/om0oB83zS+1IkoflQ/CrI67j41syjFjhc17k3ud0a8rv9XNwp4Ai\nSmqT9UNSctTY+oIXZkNeSJ+DGusrH/ddEf3+/92NW0j5lrc0oL78zIxvYk9m\n9U0X\r\n=RwW0\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCcwIDJT5BnSK7ErjxXAw/hpM9BkuFOxTG8xbMZksKoyQIgVYkZCv+Kbb7Y3c9nDBcJi2P2+jP1PzjCy5sQXyynPFU="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.220_1617644904512_0.7364347765721473"},"_hasShrinkwrap":false},"0.3.221":{"name":"wgraphbasic","version":"0.3.221","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"7c695e2311111ca567247a78a562bafe64f2b25f","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.221","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-lc8hnzshnZCG5n27xlieB/tBQc27fRw88ye92Nk04uYD6ClPnSWQVBuHmWe8GoZAUXiwPpt4YgkFziXAXETpyw==","shasum":"7120b8807963b844abba7730bbb4f521519d6364","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.221.tgz","fileCount":11,"unpackedSize":138519,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgbGvwCRA9TVsSAnZWagAATsoP/1XuRwN6+JUnKutjOApp\nCbwf5spJU5xHcMDfWqOY0plePdUjJpCp05aI+Di6ICS3LQO69Tn8uWH0GZhI\nEEtdZHq/efkYxruqlx90hknMHwwwWDXO9PCk3OTUhmJflwXv9RMLMinl+atc\nexXqZPRMRhhLrafNcTvW6XhbzGqikeqk0+R9BTEXae3uXnPbGT7kKs8Eao1n\nOaQMomUBrWasOqXgxIKTPenzKEkbUsPMcFpCjWcoXW0/jGkLo/RLDieyEt97\nIUTlW/lLUA331vz8ZIwgs+dBJmlMl+GrmsSLzNZBWnQ8yAxkgUKksjysDBbE\nr+qVdQCEEHoctQEiTEHLQBMFv1L26OoLmNFu9uP7wAPnS4ZOYLhSEUMJtIyA\n3PZj9muRI/8kswi2dsebZ3YKn7cVJrLHGuGYsPX3wXeiGUJp5ig4lAPoSoIT\n6CQukGDBYKsb3Mk9/EM3PxzBmG02LrFLTvlLnDeOpiLzcdD2Yu5tl70rscvD\nve6/lUSzht8EbnXwJX8PwsiAb9KmoZMEF56r3YNNPAjyIViuD9YZsGP/F2kg\n19cWPwVYGjjBQ8NL3/+T7U+nbIfvjyAofLF39FG+x7KNB5k8fnhkfaDapGJT\njVzSpHIX4QaWPkckD3h9V9XHS2HTDnCLJgM+KLjLDz5cAWLhve9rGaoTSRxl\nxrhS\r\n=rosP\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDz0xsAjEcgRb57TYccn50QUbRG+6sa2nAH9+j49geWagIhAOufepZSI9BlW0+x2mOvyhn1oKsGBSZoNZEoCGV5BIN1"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.221_1617718256441_0.5182011470014602"},"_hasShrinkwrap":false},"0.3.222":{"name":"wgraphbasic","version":"0.3.222","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"723bf9079e7ebe15b6dbb91934acb4e4c51065e9","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.222","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-Tp/R72WG2dHYEXUon5nK01QZrZSqzeXE4WTBcK6TXpMhKa0iH1QH07yX4OdErF6rTa5V8Wzhx7Q1wILGnrPO3Q==","shasum":"3873867618b377f245f1d3350d64c57892b8b747","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.222.tgz","fileCount":11,"unpackedSize":138523,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgbPSyCRA9TVsSAnZWagAAoKEP/Rt7K/Y/XYTjYthJ/71r\nwuqHImIVsGW6gFRKFeoBButd70aeEQacQoRtvzUAMx0DyZZoyw4pARpA4XUO\nzDiKAs8sfBqd1TQMxoATTxkToYOjrqvgmH7TNzvy4pSnHzn37f0ltGOmNGzj\nEVBsBEG/kmzKnpZ0M0Pa3iw1nR1lqlchyHyK5qbSVuyVAoTW1fWsD4AviiD6\nIuffvHhDZzDQZTX2t6wkWKMETUqkNt/Rj0rV0VZHfzqmRy1lxRMchQbDw5WD\ngkN/BmtKvINDv9tPncSZ/jR9WyeQvvnjXAQs+W22xCBdWG0kuDmwvuIk23oA\n/tAmwyqarKgkrW6WqpTWJVsCOahjt75JUkY2LCGMrKW1nKuqi05O0ybxtI6F\n9v0Yb33UBgBgUDLRY/CGnWql/oEXbcbxklESsHveq8/NRy6vkF7f5oKBLjvY\nuFsEZuDW7pLE75rFkm3Rpwxtg7frALVsArYKVedN6lC02xH+L2DkaXif/QWh\nAUUds+dzCgWzrA2KAtudhxwc6d5AF7jdIsvilVmV0BwjJ5pe62M6sh/m08QC\nDp1+u04EfMFg2UV52AjkhgnJMZzY4F9tESqFToRcyHK10g7O0DaE5D3TKV7n\nURFuD8h9aaR91N1v9T3k918jl0XimmA122C+bTuhK7UgU3csJ1rI0F3gL7mK\nc4kH\r\n=kHUD\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQD8X6evWGK7pn+xfqPvBRLxFjev3Ul21jSPNn/f1ZoangIga6dLsQWuBwsfGIJ+1sf6+/AEE/9K/AW64qgKV0HoSuo="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.222_1617753265607_0.41004322069595767"},"_hasShrinkwrap":false},"0.3.223":{"name":"wgraphbasic","version":"0.3.223","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"beab48bfe42725dd2c17ddbeb05d14021bf832ff","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.223","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-xxD1LVowODOec/9M7ob19tvKsgVaQQZHr2F/TNW5zh4LTIeXVcqHdexUORADluCmMNGAEJYB9n/VGoFO0AxBMQ==","shasum":"4f94f4c234fca3039effc6094f15ac092d954581","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.223.tgz","fileCount":11,"unpackedSize":138652,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgbqHwCRA9TVsSAnZWagAAv1wP/RANlWNQqvQzp6j9LdiK\nNnH2U5UKu0RjOYxdPa6jMsA0Zsom4qsL0qrDx7ROAvrYPMR1qYiQ8Zg9rDiO\nEvkwhP8Tvi6J1qbrEBcv3kFRMvGaNViR2wsqqCm//Du4plU5eYlDAP68/f5P\ndFz41RE7J19qidkVCAV1jrUUipLxpBDoOO09PyCy+A3uk95sQn9tcOoGb3ei\n8X9qm0Rpe1zyeHQd3XzGpObNHM+oWODJxTrD6AM4A1HGbLyGmmukMNt8GM7H\npkh3sW+KufV/Zt2sA7q/fKyD0c3LqOjLSG96LtF+G81T5VfVMUvtDb70eFUW\n4MzR0FniDEYFvohy/MuiaYac30Xh+W4+VXRboY0bCKcaoy7cizPT44x9SRHa\nxCnr5yKgO4E8u46kW3OD/vUoQ/eQHsho5ZvGcijZMGAI3ukc6bcXnhjnajv9\n7+KTom5rbgNjbhGAZo41tNdW1UQWTchyy/2s7+RZ5Vafi9KmyB92IL1EwWl6\npErBupQUufsN5CwZHkkjBgS8O2pRRABXe52V/UJg/557i7DLREwdlU9ywmB/\nJYivnnmtxHyRu/HHOxYUQzHLsG3I/0ux4RUz/URAVkRaqtlUbTHjSsG7zlma\n2d+YK3ISwF8RYyP5qFKux/VBk4aIhymeU4uZTLoKG8Cnhf6aZ8tXosUIDs4X\neer+\r\n=hFJx\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICQerjPq/3Y7o+9yMQFpdiIRsOMBCicJaW0XRY3uEW33AiBPvFoDngRxbxRyWepWniEk6lO5S6VlPZp/vzuzj13sng=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.223_1617863151723_0.526054625112993"},"_hasShrinkwrap":false},"0.3.224":{"name":"wgraphbasic","version":"0.3.224","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"bf07cb976717034015d4c1ffb7f54e04e7c296d1","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.224","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-g7ol/RWFWOVSisiZJb9oZYAIIwbbqSN7G2jL8IX9bJBfl8GZKRN1alCd8gsl6w1DrEP4r17tFwauLRdVQKgTqA==","shasum":"5c353a9d5c3a8dbdc909dd798c7c7979f74823eb","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.224.tgz","fileCount":11,"unpackedSize":138652,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgbsXLCRA9TVsSAnZWagAAJEUP/3ZooGeR2na+rwsuathP\nAF3wDjUommrhHXCt1D29lNMVwquMHZI3boygpFZcizhT9T8qM8ABLLKNrS3v\n1YPcsHu3uMJzqetNmQZ0OKSJqRRe89rVcLuZKpbTdUyKJ+cPJyXJeuByzUsA\n0IcPz2brzjBlDjhT6iUEBzp6wdvMxa3Qy+8DMcRIgMWVCVJ7L7azFq03e47S\nRrH/TluU2C54VyurVUNgJ6HuIU/q8wGJA8kj6TwicyZeAAdCs9WB83b2ZAJt\noBPBgT7uJ7uNzhySvTIh2drT4hozJMFr/1GEHXptOUGcrqn7I/t/7SoAgU9R\n6EFWdNycLqw64nrmfd1Ru12LYl6iAy4yUCOZmDWn9ppFwKBUpugQWzULhBYG\nNnlHm9MWID02vvVYin5RJ8ig6Yy9bSU1yx6gSymKWiZ31oOenQPD/Q/Qc+yO\ntZghqwijPUoymZDN9+fJ6lKBkzHqAs5DNrBhBUUEnZKGlJmUAQB0XoYx6Ci9\nlDeMGWqcJlRMGqGC981q9KoFFVFnETvYOX8bE9ukXFKZAWW9GEyrthS+aYVe\nvZIEoLdqIEsRJFovEkBz5/Zz3pgR5kR2sZ7LTUjyYgbH4kmIHkPqp4n6+ZDB\n7nGR9U8HnSxej3Oxz1xvmMijD0ndccr/rmLB0RGJzxkn+TVJ6+c+1Sj1BxZ3\nIi9G\r\n=VQQc\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCV3ZGC0Hr18teiMV+OnkqpxeyekxAG6KFrR+pYA6kK6gIhAIBLk0Vqpne1ocJAKB4W5jS/efmlnQNRaP39VzaCYAon"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.224_1617872330949_0.4182636884082649"},"_hasShrinkwrap":false},"0.3.225":{"name":"wgraphbasic","version":"0.3.225","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"5cd2f7c2b6f6d2c8a0b71ca5072f6b9e795ea7d4","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.225","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-MzN7YB3ItSAVoSzw8/tUiSYLbQVBBm1RDii3A38X82aeIdKS0lvgvt6g2oy8Q52qvl4doSMSD8SNIXfURrZ9Ig==","shasum":"cde0d8befc842ddbef9cd83acb831143725630ab","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.225.tgz","fileCount":11,"unpackedSize":138652,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgbt1MCRA9TVsSAnZWagAAHYQP/AzI8gC0av5i1mFVjVSq\nkKsz4n7zIpmjMidOt3/ob3/UX06QxdIewhRmEdqPUjTKYJpKTWy8o1aS4aIL\nff/OrKlsqqaCXCaPKFZs4QqKwpZ03c83Q57A/g47RiPGj8a29pizEpSLPYIL\nLDlKmr+fuJ+hmmP+4iNEmXyJLeZZL3oHT7dKUiaUH3mA575vxiCd+EOBBmIr\nY8spWM6CWeZY1Q2nX1pKuVwswq4iJG4/aEwpuqMLlpJVm+y5xXvi/EAGjvTQ\n23V9/3zoF+1DbbSVOOZf1ACtthHNTBcRERDSxT5jJ1UCmzoq8MWZoyI4jBwn\nJ8YkW3MS7M0Ry7gpnYP06Z0vZdoBVT0/EXczcGlhGeywkcA+56thGa5H12vf\nQ/ejNjTbRsDD8pylOvOac3xfm5moJXwWebgHcMEpzqFkRd6pEBIWnyq5Xx/a\n7fkBopMCdHrVd+Nx1vduzg2mJkzpSYdyqhp6MyU6CYQJrpmvWCqTNOVmQB7q\nXiK1DfLI/bOsMf+xEKRTT3g7clGoZiXXWhjDxzU+BdrT3v5AkNgFEi+hKSjL\nbvhAbntgn0i0c1NW6ydm985GcRgQ2b2hIDZJvaQ7izclBdwIX0msRsfrc2QU\n942ys235K+XYWA6BnHLpdmdm1C2/n5tyYOW/tYQEcOeuBjrx3GXH1uigZ0fW\n3m5R\r\n=5vqn\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDUsMuE3nYxPDTiAZ9a13g9tbAwBdUXoehuUDF1ysdZ9wIhAL8IP1hw8nrClubHEQSWoxty8R+JCcyUHy+N1DFTKkLc"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.225_1617878348208_0.2755905351058683"},"_hasShrinkwrap":false},"0.3.226":{"name":"wgraphbasic","version":"0.3.226","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"bddf7044d4fb3f732253f01cddc25b4c257827ed","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.226","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-tSjf79XOR85fpjj2HqDqNxSOQcdpjipNLe8eHPVDFFdgIHiL4ncR1bvQZ3jjRALV+7j8O5gTk3gsBJVG41aH5Q==","shasum":"d065d19a4383d9a0d2971707e937cfa3638643d0","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.226.tgz","fileCount":11,"unpackedSize":138652,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgcg1ICRA9TVsSAnZWagAAStEP/j2Jeyj3XWmE1RAoCVTn\neW0Ie1H1jWCtMioghx0DIZgx0wqVomc4K5B68aPGjFj517/avUB+nrNUVRbT\nR0QA3aZ2oCbeBMZSaSUk1N6fPl6Ius1ud3Nylv5+JtbFF7E9WGDhhatM9rf4\nhHOvVy/TaZnhtJnkCcktypRnnXXKGeM4err+ayrV2Ey1mIKSxp/1vcxEVKSY\naGFg9UhMRdKPCDoqOyhehVbiyyvsVEH99lZvQBbyua3nl0xTaHh3ztkRlUnE\nzJFyyFzmR3cVyebKik//7vEmfdG9kEilvu9+qmZIlCSAgiQxAWQlUzec5hkf\nMNpJ0EXuBpnN3lEluidqIRet7ceXpE2SFj8JLhnUhHwV6qiIBIH4nLIgjtFY\naEVZ30UxRy7n/dcMm4JpHN7z725IxrJJ882UAr2ja1pCpeu30jtwt3DH9RDF\nq0QLUQc3ZkV1Oe9nLpbSwtoAp4V/XnZmukq3xpSLjtSuPHZsYSvxhSCWr97O\nQTra4UeBQ9R3Vhb1LKi5/qHQE42VayZ3S3VWvOmx3OP0xLmuYrEkKHEPYDjj\nNbTgQtDmckZrM9sO3pjjRR16XPdCpAzdpFtsznqBkNpfqnT9Z7dSJX4IsWLS\niLPfPofwD8BCxgSDe58iqH1JZcXHGv6MltDLDBuUaSrZeIedXAq2bMjiWQP5\nMbj2\r\n=F7/r\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCFy78nec4ffxL1s0N/V1sILsSMf4/C9bLGbI4dh4nLGQIhAPlIHL2S7wdriPyaZwZBZjXTlZT0ECE9hr+RW3VDE7uT"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.226_1618087240109_0.3224740078691848"},"_hasShrinkwrap":false},"0.3.227":{"name":"wgraphbasic","version":"0.3.227","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"c7db1f8639298882b27a86f46599cc4a80859a90","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.227","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-HXd7jcr/M9M0EvhmFwXezZJw9o7J9PhOBft7Q4oSvOkGuD+4z7s1YfHe9nequ7s1Rygysz6oTquhF29WOoGk3A==","shasum":"8dac87d3df8f5ac384d0db65e7d45ffc4017f166","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.227.tgz","fileCount":11,"unpackedSize":138818,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJghr+mCRA9TVsSAnZWagAASjIQAIDGrnnxz9MU61ja79r4\nqN5wNzbifvMlOTSir6USMTS7TwmtBmUUvuz0e3wQEQLTePXZ6lIeu4T1YmS7\nfVTH2Rzty0qGSFGLxdS+T8Hu3u2a8bsqjGHwMOlyN167Sco4DeO9H5YzsEkM\nq7CyJ8fq9wk5QoDWfBSyBWPzzKfEQV5Xf9AL06wA2d+KOCaB8lt6Go/a4ZUA\ntwekV1uyGYw9nqohvULmHKqNZjbRL7DCNgUVE7mMM8THIfrerAW4HTNrgAYy\nAwPFAf706ipROM/hvPEArwokS5N5U2ysntwhZ9pcgzhWF72PmhBxwlQ+5D26\nncOpBrji+txSxVD7U20FUBPewbBoV++DL4Jc6FKH9ato7GHCocuiMW/NX8IW\nj57oZI+HUGqe7vFztf6ojUg2Mpyap1ATNCkhe0tycfYBSZg3s4GcuA/ZXaTM\nC/tR0XknuOURrIY04U1l+rP1t77azv2eYSsb4Q3A60nBghsuaIIdr3QDbYme\n9mBNbsTDR6gBlM/n3Ixhr1F5u3Go4cnntllz7bWWOFcJIxCt4t88K+rUpoKW\nwJz6khvgQJBodkJoSUHrt8mWJvStW2PvqD23Xg8a/z4NFnQ/op2rPtTJ+uFP\n9EtLpGdrlJoasvsqw8/kgivHiGoPFvgIx/zMylCUyPWrFPM3Bp59z3fpkSSL\ndSTz\r\n=RTkg\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC/3qkLjUti0M4N7dJcrgvQI/MASm5t8nCtOpgG66IxyQIgFdKwy2xYxro0XHIe+s21v25phJeuhUtqdMlgQWihlsE="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.227_1619443622445_0.6731216071064017"},"_hasShrinkwrap":false},"0.3.228":{"name":"wgraphbasic","version":"0.3.228","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"b0bbf84d6eab60087a41b26127d09679158580ab","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.228","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-WXKDCTWy7v24jkAJNwuPp4tLbTFZBCiL7fsEVBZ0xHNospNKD+VYukGQn/R+xMrZ1tqWa3Scol8vw5BYb9k0fw==","shasum":"c71ff588e5ce496a8c84e7a884c6e6f14badb074","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.228.tgz","fileCount":11,"unpackedSize":138818,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgh99MCRA9TVsSAnZWagAAh4gQAIN5bK284O/n5vHbPR8f\njG9WBBB7OBgx21W7Qm7NshrQuRTjP7O1hhRorbB592w9fW6Y/bqL0aGlEk54\nnUcjhiCxeZdpv3VjZI9IsYKS+vQx7bMoVUV/SNo3ZA8OouAGaTPKUHrmyYyz\ns3QrwTHtFSbwK71afuq8/H7uQnzmXin1vbcZAHPwJnOzQ1UcwwAqv3tUpEcA\nn6HT17OrOT/Eq2Aibp12AQuBuSNZjvWUwKnNDSQvXg8NsOgk6DMd6Modte34\nnjjhUAhYvcjVli1B/oyRvplt91QGqqR3GKnHh7AbHa1FLpZuy9GtsufhD0TS\nJ0k4izYh+HV/lNZdckNwosctK9bHKkEm5bGw7/CASHuJLq2210r3ZNF68z5S\nCJkw9wdsE50DcfkGBGh0f2GkU9j36gVj2Y1BY39dtN8NJmI/0VEjV+l05+1k\nM//w6iY1G/CIaEGTeL9HhAKZB/Cj51VIj+57WzMMTh7y3vHaI9mkJedA8BOa\n2GNXJ8WPTGSfN9syMTA6k2PmtSiGa9nuN9lvRS0E8JCctzFLCUCV/Q7ssfLC\n6//hdwrsWl1DIeu991ldh119yuryGLPZH4FqbTiJhCDsS4PqAW4qpsiO/BYC\naQrjZrRft6h23T4A0m/ZI8yPcx8LV/BN/VxDyDLEEkmeEMAWQVeJhmjS3PzF\nSWtS\r\n=dL6k\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEEB9+PR8iXIzTC6eJ2eIIle4TWUGVGCiSsLV6rU5LYMAiEAg7Fly+D8lr0VyeviJeSQyXw62vA0/GBD5UxiStGMKx4="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.228_1619517260510_0.8309200613952954"},"_hasShrinkwrap":false},"0.3.229":{"name":"wgraphbasic","version":"0.3.229","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"fb57216063961e5f7f0072a660215bd96c143c57","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.229","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-6s3o8U5zg2Rlwhh7w/YzS5cW5/QGHNtJe9jinul9/HsggMN3XovlMhx6xwuapj9MvFP6K2xRbXbEgnW/Fd+6pw==","shasum":"62e14e7aa11c9ddb3feaa7feb8be7de9a1ef7072","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.229.tgz","fileCount":11,"unpackedSize":138842,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgisseCRA9TVsSAnZWagAAkMcP/2+tOE1JjQrmsXBBPuuu\nojc30nv3jYdITAir3LquqYQ3xQRX5kxYeVMoOCta2HF0UMkVF65eqFEPVO1B\n4F77iotKAucHCKhhAtOwlxYHF8Yjdwj3N2a6SIuNKWsHMO1RQkxxnZfKyfXx\nyctd/4G0MJEPmYEEj5Purxj51JPQLtj69xM06IksjrldLCrDkTt2/CLC2Gyo\nWNuWXpHkUdOyEB5AKxjFyePy2N6LRf+/PtMN7Nqi52Eo13wNZPKUzR65EOIj\nGPlfwB11k8UJeNDR+bsc5eNiwT5cqdi8R1VNM8BK2A/czoV1EgnSNTL/nGPN\nor9QOZtIwg0ahaZS7Ew26o8NF08TZRFgephUr0GdK6Qcl5SZasvQAa6Qw6hq\nag+wV/6dGcvb/u41sDgziFg4STabrzyacxKilQ8//T3Q1vpqomRQUzm4J49Z\nsfW7Gw4T5CAKHE3lwvjpP7pxd9zzR4d8YPuBR2sjd14FvbzNpRb5B2ZJDDp7\nfj8kywm+mo3NFuKQgVtrXJSEcID4IpSpaXlPxytalu42QBJTlDCYgmz4RMTV\nLQkTgoRlW0rn1ePOp1RCofqpMNwa6wRRVatTzBMKfKQISnkPkmoOqiG02uoe\nIabBkliDdZpd9MCC0n/cn3IcFoi4rQloiSxged6OsFspYYT4VVx6N5JG0F3Y\nLq95\r\n=f33Z\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIFPytcwLEYeqZO3PORYNb/peHTFB18bh9FdmP+sWbiV6AiEAgcmgGpC6FthvFA34tzyeBizAWPvTlKJ+/ntLYmj0wEQ="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.229_1619708702033_0.005896829326432096"},"_hasShrinkwrap":false},"0.3.230":{"name":"wgraphbasic","version":"0.3.230","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"43c2dc5fbe5815aa8b4c40f79bd3b1d19e5e45d9","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.230","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-WFzFPDmwyqJufjhGVMGIjUyFDTouMEr5wb/GL+AVJwanfEhuMVVM7+jVS4Trdh2qt8CGccxP6dKh1P0u4AUFUg==","shasum":"c458aa9bf02cea276dca09fe65839fae26dd4b35","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.230.tgz","fileCount":11,"unpackedSize":138852,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgi5+6CRA9TVsSAnZWagAAfcQP/RaL07oUOE9IlJt+feWK\n058JJ87ulvTBvY+eg/cAhOLPSonTv4eeCrL7IIyhCj03N4DnaD6p4iLUgZtt\nvZmVTeiAuRftQtRJDO6yp1crBzAApMLPxyYkgW9GIBJ66iMTMJHIIbX387no\ncqeCsz3O/Zab02BTPCoDsT/SvNoxYWhPQKMIXpjiZW+pLE/AxgIFWQ8KPfvR\nXRodhuIThcN7UInBEFow4RGQA2tcejlCvTCzASItbkA0gwstSdHRGR5Bnrzo\ne9skvYIxml4eaKCbAYP5ssykZpmF5XtuYn/BPmeiGUr7rFQytgwuf/+BNeZS\nQbEAnbp52Z7cI0bX5cXDrXXrHZBw2rdIPxF71K67t0g9n/1iXBym/v86/TKy\nYbfr5UbraCwSabJQldMUaNyzgRyLtGX4ibHKa3MuBrlf4rZV4ZmLa3dVNmGs\na4pPPSPjcOnFJhNSbDGd05RdamxeIr4hbyDyxZ/dcfnQ+bt+pKnjfq49eNru\nSSgrXq+FBp6JsZABtPWCxiSdmOoPwVeQuHmSRSBcImaylLOV3XP2fn8FiQbl\nkP4MW8VqWxezLsfZI82f3h2xe3QuoxeJ9K4ot0y2WpX7EKxYlV+bXKNnU5kR\n2S/ZmEw4Wd6qYRRDo5NpUefaFn9BwW9LWiDg0hKtTEsTELRSj4PSGT3l4dYx\nPrMi\r\n=Su4E\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBedVAQmzcF3GuBlth9tE70ctiwC1xk7F2uZzlqTtLsAAiA7MSsfwn3/oVYwBYXMfjVIexoEO8LHXTnDCBUkPwtHPg=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.230_1619763129857_0.06620607058592531"},"_hasShrinkwrap":false},"0.3.231":{"name":"wgraphbasic","version":"0.3.231","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/workflows/publish/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions?query=workflow%3Apublish) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n## To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"823fdeaed957876f62ccc79f2e5b6c3dfc34189c","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.231","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-TwPqUxUDtaCeexm/5eMruV4GsdytsQRBvNgjfwdaU11ztpT5WxyDZntBwOztSd+I9mlNkdZ/nnDKKcf5Vv8KVQ==","shasum":"ea7526231f85beb1be644d88d290a4fdd67bbf86","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.231.tgz","fileCount":11,"unpackedSize":138862,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgkQpECRA9TVsSAnZWagAAAO8P/1vSQNHWdzz/O9/PD0DM\nVlSPQnpjCKK99V5q1FCVTUYI9IjdcHNgHOWZywGgctbfJE6GWqu2dTU2B4uA\nw06qYIkN8Ge2Dk3+DZkjxtb60DNeDsJPx+vtvKOcqRPcGaARrnzamgf9Cefe\nZJJ9QNSGdLbzTHdKolzQ+xH+zk35hpIefa16V5xgVRZTpPJ7WwY4g4CqOBfH\nvYR4b+7hibJznu7xC/J+WpwuaSKlAEwl6JOQNyt//I/cSWJ3mbuu2ZO3DlXz\nWXcnf+RnI+JT1ghCE/7noQOLpcHHyFya65vWrEmY5E37nB5d0KHwNrfnvW1a\n6L61GDtDph8c+/5DwfyvygAekPJw2wihMd1G1XQMSEtoRPKy/PkTzt+4ktTO\nfcnp5yZSH2bh+ukafD4p4L/QRD+W6RKCrMdwnE6dk4gKIy5HCd033r7HIqFQ\n47goeYy0eRayAQduiASwmza8ynpqpwSzYCu3++hxyh/sZd4wV//Ebqr1oWb2\nT3MkNS6bXynI3Km7eQfrle8U2JDpUavbZevSJghP6k+WzCRMzvrM4KLPx6ob\nUS4Ta6mh1JuuAJKg7WAR3LqWZeJVk6954mYPZfCFMUeHrE37ldnWFDYvFDu5\ndUNsCXyY1bLTCjWfXZfSJAOg5EmBH4gTMra3MdsWyiJLIt9zLp4y14ZBFeXn\nvzZa\r\n=weIq\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIAXXSGTdmiP1OO2CM5zJTjH960sMHbvynCUIShg1zv50AiEAhemt28VPTmT8z4ROYR3jBzGlPqD9L9POQsnAe3nWNjc="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.231_1620118084471_0.5902446860437989"},"_hasShrinkwrap":false},"0.3.232":{"name":"wgraphbasic","version":"0.3.232","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n## Try out from the repository\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nnpm install\nnode sample/trivial/Sample.s\n```\n\n### To add to your project\n```\nnpm add 'wgraphbasic@alpha'\n```\n","readmeFilename":"README.md","gitHead":"fc71a339f7892aad9af9312d931c56bb1e554828","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.232","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-HNZzLWtAnc+iOo5z0NeykqqUOdB+OKiR6n7jqL4SRlWLld6eX+ofkfy9p1W5x6pkHt0lAO6rb7xEI3WU4N9a0Q==","shasum":"cc57016c7f030c20fc2f832c115df5cb6a1deb1a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.232.tgz","fileCount":11,"unpackedSize":138888,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgmc6GCRA9TVsSAnZWagAAWfwQAJ+hXbdJ0Bi7JQ1vpdr8\nzUbO4sbJUKYTxyaqEOTrl5nFLb+oGsTAR07rGi+IGY+J+au7PL+V93I2FpQq\nImyzvAsujx3LSJjJBYV9klnlOM3cjAmnv9Va1Db2NhN0/Aibg6QprVkaHDmp\nOh3l8GVwylpECU/a4FU3q+0Eim4Ixy1GF62rMN1nerykbR0+p3yFHzduoHzu\n6bb/YLyQbaNdBahA4v8flkX3qX2NH1BrVk0S/ApcMTB5oTWQe/BKxkQXRqXT\nuSKjp+GaZ2KMtGyAJrMpCuKidAB3aIh+PmOGZ6ovTf/oOqk/MNoyTX8JBKwY\n3jq9cKMu+l/s/fabWngaE77t8ghxMPmzZgWlaMn30zgHRsIbzbZ4Bv6cKmuG\nN8UBj9gH7JKq+dU5i/9mFV7wM7EcDi0YxjHpIckV+VsPy8jGNg487CFbjW28\n6Fyls2brVJFEHQBdOd72zKDNSyXWtCbZtTybC7XdPyRhUqYWxtDvHpnsKAQF\nKh2d7jWUEMjHoBlnSWuY+2xeCYfI//wvKzMmbqpG7iLa4SrDDPXB5tpe6jn3\nLmj8YRTurLovBnexkvPVYJEn9hoKlpnw3knEMGiDj7pjnWEY54Mdcvv9zDZM\npm/St5SJntBA0vkRq5HNqu3YCdxpq4lmUAaxrqqmrM2nRwp7ny78auKbQ32c\nAYzT\r\n=4tml\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC/3dL7Cvm7ClL1ave7T4f23NjH0dAyU+xmRiM+vNR/ZwIgKf8NE/lKPbOnPV1MOMyE1dt49TjNOP8MWczdHZb/9Pw="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.232_1620692613665_0.704654235276859"},"_hasShrinkwrap":false},"0.3.233":{"name":"wgraphbasic","version":"0.3.233","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"stable","wProto":"stable","wCopyable":"stable"},"devDependencies":{"eslint":"7.1.0","wTesting":"stable"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"d03c5c2fcaaf7a46d8f09737ac2736795fc2f1e1","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.233","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-S3MdgdFNHkbIHPwiTbga01TdKRLDlmdnyUthKW0V2G2l1x6btBwBm19FrchJ/jYB4nAxd7MSr3AT6YaYzZWVaw==","shasum":"36829453c8f3cf4b7c429a8c2cf783e1f8057131","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.233.tgz","fileCount":11,"unpackedSize":139113,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgm/tQCRA9TVsSAnZWagAAOPoP/2Qe9dU57Gf+7zU4VVtH\nxnArooPY0bOts7grUnGz7jrTOoVF666/BcRdGDrJRNEw8PVS9d+lgRx0MQHp\njl35maSrypgR3ZQn7EujBaWP+L0iLiGzSg6YjtZyuvjGbhgw1okh940es+cO\nRRnKeVSTJSW9WrdUMlQ9F6v4u0RB8M3IPlHQe8fM1XfLWyaiaT4IXi7pEJPI\nNaJ7dq1BovQnU6uq2wJX+HpQWOCE9zuxOjdTd19w2jG1HWNW+oCTOLiAW9DA\nvpjObtvmQW7Ea7JoyeHynTWjyQs/XJ08pvOd8zk7WV0D0LVl7UFWjjeIgMuY\nR9cPLotVMmcc5anhh+WcKNFi6ZmcgeQwO9ZT2EEVv/TYfXRsD/Y+Z1c1zQ5Y\nSp59XIEfNKMukORm/VsXSFHo9bSIBLggBL28UUH2sLH+/37QiXqEGh9Ud681\ncyfGJOig8aYLzrI5uc1zUKX8wVO6PktR+F0NbMhQmHW3q9c9H7O/yYvHlYME\ndFoCQ+aw+vBrJ3TCDmRy9EsMH30+t0z5GjqvaK5DLwFBELeeuEuY/2WU+aPt\ndX9R2OianLG/NUOR/3jyk+aQxA1NkKeqDkFkfutQPV1+V8D9hOKT0t84EGIg\n7QgotobRZy162nyIAI6PxqFE6P3Nysuu90wFeO/tCx4zsdL9fvQhm/Z490uN\nHTra\r\n=cyLd\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCEnIw5fAzXfNVDPtbv1daQ+s0wmANOqdYvUZ9GqvMNuQIhALZvQ0gcvTqmXZbV/ScBA+qzl3M4vUO5+tRXw0xr10OH"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.233_1620835151613_0.5023919139146997"},"_hasShrinkwrap":false},"0.3.234":{"name":"wgraphbasic","version":"0.3.234","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"stable","wProto":"stable","wCopyable":"stable"},"devDependencies":{"eslint":"7.1.0","wTesting":"stable"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"e393d6dfbb20d93c47dc57e8a09dcf0cf529bf00","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.234","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-wt4dHxTPpheBn5zSLXIURJJIeBkSzJvEL0J41k3S200fyyh6JbMCRRMwaPMNyd5vHYZXJhOnMWeZzTc1N6JNRw==","shasum":"46d153e6cddede455eafa233d87b97a08ec2b9d1","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.234.tgz","fileCount":11,"unpackedSize":139113,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgnXZnCRA9TVsSAnZWagAAFKAP/1137vt4trFCV7HWZkrh\njeXwLiQ3ZP51AbL6ULO+mEArhbfb+7gi3AvR9jZShDChSXOs+2zVhDdywlCc\nUojiZs5TuiStCjSL9JDl0Z7XbD08y0zkca//qDQL622dEfMs0sdMccYfUMI5\nXnCCk7OeNVr56apGuNtldvjhkOOAIGdEF07DJFMRJgYvtG6secshK9piZ+FG\nhEAeP9e6sN2fjK+5MQaCN70LGWoE2YvLqKLChZbuDhAs8bm1n7cJ3Oz8y3rH\nNGXKlEGBkPUU9qqMyV+oqVgsg4LcQOfjFgBHLo4GoAKwMRkXpbKeVHXMGAa8\nM81vPtd7MtkXkyGIXoDYmrzNl+fCUg0uGPQzaMwMzXFuCeaz388izLkvVFhB\nGz6Xxau19yiHr50nH4SdwoErr7BgXEKL7thEBXdzZX4okHyGrWpJtDfoayZZ\nydyoiVYsxUruz4V51m9IVwQsbNKKzo9Kvqzh3XnerYWi1b8DSO75MNPSAJ7L\ncKiznfJPu6PyMSinx7I/JWlEtEFRy4YN4Q8DRKnhK1zm9quO/MpwcxeRzZ/Z\ndpMfcMSZhlALBRxOXBA5sKcwuqR6sCUYxSLyT/wCzNaPhPgDU08bV3ansbgM\nyaDuazZ6Ik/7plwbZL6ufEX0pn18y2oidn+Bzw4ZSSabQWGB9NlC7MQFoMRj\nms/m\r\n=Br6j\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICqxOMesvZyiiEjQGaUFVOUmEuwYvrw0uQmi28gyyapdAiBLfAJUlGiioRNKbpLTV3B2VE1Z/3Ju7ZzcBHoo4l8Dww=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.234_1620932199340_0.7410965644015368"},"_hasShrinkwrap":false},"0.3.235":{"name":"wgraphbasic","version":"0.3.235","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"eslint":"7.1.0","wTesting":"delta"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"5f1d83f90ff16783cd0cd9b1b4a3367e7f691a48","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.235","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-4xTO1KJsBkJPo6oMfMpU6/5MPVTehOuRb6trbB6tl9sl874hj6UZntW5SZb6DwonVGy9oUO9T8t9kaZy6fHikQ==","shasum":"6c4d78b69edf3f1507af71a3d783f320ea43156c","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.235.tgz","fileCount":11,"unpackedSize":139109,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgnohJCRA9TVsSAnZWagAAZw0P/0Y94qxFw7TkZSMYKS2K\nVPMH4BR03d3+/6O2KgG0YIfHF3lbcgwwZiI1qneWpZ5dMKq9uu6ZgPljfU2b\ngw76VsTfPNXSy3ZJZO3McBq79KY5sCBOflVVTAlVgL+n3I4X6gn+ljppAdmz\nxyb+cdCdASqGYgDJj4MA5JXf3bgvUUeCk3eRI2nHqrm615AduXwX8PHAOil7\nbK8NJlS2WnLjgN+0/wj39H6CAVhaHf/6A7Vqi9nqOZGntORGT+MZNhQq92sb\nDCFzn1W06DV4C4oln2LJKC6f0p1LFSuZOFB6NGn6wXgkoMjcMAcu1gk235eL\nlwqYiCLybC9s7tMANuCBy+LhzjgO1lZIilOck7h2j91P3YS6Mz54aygT01Kn\nKPQegah/CjtZ5zwNXfmF/OfYA5Il64e7iJCgdKG2J/qalcAcblgGHQpLk5ZD\nAgz8eX+tE+7sqZeV2ugXYDeVUCrOGqTuPiMH7VXSOjJgzDPuxxYIYzo1lG3h\nmthvkne43qnBJcp0AM9yIPf3/tMABV/WegNUPwFafM3pSJcJ8SA/ZpvUUfQ9\n0pw+Ze7lunvGt3k9hjq31vyowE68PSZowKNiZOzpch1NqwXeMqFkMPgxrR7G\nOgMzoSvG9CvxxY0uEkEGhcpzjQOPOYXTUywuQUdpIzjMRly8EBPwOv7xd6uJ\nEAgf\r\n=N65Q\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICh0G5RQS/hCuxrMIbZ1NaRqC7/r0uXRGvzJ6G/r4DV2AiEAszjm9xXarGkDXjXzQbIrfInhnDS69H23Wd6V2cqU5vQ="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.235_1621002312750_0.9661168833580827"},"_hasShrinkwrap":false},"0.3.236":{"name":"wgraphbasic","version":"0.3.236","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"edf0309500c607d5d8b6cf29d18788f52986b317","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.236","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-ue5lHZkCyprNFXPPaR20mxHqx7f6Mdo59npTNv4FstMJgqL/bXMVZ09rqLzAZsx4LcL7IokqsmAkbuNMhq2iOA==","shasum":"9c4e83cd04e07852a218b9e5aba23d251caffd0f","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.236.tgz","fileCount":11,"unpackedSize":139109,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgpAZzCRA9TVsSAnZWagAAtqIP/07D/Uaki7pyTVzB5v1v\nNLrONfxC2u30a8e4VSeBHUhUh0RuE0C/R1XiUvDPNDxzRqkdq+CF6DyOig9+\nY2ZFeFLSkJNXCble08RARxlaeXVT/0zYIQtJKbJLOZVpfFUY7uAyJZ8fzvy0\nTmAnlwg6i3L10X4n+UZBntgp9EXnZ8wvKmB9IM758qydDIQuwdEOkW6X92Qm\nl/4YIF3XA4mg2GJXtBOpzqf4vpFLDqSaPpXx2n4Mr1Guhk8FMbCwaR5G8PRd\nVm8Dll3LUVFbhlZFd7In361YairDG7Tdr0jmQZSoyDgce/q8/PlQHVslCPrw\nCTbfPBNc54fadN6HZGYtzK+prJMEZZJAnipyoHasYfVJwTAHmMHB4qjKwuCj\n7OwFLBcdX+2R5I+AZv8XyHCAoCTfotv1rMpNyNu3BM78P8TPNIU1zHLwoYZt\npRaDvrUYIujQgcwgkgPbvsG7ob9D3OW89/tHr7KmnV2VlzORZpG2gSMwHcCF\nnJhp+evkMwdVEH0ChncqwfpkYN61ZbJs8tQ+eIyvod4FkwFANP4btlt7SlMY\nIRZpjM4bZEVpH5q26Ftt9/bm7SqNWga1IX9aaPqE+E3mmpcRkW+eFtG0nyFS\nUSQESXPUsIOvccV0YbXXo+14H9D4fMkM84cb1kGugywOLeoG4qzzTld/JRZi\nDyrD\r\n=/wCc\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFmr2GJ8O8dNIizn02XYfHcrweEMdZENrlc++X1Yxkk0AiAO/LqxA8AXDcno2JK/83cr1jtOkDBFyI0l0GsD0m0RPQ=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.236_1621362291215_0.2864864417389934"},"_hasShrinkwrap":false},"0.3.237":{"name":"wgraphbasic","version":"0.3.237","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"957efe8e03d03bf054b5a13c6500b5246fe3e1c4","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.237","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-B37SXfVqwYrYR7lNKXJ0zKAk/PJEKbdPeuTEnAd5ZIWODyzftp5vceg0XH7BpMzkP5b9RsyuvFBgrWzt5SSjow==","shasum":"f28908e2e28ed6001de27226a2ae9bb3ccdfced3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.237.tgz","fileCount":11,"unpackedSize":139109,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgr7QCCRA9TVsSAnZWagAAND0P/28OGk1KOLNSlzDFW2B6\nStLeMQPYSWFRh6JLAtqHQJ/Vvh2VofunjwBPzXenpI+6BqTjdnQLvLgGh+zv\nXAwCHbcBThzzSJK6oZ0Cw4/P0wOoxFAT3QCgwGUDm4JCJ8c15s8ESCDgwFw+\nTXDhtmGvgX8/VB8nZpVrbq8yqdMCZhTgq8ggoScQKK2R9SXzowff8S43ooEw\nxC+gY83bwlgOHOBEB4wmwQ/lPHklwaQtVWrHKCz3IEevEeqYOAjed6xq3EJA\nMinKkhzS5Se98Oy9FYJ8n6OoWI6DqEPamda/rOROdTw59TcGa+ounWlJ7TL9\nNzHuF+bIO+6JTumBSIG+EgNKlMldJjTHYFvKf2Jb/tKFAfSZTFJ7wDRH9BQs\n6j8Vo1VTqYwOQMjggIyNr4jIP+aJV6si++Hc8TZYaF0KG1QO/JfuCLgSojGE\n5l/xTu1bW3IIQ5/ldClHWmTLV5SShmAUaIyg6EhfSqEAlfunca1dPuZ1jFUR\nGuEOFzuLecISuDj0RzAwu0bN09XEQo+0kpSGOxDop143KU552baILkYoY3X1\npQl22e66XQNkEfMRQfbyLluc1q1eUo/rW1S2q0VD8At0ES+1CLazEgefNRKs\nFU1hODCUBe9kWzsRnk1xD0bmAXMIqyETAnq8V6EfLHAaP9b6aPxd89593Vou\nBJp8\r\n=C+mC\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDQBXJrWmcxfl2SfBt2wN3AhOE8dSa1FkjhYzPWcCQd7AIgGdhFgZB4+B3iFWvseihe95c+ZoIpE0CLiDwLVmIwfwo="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.237_1622127618446_0.6258174240333749"},"_hasShrinkwrap":false},"0.3.238":{"name":"wgraphbasic","version":"0.3.238","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"c0a82a39151815daef4c04ed5ae58903bbc0109e","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.238","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-2BepxkEZ6YQup2fGWYNvI2qHFdU98eCyp/+75eZMZNz+bk7GBGbENA5jy7qgnSNb12xDCsYEwriTy3c9ZsR4Pw==","shasum":"60bef7ab1570526ef60a96e29c430292b5013558","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.238.tgz","fileCount":11,"unpackedSize":139133,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgt04YCRA9TVsSAnZWagAAA0sQAJ1A/+vgyf7kGgFLQfen\nPNTHS/V1AuwhP9nWvK+j45/0LXOocWPd4YphBy4ep5/KBV5LHlzT1LXinx3L\ngnbHLtrTxijjfCCbiypGsCRVtnGlIzLF8Yx+SUUFTZizi1g0Uy4KzoR+wmaW\nuPXLp0OtqSG6dRIeKCYY7lVvKJ32xGvqIqsnLYWbmzGiIV1TSGAoTycFkL2e\nSmEHEfh0KeQqB73bMQ20OCIsFVFjd5BmDeZpO9WAHJLY2WJ2OfRbNiiFLQry\nRVzFD65WZ4nmbzWHbBH7VJB2Nph/KqtFvH6Ir0AYLg8UpoQPKnfAqafmIcLl\nahvVmIRSM+jT3GNbVlqzAncsL1sI5jX2wuc3VzSf4Y25JP9tsssA0E+Dt/qm\nw1y59z53x+A414zAWU4iEOMBlRxgrPDwheVCB0oi8nsPfk1NxuZllWA8Mqr9\nnanS7DqAYW6Kmf7nBBDEatcjpeqmOOAWQ6iGBoDz0n+hOJ7CiOC/cJcYflBO\niQhXaq82120vE7v1T/xK2F0rW6husXliIMNLUKqa8uFRIUxt6uNNZ7JpGEC1\nT5lYt0VHf6nb+v98nClU4O9jsuNIOvqQc2SF+M+Oqwe3xZs9ltFk035+RhaZ\npMTwnSe+sDu/vXb4Iq0VDcb5/N2KaJcT7FdTcX+uLuYGS4OUgB13bQmHpnkN\ntD4u\r\n=Jwe4\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCQMEMyWGZ0ABdfyecrvA4Hn/XXU7VcXEmngkAI7dONPQIgc1yAqoJOouPt30NSGSFJXbwPJKN1bSJGL79q1AYDqvk="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.238_1622625815690_0.8850456973443563"},"_hasShrinkwrap":false},"0.3.239":{"name":"wgraphbasic","version":"0.3.239","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"163b7fd01342479e5797784688dbbf5122339eb7","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.239","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-JgAMezqh8Lx4uR0Jcl1H0u9e1HX9ZcZRlY6Hiz3IBrJvkmZ81kuFEyW2hZ2EmxfQNpk7Uud1Ur/s5TrEZoaWyA==","shasum":"d7a178fee9e927f970bf6187f854640fc4f854b8","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.239.tgz","fileCount":11,"unpackedSize":139133,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgvF6MCRA9TVsSAnZWagAAAcsP/izi5LJeCQRoPi9ernJJ\nVBJqfm/GTuyaUiECgYw/UhxTv+WrWkvgBDEYmBQZZbAXW6/e94F+k+WHaM9m\nMuUTDUz8rB59YCvYh/0pF0pV2WKDIwp15Sm7gaBiPebD7BX5kwTvv7JkHVZm\nbV8L/81jiJhzj9H2/1z6+JCtpAp1nC3LfIm27pFJoPs34Hue0dCo10NZmIoD\nk/0sVVJAH/I+Kx8W6xGeIVNL/1c+AFx6w0MakfVDUktrgHfLBXPToxqRl9f0\nEd+9yEkfhwCIVTSALCYv3PO65jUeEvGoVmiLkS1fjMGu3dUfGMLGoiPN+U1T\nW8xZWwecWyudwYfwzdZdpWWpkuVrSOc3IHk5GC7pJPbLPXLSrkWxiZUOsGVb\nj0FESMAr56bbw6EyiVwY0RbziNL0LEQuu3ONzQ6vA4TPRFB9e5vXW86u6YKQ\nrlVrBeegV1UjUUb1t9EAaijmTnOv5wI5IZ2v0BpjDufymB/OybfluR5vAmHV\nT3wgREMFuoDUG9OKRoGVSaTZvh+Ow633gw6//CBYYXjs6NoMm+7aZzgI5/yx\nU7wI0xcshf7D7e5pQdD0v53tvUp9XNYU7vCt6FmisIDJb+Ua9GnI8XVBllwf\nLO38+fbYXz8i6kDxU0rnv05spw88dzEwOxd6v+jbqjWuasjabS7KwUcx4ry5\n23TX\r\n=SDLQ\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDc8c64/jhebphoBIfSPZIjBxh8DCpz4CzE3h7U3aDMeAIhAKZHq5pzXOIloTvzQKABJ/Zh9na6OPPXk/r9E4XCQRmu"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.239_1622957708461_0.43283151059567104"},"_hasShrinkwrap":false},"0.3.240":{"name":"wgraphbasic","version":"0.3.240","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"f2d688cc71dc31d392b6e110a01e6f9e3a5019dc","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.240","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-Thq/jVeAYHo0PZupeOuBPx2HcG8ItdHIZMTZgIcem14QxcLWAjya2gE20T4w43uoEEyX4jS694WiojdnE99Q6g==","shasum":"d0812ecb1cc821e92580dbb28869dfaa21d74f28","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.240.tgz","fileCount":11,"unpackedSize":139435,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgvj1OCRA9TVsSAnZWagAA9LsP/RFv4qC0wnJ7lFZfbg5S\n0aFs+L51Gg2m0Fhic5ATwdkeUf/iFnNHW1ncb41xhuLMYdg+AgnV2Zv5JIwz\nbB2FIblhBRVW22dLnqEaSQ3P0Y3it3ei1Zb69EiXIFPl06FsFEod/Wy6bwqT\n3RJNXiS+LTBShWBB3Phj4AEvvT7G38NvywQxqiTp623LdSPg99kPXVmFQRws\noQBoUGAwarVQu1axW2otP4ydoICEEQze3/u0NQqfFn9VnOrTVgAEepj35lNT\n5EHiCKwfYwjXROzIQc/BSwN6rGlkxvUXts76Gcdwinuz+lh7dsu3E+++Ae2C\n97XW+sv/G5Fb2hLS6TGeyHtdU7lJbpA9YBvGXNJfhQJAJ4RizpYBFmZcQGYC\nXH/wMX9r60+/KMVR61pKVYatNEbGoH6a6SmGk+6T4gpK8TdM+OTEJ/eUyiii\ntI3xICocKXTD+uIyzlE+oYZLg4d21+jeZFySRr3rOpcZqQ/gXw/QSbDgsK/t\ng1Pu35YNo5I7b8KNLCA93ELU2YZq1op/UQcJOImQk1cl1hIJX/ccvZLRWLIQ\nC0MT5G0tn436sutBkBqyTt6ZBQlVWrZkpYrqmpmM15bMYohG7uP1lree4LvU\nf00hcIpSMVF6edOW3gQTq6Df3Full0Xq876Fw428VK5Ekhvt5A+TvxjKasl7\nZBR+\r\n=YSS+\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBLTcHR5anPIJ3IsjJxCqfzTVLkGP0Tf75yckNso9cvZAiA8ADCA4iuCeqhgs4EpODF2dKEYpcR71p+xRvpX/GsOPA=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.240_1623080270845_0.16948726389701507"},"_hasShrinkwrap":false},"0.3.241":{"name":"wgraphbasic","version":"0.3.241","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"bd1636cac12eab49306a32266a974f4bd8cd2a17","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.241","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-E/MK7l4X4RKGl0ZS4LrQvI/GzvZCJy7cpZmLzZQ9ahRZ94fZBND5dS2dwvBUzkADCOnPnZrZCpPRa4ZFQWD/ug==","shasum":"e530703564ab0a3c07ede32cb894c4421ed31426","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.241.tgz","fileCount":11,"unpackedSize":139497,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgwEVhCRA9TVsSAnZWagAA474P/1b6u7HG8E8Xn3yHtTH/\nR+0Ri/UOIwXvdxD+MoylcjJppifkQgDGcVXQXcUgkaVQ3FQlYWjpVedOH29Z\nIl3XGCFrHVf1EvblJDGx127u3LE153i09nZ4qJCV/KEeWSvR2rohHFzHvCUs\nt31IfHM7j1kICxtDFyr7aEbH0O+2ttT1O9aZhuGQfXIkLCxegsfZitc6hmR4\nmEYVVp5KcBkkMst+WZnhSZ+2D45LcqMSXcJvhwn9/wKmKa8P4a/ECV/YRAoX\ndyeAvJYHylkx1el6EAurjheyY5NSBPYh4Yic4rstOyW6StHPgdx6BtN7vOsu\nxZVqJ+IcCCQhhHQLYsAwkRatLYTwZ30mO9rURGUJpbhwhTUVQ0Rfm/V3VtNG\n+OhrnCWj5RtDb0YurlSOfFOQreVA62FmsWKSiB9VYo0FIben4acCZiVqdwbq\nM08oKKnwMkZiWXf20WJLbY/jU2YYrRWbVRj48G+BV8RENV+aVpBTSvFiOoEY\nfLXDNclwHMjnW9180O11MD8ZZKeNTZ67/tqAIxtCB7043Ta5h2nPGYJynKDl\nRVo+nIwqA1+oyN/hExOGGqEKX6aU+7sx4n9uo4molCRdGC40m7JZI4y+PW72\n7w7zD3qtPFX3zDECfjilK5v9QUHvJir1coOuw7lpaaWKIxX6p78mMgbkCOVF\nh/tc\r\n=VjWh\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIFRn5NgS52QUdLxBvX3D/XG6Uc91HGtWaQjMYPXA2ooDAiEAx+QaCTQilaoJ5YctcCpwq9Chgulzn8l01nyv4UTpPuA="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.241_1623213409536_0.41443028383106273"},"_hasShrinkwrap":false},"0.3.242":{"name":"wgraphbasic","version":"0.3.242","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"eslint":"7.1.0","wTesting":"gamma"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"47f97d6696bed571022eb64f3e8ef7d564255aca","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.242","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-Sq3UujXWMIW9GM7O3BxoWf1empd6Tgi1WyE5AL1q0t5bQL9DkXFCbUcEue+c/NjQKALs02sL26YEGxLqbpKNmw==","shasum":"25c5d9c370270b856a1bda1c0544fc87538951af","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.242.tgz","fileCount":11,"unpackedSize":139503,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgy3vbCRA9TVsSAnZWagAAjHAP/ijMspw02rF+Y9/P19sc\nsz3c4dr3QcGyYElqz7UMXc/Stmi9jynqiMb/lF4OBczKrexcWJ9dcaL6FaLu\nN0+y+u+Cj0J5riIF7x7WE2nDeScWar0aKKAjrGeQSbNtfPvTBTpK/bkBD9TQ\nKvRwMnfz5ZDKer/Rqt06tM7hzAB1jpo3dtwM2xvxoZ4X9JoCxRWqWcDxujaI\nyHsAAezKjne16dedPFITWgJ206kYhHYt40e2gP6kNY2Dq7suHf9tPWj4scFc\ndNDNuIDDxrPdXa2cX97yi7l1hBeTJXOMrj5xlHYn5gxSaeLH5zdg45aikYiC\np7ad+ocPhk5Y3x+RF4c4DuaDG71GEa+z3ztl3gb7kFXISR8g+QRSmp4DCe0B\nnauUGbGthbHYY1aHcLC3NL4VQJv7m7jTtoeru4DtGd9Du1R3+YUpQTgbibCR\ngemapfPekpb9DsCyw1Jx30K6zs2ObcikKb4u3yG0k64Bq7lC83dEZCyVdgZI\nBWVPZpX07l1plSaVv+72yuA3ziamowUspg3OPv9nDn4PSnjCDbfTkI0PXghJ\nU84SR2zAtVGiRW2K/E7kOKhmZSxYClw6aKFIRIe3tAWF+FQi1+zRwFimeuNA\n4IEkvCiTH5sB7RkoxyfsCd4tXxeOoCsWCwNnk7J8Bv2X0V8Tpzt+NKbuId9W\nDZto\r\n=GlRg\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGHQt1eayPJuE+JHbzZG06YtT3pYIOqCFVSB7onnGyciAiAhOsGmUqgszduj7Idyz6HbBrYaerH8uuPXJ/bi6eCNwQ=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.242_1623948251029_0.9045152927777349"},"_hasShrinkwrap":false},"0.3.243":{"name":"wgraphbasic","version":"0.3.243","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"wTesting":"gamma","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"b2b6290d5b8ff60019ca0464d6642e17a8e1b9d1","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.243","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-4iom+Y4xka+uzFDqS9dBKEDTRTnVXmgDXikwes+pftCWolNgPOHqEBs6SdtHEy5q0Gbz0PzEWeGEz21Gm3eCGg==","shasum":"5b184f9d2ccb6fef47e9a7b9943b8ad8064709af","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.243.tgz","fileCount":11,"unpackedSize":139534,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJg3VRvCRA9TVsSAnZWagAAx1kP/2gLTBXc9ammzGetp44y\nFm5g20ZOuGJzl4czuD5s9Q1HmPLFqAnDcgZ4wiQFwaqHLmq3e/oW7IhIXJdS\nMcQXxU+w7qXbuWtdW9qAi4er6y2JiXuYYFfrufKMkNy0vII4Pl5s8oaayhKw\ndLwa/p02nl5u4Wz6rKre/0LLKxLYulgQPv/t14r+l5F00BkmmIFGIuNrWUN1\nrAr+Fxz7ofvzMQGfnVvmnEpTPS85jRbqYPI6ukZypYOWS0b7OBqJpa4JPXqa\n02dQdWQXWUIK+t/kcQ/z8nF6gzeag+LJ1jw/4QGpqW88DQ02j8rINKzBhiac\nAc99+E7sjNhnkXhS8fe4Wuyw3MIkjCSA66TIaVcUa3hr80plnpYRe5mKKP9s\npZusah2GHCSzRX2HqXyubqiRe2CiUwTrIISwtPK/Mj719rBpL6j8grHemQ0/\nkWRpaXiqc+6RaJZtrk0keUsfS40OdJzImc6OpaOvGHRU5YK1npf4FGnQxqc6\n8AIUuaM7cyzNVaG6nf4GMSkqq6l3xLzRT+ai6Izux9rigzv0Cfu4GJsijUIx\nNFY0p8igCHZY/Sg6fRqBdpEH2u6yH9DZ49OkBIMnjHNVZLPpkFlbQNjGGzds\nWxcO6Tlfc9YNJMaFkB8UaU4NlUFmjhxKt/oIZqjB4VwohFtWGkXzwucU3MOq\npMKN\r\n=a6YB\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGTNy5Xu1ilvmGK7iWpye6/mWdaWfb8xymUsvH/8PhhAAiA4HoS+6OTiqPeBEkrqzHF/CblvDmse+H+6hpC78ZDZUA=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.243_1625117806698_0.4889217817985898"},"_hasShrinkwrap":false},"0.3.244":{"name":"wgraphbasic","version":"0.3.244","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"stable","wProto":"stable","wCopyable":"stable"},"devDependencies":{"wTesting":"stable","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"53fb208adb1f5721bcecff12b8e19afa5ed6c12c","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.244","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-aSUWPjRA1ierUDSTPR5Zd94tLMx97hlezJUusiLhTRp/yytpHP7qKE1//a+o7ql8iGB7cF6FEMwbCzzUt/PH2w==","shasum":"e4adaac866f79db7cf062479434e20a18aa00e26","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.244.tgz","fileCount":11,"unpackedSize":139538,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJg3sMCCRA9TVsSAnZWagAAJQoP/2MMZ9kkzFE9xurLbD/M\nDK+wl9smMtN7JCf66m+HSENFxf+l+n4NnjrfIAj+vk8loE/74qeveWZs6UEn\nVroEGHIwfHEBPf2xLEDHdO35Lpj4jFMB+9jq3O7rfCaiFhdrf+2CrhcGGYFk\nSGdd2D/sz/Qplt88vNQfToBfRpEGVxOupynF5iJPnC9TVtOTcpNC8wYF3Gms\nM5Obrhsx7s/IsSS8I5bhm5Sb6SgAooHX6WyXAwsSvr/WVnF6BPot83maFdkN\nf6d+QWkykpUykFqJxFkxRUmFTnDPi9WNvCSn8XyCKZLMJFRu56AgVNh0aQtx\nQfriNWcXrq3DcURBH7MMQJDnSqzMsjjHZPHBYc7FEZWV4meKuqD67EJANzKJ\n5K/j/uR5KzKuBuRoC1GWZb0GNfVTeAGRGAYxpsR0ToiGK3znnW08h8q57dM2\nO7gXH7AgWzvDmbnASw7mpkjmmJgucnKFhkao4IyBJRBnrlyu5pO7AeENU4XN\ng4KVu6m8zYgRMF1+425YXeZgYMzMQPmW0pTGDulOSErphWuDbKr/PQY3aNHD\nSfoihwfk10fbov5MIB6drVm3OtvTQJ3sH98j52SYQWaDmeM+bi7BAOT6MAHq\nWJSXBBx3G9ZWcvS9/Lx+XgP7f0H2jMVDJ8m5o/Ucx3fd7d1rHDp4/l1nYf3M\n77Y0\r\n=N8Cp\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDb7nJM1FwQGT8sXnmBcZQK19qmJGsv75p1tHWEPQW2DgIhAJCvOtmSPI6YXk9gs8lKd1hco3CtLNw07JKnk+D486De"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.244_1625211650459_0.5760575746277707"},"_hasShrinkwrap":false},"0.3.245":{"name":"wgraphbasic","version":"0.3.245","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"stable","wProto":"stable","wCopyable":"stable"},"devDependencies":{"wTesting":"stable","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"2a6021e012a67325dc6d58a52bcf23efd55806db","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.245","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-nCL1uqPXSsYYK0QifnvP/ORyv/7y17zA3QFOaL3CGi8qiMsfZ+kwuVXf8Wj4CS3AztDWqG2BtF30tg4iB1Vt0Q==","shasum":"44e1278e63e13b3935a752866e174be57b9ffeff","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.245.tgz","fileCount":11,"unpackedSize":139538,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJg3tQuCRA9TVsSAnZWagAA7I0P/R5la+QvMZseU15RNscV\nzCAvZs3RIOyzqaAE39EVRdW/xkz02BrfwnheXoiJs7riqf/IxhnAecGD7sf/\nfcC/XcT6abPGawqgwCi9Zk16mgNcq+F/wcJQLbVmCPxb2ZnvlvfDb0sNy1/v\nLq/Lgya+sW4w1urerhzCvP47StmGwSoGRtKrTXZ2+W+yf41i7qaErv5PYO7L\nsufTs52AQfMSTYpLY+faVA9o0xKQIk0zheB7ef+zR965Z7RJL0qZtqRWrGUY\ncGgBKIi49C7acqGzWxuXJ7gTnEkvZsSlJc2PH8aU969vIbJZuDLdYU50S4zG\nb1D5gtYY2mgx3RWtx27nzNgonCh0FKc7Hu16in4Fs3PAC55ksSRW8W8MgQHF\n4PCKhe6wU6nn1fPTyhclxBdfB9qzdVKkTjdjtmeZg7FOqmLdRE5rLG5ST+eI\nlADdiIO1es/B0/1HISnVNRG4NQ2zpxse9qaewr2hEJs/DtZc9Mb2SkiiRhsU\n0IFr7kWxlYIcRHH1n222pA5KxV2obGuEL5NtRrQC3gr3GgAuWFt78ApVLrnm\nos0VtgjXi8REGhWv5eS/Sa7aGM3mtLy5Y0uY5OcesBfEDRODB7/fLXgIdGlm\n3NWM87q/pCdLCAIBOwLyq/gHiNoPylATJbZErmQFZEkIyT9/A4Q2JVBIB0w/\nV6/y\r\n=0nBF\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCpeXwoxr9Rrz945btpsTEW4xBgy5RHC6d0tY7EODh1JQIhAN/bAKV3qArQYYnqeLeNWzSbLUupb5sr1Qc8JltOU+9i"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.245_1625216046162_0.6187720244741883"},"_hasShrinkwrap":false},"0.3.246":{"name":"wgraphbasic","version":"0.3.246","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"stable","wProto":"stable","wCopyable":"stable"},"devDependencies":{"wTesting":"stable","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"3d942aee1cbfaae09496ac721d3cf8b3222b06de","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.246","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-mPf7Ys+VWMMM9Rc973XezTEsFnrsKZGFMN6e991dgKvqsA0RZDFIHGtKs0x/eQfoZMmIR/BEfc9WxKI4Fe01Fg==","shasum":"c59cb107eb87e14c9cbc197c3bb63eec12510073","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.246.tgz","fileCount":11,"unpackedSize":139538,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJg4HCACRA9TVsSAnZWagAAKBsQAIVPQiSgjBoE4HjKMMh0\nR4WOKT+Nds06B6d69sMg5mxkQuROYpLVTaMbvEFApzLO9nqwGS7qbvKKHr3S\nZxZfJiv7vpyimGhpXOt418ho6cav4YdfcryZ4J0s0+vW3i6MCm9RC2lXM0zr\nDJRfO1D+sAG94MqUbxCNueTjDnktSiDo9nk4z4i2wRwhVC92OEX6LZexhJV/\n7kjfxHvWJ0RjRlD3MEStMXwiaA/INN7LwA3rTYU9NNwAdAqspCoMqww+9pbh\nn+awfTAzpboJUU07qoAjiCry34yldmeZa9kSkKzzO6f/Qd7HVFRtbSBsw2dk\nFMSL34qGOgYMJVzkfaOaNqDWmjD44YQmFRkMhPLJJ1QltTraXebpgYWxaXOX\nEE5N2z7R58LmFO62M49fc/ps2tyiEFsC4FuxZ+4My0Tkp7Usk2p8AZCPmVe5\n0QR9VcNe217jJ2Jkdv5gdRfsTJ6l67ED59XKu9JcpfikKSj0Jq9GrtZK0lk9\nglaptmGweX4lrBFsdWMZ0b+ztJWC3TugcH1A4jgNNItudn3DjchHftFouMfw\nowINyrHeTXtz+6Owok68Rk1y2CBEt0sEi0lxL8Xakd/cLc3C7eLc8v67EUJZ\nTfXzFyR5DAT2u4DEqXrM3HQtYjhaN7kpiluguO+1N9pWEUzZ2cjy9q7GXQdP\nmjKu\r\n=gsBg\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCjwy7Ml1VMKJofohPvEYsLGlxcPfCG/Cx6PCUw+ij3LQIgUoYFFr3gsAwS8V8QxWSXcAIcyAA9A3rM0GfbQvpZRAw="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.246_1625321599937_0.3651800570252257"},"_hasShrinkwrap":false},"0.3.247":{"name":"wgraphbasic","version":"0.3.247","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"stable","wProto":"stable","wCopyable":"stable"},"devDependencies":{"wTesting":"stable","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"aab0b4f745be07696a1b459663baf8f8b24d7ee5","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.247","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-2jCLT3wN2Lsuyu51oFa5/1KcbyuuUlyozcPm6N8LsWskBLKzYZ10J3se0gqfS3WgjAhkVEknrcjZXWWd7eKrig==","shasum":"47b4593b77113f4db1204a5b56a22808c714ef51","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.247.tgz","fileCount":11,"unpackedSize":139538,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJg4Y/0CRA9TVsSAnZWagAAREEP/ij2Ymx1kvxtgZ6v01i2\nDC/Ww0aMQ3uBiEAxz77MbYBef9OOK6QLyYM+D+DULpMZ0ifZTwl/BhczudEe\nAiE4Hf6S1MbazaYJVUIqX9FLQlcm+Y4TrZ1gj/xUfwd+HQu8LZYOKqPo0a3E\nb1agPSoxYLfL3GFzRwjE7JsqpNNrzqmYNd5RaIvIgDEyaPijcr7YtzELdXnA\nKooTch6KIIAbD2eaaOaakSDzUhKxb0Nne2jKr/bmWalMI92UEIsjQM/45b26\neNk3+xjmIZ0SKkboLxjZdTWwnJA0ClYb9gQ9dhAvDhJDUXPH6p03jJta6fyb\nyidjmZ2XiMi28wjDwUuz53VQcBrQjENEI1hp/AIFl1lOJKAOwbk0J6LPePT1\nZ9sJpCrFvoiaiE2FmmMDbuOx1x5gdJ8bJoAGR5eebmMhm/GvoUbyWEdTLVq9\nu+CFTnQpBjOHHiSh9nJ+s7U78htl8+ZWttjU0l/+X8Tpo1WvaeN0Sgxj4KkZ\nsAy6m2+g/XJcs/x+rJp2ubVGtGl3znHKmM7GxBvtyvw9SPzozeUp7M7Uex9T\nA7AUUr199tARZNeGy/PbuF1fZayUJd4vPJD19Q1s9v2sOx/ifbCmGPxfWFJ4\n698RnCKVuhlmpab44mmNv06UEESLJKhlz3+NfAAq5Q6E1y0TuO6A2K9/J9j/\nPX4E\r\n=67rG\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIAsqpvJBm9TVZ78cA39MaX5VcKhr4qtZVWZ6N6n8Y4ViAiEAwUJmzIMAgzd1xcPjj3yqCPOR1GvfGjySyXLLhOSKBvY="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.247_1625395187755_0.31968658739609945"},"_hasShrinkwrap":false},"0.3.248":{"name":"wgraphbasic","version":"0.3.248","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"stable","wProto":"stable","wCopyable":"stable"},"devDependencies":{"wTesting":"stable","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"007632a2bb6c55ba253985e3aa21eaf39986bca6","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.248","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-FvkaMJwGbl4aZ+GFpGg5BSvp7caYVA2StUhYK86sm6YncsJOPnepNEmlbaTkXmjhMote2Slp3pKtjIsWj+17rw==","shasum":"5e76f2be31213c3723c8570972cc5333995cd787","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.248.tgz","fileCount":11,"unpackedSize":139538,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJg5yfjCRA9TVsSAnZWagAAnegQAIOIO5zsE2yMQMLiSYgw\nKQSX27Zww9nP/B9ubLpfXe4JOi2CpM9330JdFhnFjvi4w8cmlTfjO2x17rxA\nfGCA78BGZW6yJMN1D1qLQJup+CQqdTXSP1qviATYs6OKI0gzloIDPlNdK1Aj\n0THmzPZ/GqG17eECdSANe1dJtyAVfeuY/5+e4lx4RPKD3ej4IC5ZH7V7dHAy\nmLhNuILNA3LApQHMn9T4bu/MdZqvel9i4+hnDeKStyr0/cBuXGQ4hVvm0vwO\ncvm/h5YyKl/CD6gE6+JJ4eaOUjrZo9lleYGlUdsA7lcZRH+KbabovJJbnsHA\n5d0A8vjxCMmMJ1E5iBj0JSlLptP6aI7D36jjBYTOll0/RyWYFvgPM005xAe7\n0gdUg+56wiwReObO7FSgctN97akj/ZhGVvCSde4DOUOiwycmaVZqE++aQiXl\nwgTTTl/xxAgaAzeH+ivBfP158AQzcwNwaA+bJxYqY2FivMaaXAV6T8zrUwHU\ntG+jEzeWJW0adizqUx8QfpLC1f/dTm16hoaumTkseplMuPaGNcNnq0Urr6sb\ni63p9YuoASQDC6Mqyh+wWhyGgB0u81kLdORmBaWMeJ8E6WRYh/myAuyms0+O\nnNswtKy3vsFIZka8y7gPYQIsdIYw8hhcxij9LbbtviYn6cGPjKj39mOmSpLV\n7tkD\r\n=qGvZ\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCYrbVSE+XRz2B020YungCdXV1z0bHprP4ZG4YVMV2Q1AIgb1vFggU11Og48BGBjLsjPs/J9M27ZEHnUPYDYDuMKEI="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.248_1625761763231_0.60204462470881"},"_hasShrinkwrap":false},"0.3.249":{"name":"wgraphbasic","version":"0.3.249","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.1.0"},"keywords":["wTools"],"gitHead":"1492069d23002a56ef622f2e80926a0c36e54d33","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.249","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-noucsUusUr4z0KlTUG4Tr1TAL6WxDnKGF2u3NvH03v6bGM6R6Ey1MHiAiuNdFDR3v0ON/UoJ7m6noLsjNUQMhA==","shasum":"b09176dce22b9b765a2c0faf8fa0eb57b41cee42","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.249.tgz","fileCount":11,"unpackedSize":139538,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJg6eUTCRA9TVsSAnZWagAANakP/ieDJXRDdjqyS027MeEW\n1qlmFVc2iLISrqn0hS0+nobSfuxxhEG5lD4jsWEYd3O53I7wIxhkI4fCR4nb\nnJu5yfOB+XRLy8R4Plsih6jo5Kq5Toit3uyG3LmE1ly8z48VsF2mTc1Fy9Vw\nXkFZXGcDtPZFSXs88qlk93W1djkmGD/tKR2kbWFNKix9JnJfG5qZDGVG0IDt\nUvq8aOIbEvTVV3rwwMGkCl6C2MoWM7xtdN/qoEwsztqorX7v6Ua81hYrInlV\nZheYC2PbCSaqoaDCD9ow2x/I6OHh1hwvn9IRvqjxVZKr6Hp8yNlBmx29TXlZ\nD7+uaMFTbDpUJ5fMpQmfDrUo4++ufE0IQMw0qBViSqPKgD2aP/12Ges//9fH\nGn3XjZcvYLgCjJFYz2D6TK9C2VbFc3Xh0PHxFxJe3IR6E5Zj+sMKTdKLRmL/\nNltS3BVJFt7v1EtsBi4pOnjmdEbwtpUNEAs1mvUrDgHd0yOHu5lGrNOKnPHq\n2NfENKH1qyMoKFTOPaJLTtyQbWb5s6a162GAFv3kwGi9SjC5GTm1wiLURLRN\nEUFdHWo5xEFA5KJWRvHm8ti4UqvBVbulkARL0jRba2lq4UrEW4Qk416ckfN0\n11pj69nDiHzsihYjHOKf6m4/tETMNmVw7e4KCJ/ZlA1KpADjQVrhB39YIAS1\nt8XT\r\n=N/zp\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIA97UxP5T9slD/5vfXO62zMd4ROTX632VzTPgwGEN7z/AiEAp7EPHkTbVhU7pH6mYNhtUTaUaVNQrh/e8maxt/58RlQ="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.249_1625941266846_0.9857745078232096"},"_hasShrinkwrap":false},"0.3.250":{"name":"wgraphbasic","version":"0.3.250","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.1.0"},"keywords":["wTools"],"gitHead":"42362ad488f089cc336614780efddb85007cb8a0","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.250","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-RF4Vh/hCQ46h7Qkt2VKsGkAWH7OrTrzAUPDmMEt4qe+3diOxhqmjQ10GM8vMrh1chTsQTFhas2+HSALhGKZakQ==","shasum":"2210271196f443309d83e3b00c90ae66522c3e0b","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.250.tgz","fileCount":11,"unpackedSize":139538,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJg6xP3CRA9TVsSAnZWagAACucP/1wIaeDg90SUQeSsCdYv\n9RwQmJB9XlRrGzNwEG0tGa0DnWVbbNh4T1FFBFheVO7UQCf8e64H2ZJFsufZ\nOSBluwz3Ou8lcJM5+DqrxXP6EvQahNyde2Hge/ux96VjeSL5XGwUUWhWyG7K\ntQhgc1fzhfxBLi+vGMAdOZBAlFGMoqqWrF/EVwSS0ovJ0oKvIckiT30rJk+m\n1iJoBj/vXPvzSxyHSuzWdDDsb9GY6Lf84zgFEHMbXMqwwAA2J52UVjtenHyZ\nKO/PyqrlrlgMG0CCxtDJjSqis5U4S065qhZp+ZNeoWTj7WoOjgoZPQ/07qi6\nLfr97cmmhB6F38Dcy6SjJDGyMOUNOX60XAaJstb5UxZPU+7G0bboATWBrnGk\nMOPDnhlFhBi14Mi1xab0qAZgdsRh0Zeu3AsJDFh1c0/4PGPsRGAhmNdsCCSb\nyR1VkyNAyBJ5NVCb4SkGIZVsFRaHDvMVbVIn1yN/CNmm2miVqu1FTEhmwl+j\n1d4HKjpompgwJNcc0iT3SFmzO7VDEfx8hmdMx0kl5M1/nBg7/6cZpvkoDggM\nuLKhOemcRTSJemp9lE5zg2+gWBYgP+HGZ3fMy+KzkuMlMXqOihyp5O8jlayg\nhYc6h1AkukeodUzYso1R7eMN2uKpxUbabdhax189yv/5jOGmBWrC7vaRNf7J\nWpaZ\r\n=slBM\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEHmg5eDFUGaYEYHekmpM0tBvQwZG82zAmVqunyS6s08AiB+yJY7i3N8t6LrtR2nI/UgW61O7arADZxeru4u2ySn1g=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.250_1626018806608_0.5707467274335627"},"_hasShrinkwrap":false},"0.3.251":{"name":"wgraphbasic","version":"0.3.251","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"wTesting":"alpha","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"ea43cee32954a33a83fdced89c115603bbfe94bb","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.251","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-UmplACDarf1FARp6VALWsYCz9KL/2eFc6vR8BK3735Jf5/jpKRfsf+q0XbLGnlkBg+p17loscwZ5SkZjXyP1kQ==","shasum":"c794c4be77556faf5c99c509995ac1a2a10ec6b7","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.251.tgz","fileCount":11,"unpackedSize":139534,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhCtPfCRA9TVsSAnZWagAASJkP/2YSJ25kKo2QlM4R/3Yu\n3Hg/Bnxb4NVWKWkqTqAwQFMU2SaaYA2gltD25OKTNjkArhTvwS0Fa6LOsVzW\nQuz3XX2q9SL4uDTglv51A2INTXWrUAJNFkRWF7Q7bmSXDu50AbY3rIh8JcX/\n2JJxP8egS6FlZXzRexbS8/+uj9MpcfHN1qe8zJVxNbcxoco4ChO4dXC+tFlA\nN+AhX0K+or8hL5veK5E1j12UImDE9vEu/xcYsHnvUpOSrZMhURKbuxA1Memm\n1dtpPd1DClK8vEMxNgJ+mOBbbI5jWv3kzrTPbap66dLp+UDxUP72RLCgrZ4v\nt2l30pzsBcaWfwN7pnMYEQ7EB3rmiTNBvBgLssHZwm/ZhtWhraKrqdiOzCW2\nAckMv+qXgmjlcic95CHXpsonNj49VD+HKH6cpeSauFdU9v2RS723j/BaDAGS\nG4wMaXahMTcF4BqCmPGycQo3cSiaIIcwUvf8fQHaqxrw/pGxj6V8zUABA/fB\nkbyPsnoibDwTAY1onumDZMDNJDgswkg+CfTNPObIGrBISRY9cx148Qi7uBmU\nq0HXyY26rdumcGO5vepTPEghnRzKknvok9wAtySYdHKVMdKOEFLKqxR8wIbf\nZaVsK5yIJTM/VE/iiyfhh6dk8kdtg+uCnxr5HpHFYDlkumWfcsDP0gNyDy1H\nJwX5\r\n=Rr5M\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCdS39AX7Pzu5izCb6j5dq/QUpv3jcPJo0gjXT3Eg66PwIgYeNuEfopVqJFIM351K3qGhoZC7Tu2A09OrOy55sFZjQ="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.251_1628099551473_0.6799759012364057"},"_hasShrinkwrap":false},"0.3.252":{"name":"wgraphbasic","version":"0.3.252","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.1.0"},"keywords":["wTools"],"gitHead":"a6ea30801283b1ea4f09968cbe095a9986514164","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.252","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-InNoD/we+1Eow1bzQSRbkS8ww5zvNCHP3kfUTmRlzGfenl/BxoIPo0ghOGzFK0/6nXTyue2bQVTz6uKkc9HKMg==","shasum":"efd5d85a7a7de4f1f9689d23ce7cd3758dd340f3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.252.tgz","fileCount":11,"unpackedSize":139512,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhDAOhCRA9TVsSAnZWagAAs0kP/ienbdnZ5rdE8R9R6DjC\n4GV3F6foGGMhCz5HBXs+2mH9PTV5iyGiJiW0y/uoKDxw/kbxnsuGbbYjMfxB\ngHCd+quTeRRb/VSMUF0Sn7vX5KmuShPk0vZlKKc9XPeDiEcJrMG2Y+3qUne8\nn/Aj+AdSyHk5Ue+RrV31rPcACHE+zMiduy12z37tFQycvAlsnHQDpcqEc37k\ndfFQ7tEGBi68rtjnNjHXTjed97Uu8bR/3TRhLlcG45AoZMnbSPhciCrAM8ik\nyiMKhbnDUUB7lcmhyR3HZi/UMKxf7v/hl95BK7wRlIMs2PNtpYYvDM7+HSNM\nZhiJP9X7RIIxeN+eNV4HBDrwKLODLM/fEtJ+CsvFJEehuluAtj3mzRf/X9EN\nYj3kb/hxlPBGFZdXoxTO8T+tLyuZ7PlboP1iqkAXLLG0dg1uEKg3ZWMhphHR\nDx8H+k13Vd60YDpkatO6aop7y0t0sKXGFCkWc8aq5Nt6G+S7zBKbVPIPJN5f\nKQ2ryDJaWUmy7zzlecHrDQqngQdzeyIvcbvVgite+IBf2lX4iJUDIlR3Wvza\njaMLzYcj+vUZraJnBc7/w88RNmLnBwTem4/+PCygiqyxNgWJz1PNfCYiR4O2\nNu9aODy4eWwW/rErEP1ta2utCVuJR0UMJMfzhoGrtA+o3BeL4Y3dGK9qALgz\nRyMM\r\n=zKkK\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHlEyGO/pobNnprPUYlUBWtmJQ8wyYFQHj1JZIN8HgDEAiBHx2Ekq8i2bIi1QvUoDP+HoGLJ5RH8tzt+sU8tXYCXEg=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.252_1628177313586_0.2688512086671797"},"_hasShrinkwrap":false},"0.3.253":{"name":"wgraphbasic","version":"0.3.253","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"wTesting":"delta","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"074eeb571688b0022de14edad16bb537eb36fa8a","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.253","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-gUulUuZ20IjJ0TrTketv4wY+DXd7OxeotN3Nvz/jzXYkF7P+Y1ld/Gk9e8otQKSdfFuGqg6LjixZMLqdpr95Lg==","shasum":"c6e53fb9f581cf6be1b41cf90b4e263abd7eab7a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.253.tgz","fileCount":11,"unpackedSize":139508,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhDB74CRA9TVsSAnZWagAAnr4P/RuC+fZLoCu0p+i3leGe\njEdx6ztATgMvs1O01DEirKmHKg13RL/8yNvgNAocyVBlFNiSXzZ1ftun7AWJ\nUw9uY+si/exFcO0VhA1bhyWrLMB9gUGg0I6uchlP8BYshvpKcaCEi0+pgaIo\nk/zS1dCfYjtuAR4a8ubGCAFeY9UZFvQhOgAYuogKKDjpMOLExvSiGLR6iiXQ\nEgG9kUnqQ5ztOZ5BmBi9oF4P12QEDJ0la2qz2iuxIYr2ULUd5XosotVPK0L1\n4AYC33qHWkbM7Bz3PZge33mCJ1dZ45tD4nFQGe5BKQ0CnNhKKiq6vzvQDh08\neISMbqEuz2jrp/5F4vPorircwWtYJu5enci5xr/lY/iRShtXcjuZNh4cSWyu\nFMvznuvWtGsO6ShZW6I75fLAfBC2HiepEK8IvSNUm12YlO/Z51AhVxlXMDx2\nBFkE531+R8PA4z4ZlhCantZHpbdYF3UUSN+obGDEowFoIj2BNvrW+3ySVxv8\nq2RGQrazO4OxCz/jpPdn2fUNOaRLDxiMsM8D2+CJ1ksUbrPvhCoEe/is4iTq\nC6Bk6I2tDO8BsCr08y3SCHzb0ILEcy69PRSHnmjv0RSmznPOC8Kocyg13TPv\n4gqhQR3Vx2We3I1nAaGjD4DWDIZi0Crz2VqEX83hDui+lLJDMJx9ICSC7U5d\nSMDg\r\n=qMvG\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC2FgJ3RrA4fR84YZy1N9PycVjNvYUjmpRxrUtTAw7uaQIgeBYUQWRK0F5hhLMTPgKZsEj6smC7ArH1WmxgJy3ljBU="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.253_1628184312675_0.6769844905863982"},"_hasShrinkwrap":false},"0.3.254":{"name":"wgraphbasic","version":"0.3.254","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"wTesting":"delta","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"cfbc9a38a01482b98eb96cd9a63838e8cc21b0c9","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.254","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-5IKs7NR3KXvaNFiRpE53ObPNOOLElGvc7XSb/b5fmferJ2+HeY0d9AjNxMUYN1x4tBK0oIQjRKAybY2ebOwSGA==","shasum":"c53f3b9f91f6ba621cd18f841f028caf1dfd3a58","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.254.tgz","fileCount":11,"unpackedSize":139508,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhE6ywCRA9TVsSAnZWagAAFIgP/23NMfOs6EAU/JwyeCru\n5DG7v4bzFx0GggeTTgLzf8f77mWhI3fXewpLc5u0IuQ4HUTpysAtl6s8kBdE\npnVWbCY+Ro+j5NMnUFawyRXcB+Uv0T1x6UawzCsBbWdAdTcQ9PxnzhnJ25H2\n5b9/3X1VQF0hY0RZMr3UP42EDPKwrf9/hcjwmqIdW5A3mJoSHlEd5v4YqnX9\nQnyxYAfSL6bR9F/N65vfCiX030b0uWC3DuBwVJBDQpD4hg7QaMiwGb9IbPJH\nBB4P/826m/liZd/tuCYZhMQosfNUkIgwqvgkTo5dev2VSOZI/ZUuCYXRfj2b\n2R6Qd/+iHn3HOtBA8bUfX3N8bK0HEeVfoj7QYBHyOdauR8uqGWqjFdAG6Wqs\nK4Tz6VtaRpjWE9QqgeR9IfBMVGv7HZtMNt202jkV+H5aVKzOytS8qcsCK73R\nJ5q3crKB/dxnKaQR5kYNRL6Xth8r6RGA8IzxfT/qzvmUm9v/oQVczW+X4wen\nxVcQlBc24ltAN/hfc+sECmO7UpjwTtZjzFAUBgi1xY/Pg0lVledMnsFmFNn4\n5ZPAnnWRyz62yWj/LDgfjbiMUDoIvg6H/z7ZhbNLtEdfRn+beaA6eyOk5tD0\nhgaDy5E4btEisbICBayEQ72lgOuMd+MX+yljWWaOioJo1HmHa4TzvVsHRvXA\nmuxW\r\n=nbGt\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIGw4XTjbIJTPRt9XCql75Nej3FBE4V5yakEVcshwrvaDAiEA4R8O6teJKZvYaI+ZLk4xvb/imBAkoBvVg3Xh/QJQ8Jw="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.254_1628679344284_0.3484093057381936"},"_hasShrinkwrap":false},"0.3.255":{"name":"wgraphbasic","version":"0.3.255","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"wTesting":"delta","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"0dc435d7ee80bc89b20f94da26b27ae0f2ab1d74","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.255","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-L3HqAcTznfvsCdopN92oluWRlxBFg4a9s0C5SRBrYdrZMbmtnebFnvIoVBTNlW7pUW7mxXEXU+6Zvhu6t1fCHg==","shasum":"215b0a258421f63f54162835e64b74080796363a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.255.tgz","fileCount":11,"unpackedSize":139508,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhFTvcCRA9TVsSAnZWagAAwPUP/RVLpMoL0rqIMDRd1o33\n8SBreF9tszIWmsWk84mwbOxiFPiK5GS0qq/s1PoLlt8tgsdcVbvy1muaCB8J\nHElPOvnpCZYqwJ47s4l3CSdYCiSB+Af01m8SLBSvAm5ImFuB7UgsylSumTrI\nq/L8hb30ilqhWwowkwdYzLZuWBJGrYvpHIuGtNclJA210p+MwmBiPdOtzByW\n8R2wHOugDRw2aX5e8fAAkuXZ9YIBXwQV6iqg824p9NrFOQ9BpuTqjgnuztCj\nXja67YTC14tpvmit4Yt4CluE9D4iHJlT7f26d9qjWJg0jfYdGFSTCfEM+Aax\nM38gYwyCXUKvbyrLiwJ0E12eI/XTU61sbDXF/m3eVjkiIBlsd+HFZDheXWRB\nu08Gs/2WdLScHtoLoztKCZaFx1aq3/yTFU8rL0AgBLKDx5951bc0WW56Xhjm\nF8xhEXISEcodNCG9LR09PzD7GxOCNP0wgbuK0P84Zf2tJemFsqeV+qY8vf76\ngh7gTYrZm/WlydGx5eiSSki7/X+tCBDzConGwOWcKQ6kDhoLdCVAZ7lGhtcf\niI2TFg4BTHm+rBrYQmh0C177/yakyfyTmFvgpcjm4AnNpj5KOuXHcIXijPMf\np3mkvjp/NMwLXEjdao2bK5TSTH1L4KZjjIRGIDXmJf4vn+rS0m4c2q9p8cwi\naDer\r\n=HhBM\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCE8kthO5053b4/PBYVaKISkLIkNwjp+Ol56dRLCfw0zAIgT19Lb/QxOURk7T15HUSNCBWAjxybWhRNFaJeZTMuKmY="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.255_1628781532188_0.19657435021422764"},"_hasShrinkwrap":false},"0.3.256":{"name":"wgraphbasic","version":"0.3.256","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"wTesting":"delta","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"9fb8cd0c317509983dcfc44d4831503f779ea757","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.256","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-UXj8ay8+PDylr6TYCKkD/7oxN24jNaeaJak4eDWMSLB5oueevtUjXIZu7ZR38ihG1Gj9Pn+5DNFYdj34DzQohw==","shasum":"74e6e38b4acb0dde20a7152973fd1d4070f87241","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.256.tgz","fileCount":11,"unpackedSize":139508,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhFnAlCRA9TVsSAnZWagAAi44P/1TtVUXcVxWCZPPYEdMP\nelNuO6cet6vyFPY5PRyo3JvzKANkrysWG8+QDMatN6hGvlLwbKRzhhX6tjuY\ns6jw/RxSuckclR3ZDex/i/VAZS1fd0xQRzL/ZfHPToIOF+v2VkEZAn0pwdX1\n73k2npTwhyVG1QfxGr9I2ECbaJoLGWgmM8cz68aSU9mlw5MrKWi0sISK1WA4\nc+n3stUqzGFyI0RHEHaS+ra2yXcn+i70QdMUwDXrNbt+E2spV/qaOBSGI8cR\nqeJJm7QNfysDhGwqOqv4mntnj3Y0Ni4/1s38WfUM/ImPsbz6JCtijyMKn/vm\nc47IVKHeVccro4KRxRARRNteqBdt7/KCzx8R91rasHHS1lAgPkX/Rseui9PH\nU3Qs3k3wzbl/EVLc/I+j51N2ziiykGk5eWfqy0gHpYBGELmmmRJAL3Tt5/vo\nO15pj74JKfAmMdQnejGyqDxuMaKpu1kT3QsJNPLctI/RtIiLu+EXlSKPNb9A\ncyHs36dcqfwtgHJOk2ODOAuaLEQ3dUE7WWIsyL5PicGd+wB0Xw9yLCVSErVf\nHEcbkZ8j01RgAGmIUZ6UNteCaH+qsu6iF9bh39IqUs6YMe1CYKEAyHKXtrqu\nnVy4/syg0AJul6v0kdSxtp00qVmYMPypZbBNvg9oZ/SVdmeZsNtdv9qOvjeA\nMAHe\r\n=Bp9/\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDupLJNkc27a8n3pvMYTf9rcgXEw/vZ/0p0xhpUXxhELgIhAPrEC3yBSFtO5I+vKL7JCqEkm51bSLzXb3/E10uoxcVi"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.256_1628860452954_0.5130338443309819"},"_hasShrinkwrap":false},"0.3.257":{"name":"wgraphbasic","version":"0.3.257","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"wTesting":"delta","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"a771c925ab923f934043182cb1b6f2930db813f7","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.257","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-Sp+Q3aMK+iuhfvwFNxuSaytMOJmJsaOQKH9bfPJpkTiNtWHF5s7Zad7FMWXUwtjUUAEtXhodaIiaNYq7SazVkQ==","shasum":"e2734db0a84918a297ad873d09e8cb46df48e738","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.257.tgz","fileCount":11,"unpackedSize":139508,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhF3SRCRA9TVsSAnZWagAAYRMP/3+SQFRLX3Ue7zMXECms\ncgvI6z8rzl8fkCa3iy99aHfpZeUa0G3QtU/NmCJu38cntf07m/YpXcjveEf0\nggSHtfcOhNVkcvL+Fu/j1kJ0GOkl5oEwcXsdFD57s/buMYMkG2+ulEvsVRW9\nuqmtMWeJQIGCEsBILeuM1qfZx5QtBX2c4SPcvpYyVrz2O94ltDDD4IApT6e9\nzQGbP7q2CDo/7xzloc0uApndl/Ek9TKJQG7JFYVBDeJI2IA8usNldvZa9jCT\nHfqH7lQ6k2yAnbnNA5Tqin4crsP3Eg+2Y4vJara0Mi1Jlho+yuISsvTk49Pr\nPXf4PWnmzUGZt8yEL7VwNjkvBV5TETinqslslGmHpW2a53KVlspfygkoqIwc\nvOJJgozsnBBAwdXKNLX22/cwEJHtRTLIP4YI9f9wRfBUznSY8qxqWDBJNd/n\nEcVZIxKtE4ZmFqAIjkVlIR3YZCEfENbFWQqi4K11TtoyB1KeetZoCF2s9jT/\nWjDr4aJKUyq2JoO5jfFBxXwqF2GLI0ZVnGUuBpn9UhF9l0MGDN5RhnHGZPUi\neuubCKp1o0Rrhx48FraofgCoZJ95/0ApdzCGeDndcLvNT2Z2SQNwefG038jw\ncuknC94w0jJTb0WAuT+/T4sUbi2mBiGbxX9GKcTYh66EKs2DhLz1bXDIj5an\nq6AO\r\n=ANVh\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIAoNWceq29Pr1BWPLVXTjlYVmvykXhlUI/K+dfrQARShAiBSLP4Zti67mY4toeseckh2So+br1O5f2xPA7eAIL2xrQ=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.257_1628927121784_0.6558508102306642"},"_hasShrinkwrap":false},"0.3.258":{"name":"wgraphbasic","version":"0.3.258","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"wTesting":"delta","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"7d877d787ed8999d5007b965781591d85a25190b","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.258","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-OgEBzwQprQmRVzVVSYI6xiBNIda9GZ1HPxjZgE7nMQXxXoQauv7dPyeoYaiE7oQCR1qx6y9Gj6gr3QJBvgtdKw==","shasum":"09bf0372c842458756abd69d906cffb3801541c6","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.258.tgz","fileCount":11,"unpackedSize":139508,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhOwcQCRA9TVsSAnZWagAAVuQQAJF70zT5OCJKngPLDBsv\nBLbRnuIF6FqGMGS6YbyUZ1PbM1oB/osgO286e6+TdThNDWoOVYYgUlY5Jcin\n5/+GrP8jIvQc/zhQccSYXSckdq78J05Fb007q5yuY4fJn0n+FY5FR6Pi5cwd\nr6git99VzVunqtQaolWtDx1HFG2FFBOXFWxhXGE2OtXcUc60x7kyAhFYz+K6\nExz09P9W9OapKHOv9YYCJcv2Or9OU3J/y/ImNUq3AFS+2YOMhtqOwi4Qg13z\nrtZ7AYU8Fesky/s58815sh0lFe48JhXYqGwfK41LZDA/pKsfKjbDR2t8TOqK\nDZgsEvX5rX8/YZiVBMNDJOPDKRGRMeFNTIbgysSBMdOHJDKsUlGIa4RadaFj\n5wr5bOlc5dri09tkY0xCtJHlPVRixq6TwFdfApsyR4BHCPRSwvHtliGpx0sN\nTAcVA93DRPJybCh3z3kfNjOcD2tZdHTyd45pUFK6fFeKq1okFq4H7oDlBwRL\nsJGy95q5jg5uSPzgXlQkd/giQn5iJ1Dj0mJsT15NPPy9sVuL0AA9JSFjUFHS\ni+a4dDyTVYjGsFg29epLjThipSecNs/mZEi4dQ0kTeb17yqjdoCRpBOiBvdd\nlv0kqz/VJ66x7rCAmaGBQAdU5GX5ktIy8FjVO9csS6Wci3J3BV2ZTaizDW56\ncitq\r\n=us9p\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIC0LECi57PUeDX9vpMrp49709TGoPj3PTnpaE6+ehylBAiEA+9khCaIWnTnPBB3TmF+FkDfagae4dSu3eMGUfGjPhYg="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.258_1631258384189_0.039014553639213245"},"_hasShrinkwrap":false},"0.3.259":{"name":"wgraphbasic","version":"0.3.259","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"wTesting":"gamma","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"a66265323d203e42ceb081501864835c76811e33","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.259","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-wzR2sUQoWf5Qm7066ygH5K64RpZHxWQptuQ6bBIhH2eugB4F98fV/TDHxQtBPeC0mAF4sInaqYUbtkqVOYWg7w==","shasum":"d1d93dfa5e8b168d1c6a71eaefd3e99ec743d941","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.259.tgz","fileCount":11,"unpackedSize":139508,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBTceKZtpa0eHEKp6I7dl7zkqk13g71FbhJ2iDJpsGNUAiEAwHvAJookakD9KEqN08UIh9+LPdD+JzNI9/G3uK0c+W8="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.259_1632872628262_0.6105604144084937"},"_hasShrinkwrap":false},"0.3.260":{"name":"wgraphbasic","version":"0.3.260","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"wTesting":"gamma","eslint":"7.1.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"42d8aea6b6805ca103c71d04215640fc8de08047","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.260","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-d7H1jGN97tFyWFHEbWEP4hFyLingFSfiyP2LPAJ12QfZ28RuE60spl6ns9glLIzKa/zEp7P8oDiINJ4LjzKC+A==","shasum":"c9a5839ec2f6bd8e5a918200f1dd9b4b5d7f3182","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.260.tgz","fileCount":11,"unpackedSize":139508,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIAk7juay8ebt/y5aZ81BzYzvEgz3jVmZhtvP1mjLRuMDAiB6GfCSIawKEhu2qW/qlAqdaV/IJdXz/ht1pFx2NKOlSw=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.260_1634028991744_0.1680850498819879"},"_hasShrinkwrap":false},"0.3.261":{"name":"wgraphbasic","version":"0.3.261","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"wTesting":"gamma","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"7e04da2c862e0a86651674845826d3201c446dfa","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.261","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-0jkyDhzb+ueQUEl9OCZ/9tdt7yl8q5H8SuZuZqJHq0NYmiaFSlhhmih3hnAfM08jgvYXhk+FnLlxqoKDSXyekA==","shasum":"13c354b311606e56389336a412acff5eade0253f","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.261.tgz","fileCount":11,"unpackedSize":139509,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQD0x/74Lqz5J1Bl0AqRk7OkNR5hsUeXgw2Rx3Wm93ELVgIgKRGXGPvjAKzCM4ho0/pMajDUx3XYOfSUuyebPp4sYCc="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.261_1634203209251_0.7643308694180946"},"_hasShrinkwrap":false},"0.3.262":{"name":"wgraphbasic","version":"0.3.262","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"wTesting":"gamma","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"5b5b9cff320b4a12de223f90360908380f4fe505","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.262","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-+rFa0hObVjqDZp1ewdMLtV4agbTVMYTpaEoGnRPOeMJDKJ7/YD6wQfbZL8PEMkpBleaIVt48lIVr84rqinPZfg==","shasum":"2f572f19e99c0e4a8eb307f2d4e851a55b0120cf","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.262.tgz","fileCount":11,"unpackedSize":139523,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIA2psZKW/qWOEzBImFllm1N7i/zNOEqtVj0eeKE4a3hCAiA1ErTeEQXDJiCQ1qFgkiV3ADPcPb1ZRmW0ZpJ69ryrOg=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.262_1634885629760_0.49561870572614675"},"_hasShrinkwrap":false},"0.3.263":{"name":"wgraphbasic","version":"0.3.263","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"wTesting":"gamma","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"4e17f25f31b67db5c922e24666868078fbd094f2","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.263","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-YmYdkPWosmatqVpz+AO7Imnasuyuzk6Cpbz5tmxKXFP4tqZlkI2h+laJmChE/AeuS7ZSlqGu7pJiddijHUs+yQ==","shasum":"cc5d10c82b14ebfed0943ed5a0a6c8bef753d549","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.263.tgz","fileCount":11,"unpackedSize":139523,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDtCdiatm3eNaJp0W/wrXPnQbC+CnvgdjitLDjnxtm1xQIgXoyguZS1DvqfanbeHkOoz9Mi9/PaRvHfe8YbaZM8B9g="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.263_1635492370085_0.6091440057800241"},"_hasShrinkwrap":false},"0.3.264":{"name":"wgraphbasic","version":"0.3.264","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"wTesting":"gamma","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"87cec006d72076d8fca90ce5c9e7a22311e38252","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.264","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-UHxdFOZ/6EwXsF84giuLnEZTpofREPko4L/hTzu4oZiJjN80N02vSplb2iSVQwrFeSuwILbUptjv2RlBktJXoA==","shasum":"d7bb3d2e8410af777b6d9f5df68fa32e32c09ee0","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.264.tgz","fileCount":11,"unpackedSize":139523,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDhEHVYh9qxnb40Kw92ZThTBAOSM/v+gci4ELFdc/xPdAIgEuP5ux1GcypFJF0yWnsD+kD6RMUkXgdisO2TXv99L5I="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.264_1635515924763_0.9727899295462117"},"_hasShrinkwrap":false},"0.3.265":{"name":"wgraphbasic","version":"0.3.265","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"gamma","wProto":"gamma","wCopyable":"gamma"},"devDependencies":{"wTesting":"gamma","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"f855df2f848986faf4ed6c1e238c88e313e4f5d3","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.265","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-Og21fbyl3ELq4oqQtTsODibw15ycZCM+haCJJXPPOjrnDtuIZty+qBcj/xdKNryFWhC/osxx6C69BBigu2qFpg==","shasum":"e41047f2cf5f638750402d301352be966b933891","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.265.tgz","fileCount":11,"unpackedSize":139523,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDbJs3BNaAqUAbEpcqWTHfI9d6vO6u8n9oCt7E3Vp40xwIhAPlrhLa87OiNGKHW/5GzTyzjr5ToPwwj1Qybht5BqatN"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.265_1635591794746_0.4297754522118582"},"_hasShrinkwrap":false},"0.3.266":{"name":"wgraphbasic","version":"0.3.266","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"wTesting":"delta","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"40b33339f950921a49b4c32b8bc71e926335ed9b","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.266","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-8idKdws/SM++Y5+ZGGPPsZe2hJvq/fyF51QFjVF927Zz4tpdK9WydkNhRYvy1CT50MAdo97+5yP3YycW5oHE9A==","shasum":"9a21cad4868708594cfdb1278982625b91afd66e","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.266.tgz","fileCount":11,"unpackedSize":139523,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDt1ahHl4I2KPFqZjMA46dXV09d7ZTDe9Gs14pF9wwnmwIgJHkVZ3VubpxZXHL9+gpLLfKbmiDsgj72dyNvwGBaHWA="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.266_1636469315777_0.6387680671602187"},"_hasShrinkwrap":false},"0.3.267":{"name":"wgraphbasic","version":"0.3.267","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.32.0"},"keywords":["wTools"],"gitHead":"d3735a128bce4d06e860519f4ed63273ddc29853","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.267","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-4sC5UOwZN0xHs9NlJH/0kw6IbZUWdcgpbQatpRhJb8DauhkoxaQwGWU0HxfY0TSOHupwwVXVhIX+cnobiObElw==","shasum":"bdc9d3322f72562149fd9cbb4091e54bc5665db3","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.267.tgz","fileCount":11,"unpackedSize":139527,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHAJCKlBGwfseRg5hfkn8AJCxOIg3ioXdk+uzJuen0N0AiBN94zILqZaJjLq0Bmv1K9W5I7N/7O0bXZVnZj01gJ/uw=="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.267_1636524506414_0.5533639783513624"},"_hasShrinkwrap":false},"0.3.268":{"name":"wgraphbasic","version":"0.3.268","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"wTesting":"alpha","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"da1371c47884f36bfceae661b4249e417bb7c4a2","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.268","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-nvgpIa2pd7W7RqDASz1qZisy4ieUaN8eCwBFLjaEuI1JH3dOTllS0N8zMPF/Wi0o3jcJ0dZ7W5iBjWCQh/YV6A==","shasum":"564c3b3b7ac9c51de515abb325638ee09f90d133","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.268.tgz","fileCount":11,"unpackedSize":139523,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCMpnrAkhsJ1TR2PIAaWdSPDzNm4wnALWwC181IjIiSpAIgW9zVhWLMYT++To9necStLf1Cwqritu9L6pQyg+7uYj4="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.268_1636540355677_0.4301264573414938"},"_hasShrinkwrap":false},"0.3.269":{"name":"wgraphbasic","version":"0.3.269","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wanalen@01.school"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"wTesting":"alpha","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"7e7749c776085fb71485606d37387d1f998c110a","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.269","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-ZTSRqzGOvRZ/Kkdr9pHJ7xCrPfnj1uTXwXwFNyBqf2mGuY8j18B7MJksYJqhkunEXbGpqVDBLTmtDEmn5vXKeg==","shasum":"4a0a7a4e9b4de65fd86c6823043ace34bfda1dae","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.269.tgz","fileCount":11,"unpackedSize":139523,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhndmmCRA9TVsSAnZWagAAOE8P/3clL+Q8sfqKaWNgka37\nkNqCd37drjSDuEcHSMywe78+XQJkoKVp9QqbABT5myn6/NckD0QMQGjioKtC\n9bjLujnqbHFgJZA6f0r5s30g88reATfSD9e8k3qS9dfY4vGviO/fDEbp1aJM\nltbTO2NimaamrTpxVQqtLLCUvt219LQXXtJkm9V3+60y81J8VXq0Aujg8Imh\nx0kRP9Z4Tua7JpcvM+Qa6lW+pr6OoJbgZIivASC+wYQ5w7FQ5WtGa0R/R5wq\nPD4dArx0rQZw0+LitupESpp9iCX+h16jzEqDUJ0vV+3o5rHZEEuDcC1L7U1N\nulxOE57jCjcRVpRTjWwWQ/ZXSsVBJJQMnXRtyH7I/h0yX8vdeWVyryf3ZPJs\nGM9D5Q9rw2UQ17Ezl7Wiv5yB360xpmGi5rFM3u+j3/l69Bkn2Og+s8qwhDMF\nGvucOa9MA+mfxTFQmJXwSJ0+mKzO1jhbL/l+dp7Poa2Z4ANGSkV53QqS/QqH\nHlcl3OfuNfB/lM3obLyabPbXxvUuXqkexSc0mthPvlWbl8ou5OmZWeFUWr7p\nC4BtVb1vjlJkSQo0y0lOHR6YU/Evsl0XIzqe1o+ujgOZofPlD+92aGgMJbZM\nc8ITUYCSlVe0mZpM6BGzQedzFQVZ4dmVvHBOPqOpm115QUseW+WT4pcp1Flp\ndU8O\r\n=raSp\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCUUaetzkQf3llnF1fyGs2zWnvCAQMPJ4iy1yCs6wNrVgIgTnOqBlq7iZZMGroKlWLuUNmtM+PtxvAtPr743eQvUfs="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.269_1637734821915_0.32980227661725237"},"_hasShrinkwrap":false},"0.3.270":{"name":"wgraphbasic","version":"0.3.270","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"wTesting":"alpha","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"1ce36086aecb2a540f5b84b21505b15518d8164d","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.270","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-aDWkhLC4cGtbV/usCRX98TN2quxnaWQsjSufC+0GWMIT0+28u2ZvUn1uawv6PrVW2ztAj+Fd9mX+9G3yGjJCWA==","shasum":"9abc14c949a19a19587a02c29ae58030656e01a4","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.270.tgz","fileCount":11,"unpackedSize":139527,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhpkPVCRA9TVsSAnZWagAA7BgP/Rx/uDZL+Tc1QSBz00mB\nKU3LTHAyqz/hNHyYs37W+sE6XWqqpCq9ZBvIO+Us0UPHNhlSMl5idun79lXz\nEhVnbwQ2cNjkkjxgnaaZ33lfgdBvE5TuoaNzJQCKXUNUmFE9Y8Gz6M5rTp/R\nhLbmI+bCYi6UnQvL2ONedDWA+VNrIJCiPSgOxe8lIlGjufqhnKYCiPA3pBI5\nURrh2/17KdCJ4exC6SjxUTPvtFbgYUmyqxw7X8dusrPyHPa7URNSGxVt2t/t\ndpmg3sfZEmINkYW/nTic7Go6unjMK1ELKJBg1A6gRk5ISASlSC1TkamEZz4H\ncDoIpEet/y9TNuqBL5KYuTmZgjo4mLj+1i9kSSTPDmOUy8EfrLu/T+tNsjNX\nBgCNoMyXU0q7Q6ksIghdVj+/KTRTE5MbgoSbRlRA5q1hlDHL3JAqN09b+OiP\nWCxRSlVjgBQy5tz7VnZ4000oP8DDzrZFSB4BDCpH/zpr0IkoqO4Pd1fZCe1l\nk2Zr/StAxaFN5zU0QgytLuH3wpLTbzIkgVyd15gxo4Z58jMtGN0w17gmStts\nzQq37N5RIfeqoQi8dqhW+EmNinTzTJL+vIKeMq4ZY0x2LHL5Z2YA26Fm+5LW\nFZQk4UJ4Rzb3Qw18ouuMxdfl6jUYMMtTBDHpkDsicy1lcz2BtC8tOIho0nWV\nkwz1\r\n=LrKU\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCnGyGRXhUPnHnBnR/2dT8gxrgEG0bNREDBiyvO0RpqeQIhAItBZRx0HIgJtkTr+d9oq0127cC4Cy0HDlN55H6IoV+V"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.270_1638286293640_0.8457507884522497"},"_hasShrinkwrap":false},"0.3.271":{"name":"wgraphbasic","version":"0.3.271","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"delta","wProto":"delta","wCopyable":"delta"},"devDependencies":{"wTesting":"delta","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"3ca4dcd3179c4b08cf974d5f527118a221efb403","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.271","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-ByrLvupkVk0t4KEeBcNyZLq2OWaiGdEd5ijSv+sbfVI/Av4l3Y+5J5SrrveqDOEEe34CMQXym4aoj7DjLeXj5A==","shasum":"0ae0cce5491b0e002b8f2d2f1e9c5faec2f04626","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.271.tgz","fileCount":11,"unpackedSize":139527,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhvEMGCRA9TVsSAnZWagAA6AwQAJstjOVa1TxdD+Q1kGV2\ncvvWLdUqZCXaP9WOk4WVLeEly2Q7PpU5dKw7kLeuKTCp+fuLVHJxlPgF+Qfe\nCGyULTN4oPyGr8ZntlKIIuKpamoi7/taFuEoVBjsxf5h4dBLK8g+dKXfjiUM\nq1Kl3FgCca93d1+2v+EcWNvasxpXGW8QnFYswSGGCd/FmdWM25mAK8hWjQvG\nOZPziOmLs79i3L7xynoGUkmDcxIDj3CSXOb/sH3wojcqCn+u7yzvvs0aXsXd\nU5vdUMjUUuEeTBFBg2YWVVBcIxN6rU0JZqhKZvt5Ss3nMBDgsHe1pksiK+Hy\nE8ZNKlUTaUzzcOprmieLQjdhUf6iLoei/LtxEYbetdqXvQrftPvAVYVLyNbT\nwd7w//zBbsH4VITQrZgeCCIfJmqA6romyEMoVL02eCtoYoqJZV7fc60FBbOd\nuSN2+ADrf/IkXCZ3UXLxJfuTPlqgLVvEYwwSvx6N/wBOo6O2UIIHDded8GBp\nDbcsZIBeJetoGPkSxIOsC1ExSs96hB2ULdGEyuK6oqmfemUenVcvDBtDZeDB\nWeP/m/lsRIjaV0Nz8zRdiIj9EcKnJ1R6gc/YRCbxrKW1XSxbwAvFLskd1dGk\nG0qbcgSK/XBF2zW8RD1jPWo9znw9rVl9nVqmC+yhLAvAsU7ajcii/JMRY3Ri\nUEL+\r\n=FzcV\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCvGK2/hDz508Dv9IHfhvl3JJXqkkMJ8mwaxUJ29qtFvQIhAJIsFCaBtObEDu/XwkwiDCwUpJoff7cxZrcv7MT4BiZ7"}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.271_1639727877962_0.7477644418370706"},"_hasShrinkwrap":false},"0.3.272":{"name":"wgraphbasic","version":"0.3.272","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"wTesting":"alpha","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"91d565f8a3f7f42cd9665b287cca4a3f8c32de84","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.272","_nodeVersion":"12.9.1","_npmVersion":"6.10.2","dist":{"integrity":"sha512-FKzNNAuHYswJWfK5EPP0Do/fX1xGXsVrFmxWj0iJibeT80XYKO8alzg7oybc9fx809FMtaLqKPeN8JBGbSs0wQ==","shasum":"fbabbaf20b58b9c203e01f44cd77714facb8a05d","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.272.tgz","fileCount":11,"unpackedSize":139527,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhvfbuCRA9TVsSAnZWagAANVUQAIEGXEjYRs2M2xrUt1Hh\nWek5qZjjT/lhlQkK5RVpL2St7Z8Y2rnhH58U1xy3yyVBr4EWNx4n5RuDX1yO\nIlPxOi/FKO5Mn/OEVdYpcTikhxvU3kCvpy4hZHRVP81+x84gU+UDcHI26UwI\ndR5gV/AEfGBTcer9bUq9MilXAwOjkAMqd8+csp7d2ekMhvadnEZTbU/dUKyz\nA+/asuRr5du2s7MaBzFczR5uCx+2XACVYOQH+CyqQTd0lw6gfxFiWKBC2xri\nHMd7kXcaoGsN9BRL4O00lLTlc6dPuJiTjuQZh9B9HmM5fB5hG9a3eXfV7SJF\nfewXUJhBUMs7ixUoQNg/ayUxZeUv1LY4rAqWNa9aspzMvGpcxzInFUIfbjzs\nK1yNhBRh0r66Z4GttOmhEVrK/31LIs9Ip1k3jVmseuYo3lxwGsYyTDvi0DZC\nfrQmyrRekDii59JSf6wZtF23xfgYOF/YUGMybhERCu5o4cN2zPEs7tZvhzRm\nfR7KO5WgFzNRILqxu+q/4TtT7phIrS2b3MdxCFuY7RLVMG7Q284NnJdXEjcS\n8yE4JX0/5rp2LzugRe5W4XGOL7xJchJ/PXBzSBxSeRxH0jqupnlq/9vBRCy5\nZS2u3G2UbIHhRrOyKy/Jjq21XlavPAUKNTl5GfphNsoO6/WoMzeu7+MMnFLv\nKPTE\r\n=nFd2\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIDJcZQwnWIVRZbuQNpVnBzsbZKWBlvli+etTr39iR2SDAiEA1j49Gs6kiG1dQdBv85DZYbR8E6axVka/mWyloTbC/bI="}]},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.272_1639839470064_0.09009315936221385"},"_hasShrinkwrap":false},"0.3.273":{"name":"wgraphbasic","version":"0.3.273","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"wTesting":"alpha","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"5c0adcae092ea66048486e94b10b749850ea65e4","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.273","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-nOKh/O4XERdgLxDIkFw2H+z2pspvWl4ebYTH4zlasar0FKu7f358X1fEe4WqAt/woWkfGiPKAPnFK9EM5D4jCA==","shasum":"d7ae6902c8abd7ddac043381b0c98b1a5b8c006f","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.273.tgz","fileCount":11,"unpackedSize":139527,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICaKODPGTBS2fg+9Q8rGTfhcLqPV4D8ohYPBbhKHBwBfAiEAkCeSws+Gl9dp6xqfE6gZ01dLiQbWb2BqOJeWE0vdPPI="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJicNq7ACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmoZ3g/8C2Z1QlNoEIuT42sQZxua1U43y1NHN1btvsGcOOHyAEej+dcb\r\ntNJbsxMTHYnh1J8KTQcuLIkVtryC1chjJtIkUJSrD63QN7H6o94vPp4sqTLF\r\noQN0h21ag0TS7xw/UEuSnMboFfo8ckK3VxJkWcqEjD6ZjcgOkb0XFgbcEub3\r\nA5ezcWlm5v+7l4vQua0oxPMtUCFK5QC/OODvrJx5+zx4/tX6xmZodZ0OxOIF\r\npUoB/AEwczOnw+t42ufTIiO+Qje/1qtYdABSDoW1IXr1+0LPkOUFEDj/r0oF\r\n2iwaDo75gr/rKdTjh3Fu4guolYwAYh5l/nlnr8R9xaHe79lPg5j51GxI9JNu\r\nc73MGyFy8+qCBWMuJnbyFCp7TO97/KyFHwxrIBrsIiLIMl5ti/vxL+WbIH8X\r\n2A5WdCR6t6sZs4kVu3va31vpipO84A+5i1A91Uj3EpyEnPp7F8AmeDS0P8RZ\r\nA8QF2tw1Lwg7We1kmUoDKucfL3FNLdC2uE8dhVUqSiuc5MKBJfCNBIoR8n8P\r\nloDuSHN5sTTsroq1l2QfQVJYsGRkMcUIfVpb/X3HSkQaJa4RT+kzEP9SIFj5\r\nGjNRJFUT/AE66GREZu4vISiUfR8WJm/TQBXb5niPuldKDPT5bwxjo5uF2nGX\r\nlAVuhnfLdqRPaPifn6R8hMhH8bZbp08A13I=\r\n=8YYt\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.273_1651563195765_0.9515296722586182"},"_hasShrinkwrap":false},"0.3.274":{"name":"wgraphbasic","version":"0.3.274","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"wTesting":"alpha","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"64e5fb95e01fbb261b7385a29a168fe644234566","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.274","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-4m7kGaDUWzTXSV/MkjyigX73bciS3k9l4yLKxClSD2EYIGsogUwZqoJ+zitpQ3qWfpfMA7OQisHjMTE+NvVTng==","shasum":"ffc58c458c726b9e5ef816afbf5c891228f786f9","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.274.tgz","fileCount":11,"unpackedSize":139527,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIAssBbWKTESyU/BK5mbrsVlbmlU2qQJSf5K0104IC/V7AiEA9R4933YRVscUoJ3sED/1sEi+ggY5mAzLGyt/WMxGV2s="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJicRi3ACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmrJLw/8Dryg01nMKO5AN7gBgEUPDCB3WcpSiSsvK8p+IOmmLyuj2O4H\r\nZGAnhX+a6DJwdmUWoTZ23iK3W4A+lqsjM1XepjCnKSKcODbirTeWxZ4bHgGT\r\nQfiyqZ1nRP9oBDKqLxH1jhUAd4lkKcjcHzLDe16Uon4pB9c8rGoGJqOQNkRo\r\npG+aFnYQuALrOTenT015nceQd7cWDsDI0UzRJOkxxCia6WtfUlck8gdcvuyW\r\nOBNFr710MRxBsH/v8w15kpATaMNvF02tqLNgA9K/wmQRSJLqZUSt0y/RLkrb\r\nrHxrP8onMtCpCrdpHVCrkelksWmNepa0E/1GoioSdsANeql/A6phOQhyPlSy\r\n7pYsnWzkkZ/TyUVFKMHFK+5XIECG3rykr/+33GUTgauwS5wV6bTBM7dQwISI\r\nNYk4E/qMmBm3Wyy/H7nvaPblpKiGYDTWbQy1ejxOhO6DRsPS8zYNejZP5SuK\r\n0UtZ1xdH+vfe0Is7xYfXEtDPbsmZmaHmoF60mLfyQ6oGarFIy5i8u9AbJFoV\r\n8eu5BRb+GhiTuIGN4qunak8Abq2DhJCTnc8Y0MFUpdeiNpJ3Pk8ckVcQMGdg\r\n2EqWBo1b4/ci+m08TCcyOO7ZfiVCTvFuLqyXAusqYcEwhCXpEQQZKn69/4mJ\r\nCCS2+KUMpHBZJbES5ldL/wD6DIrJBdrQIOc=\r\n=KRpw\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.274_1651579063024_0.8960836700120633"},"_hasShrinkwrap":false},"0.3.275":{"name":"wgraphbasic","version":"0.3.275","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"wTesting":"alpha","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"cedaedba11b96d897be2b2c3593c08fbe79df3b6","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.275","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-jW7x/HCgkfs4WjQ0wvBmLVO6S7sY3bBmG0ZidZfyNrgNA3lhAUwOXtHQKtiIHApkXjeH6l9t1f+QM0r966VVUA==","shasum":"b93657ff07cf8045236222f5c09e4bb6254154b4","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.275.tgz","fileCount":11,"unpackedSize":139527,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC98TGPmRrFlPVWjU5wpkzTEbwKCuOj7wtIv42Y5pnNfQIgPjyoP7yhn/MOg1muEqrgxqrb/0wOIUQXiMrx8xw7NH4="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJic5WGACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmoXeQ/+LmN9KIPI0nPkjj6I5diSgf++1p9BbD5++g60P2AkWBxvP97S\r\nS3xJiucQUtbEMn1TEQtZiWH2rj2qmXtk5BS2+fApDlY8sbjScp1+7dqjS+s1\r\njI+ZotGbHpY9OMx9tW54qgZa6mjVlfe3XXXavb/93+b1ijtZr/Dy2QnIYVzS\r\n73j01tWPFjgUzgtACTDqPXJSHmHrdu3OU7RQV3Swdylxx1xBGpsYcBsUlybC\r\nG1V/gvnUvqBpH6zgoVJHadf4+cNA+AD8/Znl3tuLmX7plqJfKHLjuLO9T64Z\r\nm6UqqEDZojc/flQ/h/0+Wcq5QNiZ6Aai1eftATPRCeCRPhW5kptxiZx0RzVW\r\nUhhYx6cE7J++RCSxUJbADHStjG73lMYCTOFX85br1zPWXUqzJ+IHQuaMwlgZ\r\nidClEQCTEWKP2SQgJG0iL8hDdZW+x60LorSQsmdk5Euce3M0jmGgNgX93rDs\r\nnaGt3Ub4Bx1Zz/8nyPf/4MOVYCsYM+yH7js3iSMWIYt03RTUl64X/b7XjfE5\r\nB+Fka9gs0jBeEIO1U7L1Tjbhv44agra+ZTs9agKzsyB7QWqy10rb+yDT37Kc\r\nxl8mCk39Yg9Rt/MS1MgXOLi7WCYLSqujK9m1kiSDfrS6mas8R9j7hb/XdFZI\r\nF8739JrYHqw0MA7M7z2+H52KV8cMiHSAhNU=\r\n=ueLo\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.275_1651742086265_0.07936313895886737"},"_hasShrinkwrap":false},"0.3.276":{"name":"wgraphbasic","version":"0.3.276","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"wTesting":"alpha","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"ecdbac489a74d5e6db95eb1ffad4f226c1da08a6","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.276","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-WMvfkJGD2aa9s6ybbiFrcFD72RToaVGEdiadpPTYky9Sp3ct/3Q+GQ2EoYahKUPO1TLof/jkVjJblX7pXOSHBw==","shasum":"4b6007c0d685404695677b2f0e00317f4759d0b9","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.276.tgz","fileCount":11,"unpackedSize":139527,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICMaOnfjkBXzMlQ7LUGr1d0zrSXHfY3yaUAU0uU1fdVOAiEAjJ3ai59ooyQ2TeRswSYWo+KdGX5pFtWKEr/7AICjtWk="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJidShXACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmrVng/+KlNKY6RhI9Zo+glC7HivGfgfjwVegKKPrM/HNySQ/tL02cVD\r\nTnPTqK8XRbVKYfvQJaa0PF88YhS52nEm0ChA0wJAyLNPKVvpv4ahs3XJqdvE\r\n9S+WawGuQM1/zMFHyLeV0PYU8S1NYylKnWAQn2GQKXy0duQBq+guWFCemGtI\r\niif1Jf5+4fB+er7yGGCXUQ4fWYTk4529Mn7ufGB3cf7+1DyTwYUeS0FxdzuY\r\ncoQwfZTWaO4RB868FYhbf6cepjDuPrYEp3/wkniT7905nmEp5hynNas5Oc5q\r\nlLSGOHBR8UYZbXoZImmZ0WU6LTf6pgvecPoTW5RCwpT94yR2m+blt4oDn07z\r\nf6l+7hGay9OnAy7HylVWCOhgNYfeSgtY3mM9Kb0mZCQLzZWRPeH2CjMGucB2\r\n3WdqzHICAXxdDikPWuRMEmAn8RaUImMMs3TF3V9Coiz4XD/Vr4bHG5Lc91Zm\r\nUQ7pxIGu6EbkYQFsphsIpEE5I/uxyzf0Nh5Y5SiXeptzlzXEZaadduRnM8UQ\r\nsqu9j0qzLlVjOQ68NJt/cjHX7pEnKONVjyu4nC9a2T1+B9N+6B3XBQAezAfa\r\nj7gXUTzh8fbER2jta7igF6/5DITAqWGn8ihDfW1MLhGoMIlVbEhJdOgwb0fA\r\no6HxfPqaNDPV671pHNLyaGrD64/wJhdQHq8=\r\n=LrVm\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.276_1651845207406_0.056648551029187866"},"_hasShrinkwrap":false},"0.3.277":{"name":"wgraphbasic","version":"0.3.277","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"wTesting":"alpha","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"acce97c8f988d6121609a36088e1524b4e41b029","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.277","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-jt88usFf2Bun28DVv8ruAf2B8VB8BctPvjbnzr3/vwEMW9FUEII0P4P1RdfA4JkbwlD4ClW0yRTCAYwxB/FK9w==","shasum":"a2d7914a6a97e54407de4ce8cf89f06b994524e9","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.277.tgz","fileCount":11,"unpackedSize":139527,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIDwOPXgC4lZ+2MCcM3YWGkI0E63qTssW4HBG6aOi8zHDAiEApKRz+xIuTiu5F0IuH10h+d/A9/eAD56NcfGvb7F/b7s="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJidYJlACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmqTBQ/9FVPrF4AmTcmJtR+rmAxPhZbZHOpexquvmSZWqnIZZQleiddg\r\ng9C2LFtmRr7QzDH9S6uwv9KtnIFmLC7izpyWIJBED8bZVDxlSiVscnrAYQPv\r\nr58OoS01QLYMmAzS3Em6WLeLsW4m4PqNkhPn1Qd7adldlYTuPamWmBKSpfxp\r\niTbGVI0FAjopryNUZ7MkRRYvkRXrZxf8/vep4+NTS2Vi8uJytF5Scrd270yf\r\np1PVMCMJ0qRZzoWTi6kcksZzdo774Mye+KISh1lzjSpl9bm4MnASWHLz+dG/\r\nhvfmYC6IngW9F2qsQRm+vxWI/Glj4t1xEbGyBMBFrJV20PsMx2cA530kBMCm\r\nVXo33sDuhTfumA2wM40l/5TBVgw0I+G+/5OSWmeDpTAvdO/Dqr/1HdgyW9Vf\r\ncVbFnABRKNxYQQ5jHNuBroCgvU3QhdgEhodxTp0JIGBEmDMHEqiQY3HvR+yh\r\n/D/iWq6HS5XzgPLtQ4lmOpHdlEkMxuLGVkM57Lc/BgimbQu8RNborHk/hNSB\r\n4JelyVTrt6ziU4dFiHoi5JYsp4BjAoGyRXR7PGg1+By8P+NpJ6WiLZrFcIn/\r\njeeReehQ3O4lKfoji1nS7shdxxjrjVk54q3zubvHCpGXSEAfVuIrFsNrXUSi\r\ndHm4SHOisEmpRxTzoAw3n2wCkoeWWzSvnZQ=\r\n=VwH0\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.277_1651868260872_0.9863523817608932"},"_hasShrinkwrap":false},"0.3.278":{"name":"wgraphbasic","version":"0.3.278","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"alpha","wProto":"alpha","wCopyable":"alpha"},"devDependencies":{"wTesting":"alpha","eslint":"7.32.0"},"keywords":["wTools"],"readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","gitHead":"283cb83c7e8149acd6f7e6071b10556ad05e2ac1","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.278","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-utrtr10vwGr9gVSrM25F8LQ7oSZ2HEUudoEQs3mQpp3mkSp+84QocewAbvD+eI7wRHh247prDh6eEinRvm7dSg==","shasum":"41ca8c9c3b1bf235b08aeca4a9b82fa684e34daf","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.278.tgz","fileCount":11,"unpackedSize":139527,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCY9fsNvSpWdMOA9WLejTmJCE+j2LCjvJ48GRZV87r1VwIgSBaSMiWf/8u19jLQxQZM4uwGNldvQJ3nxOICgDzX7qs="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiehuXACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmpzuA//Y9oDUYyRbxhceWoBIfGZ92U+aXwka/+QpJZhx/aa6uZTRFB/\r\nLJ+2As3HjiJEhpcq/Fh/OFSJt5OeYEEntHJ6lF1SCQHehNq32v5btgSbU9lg\r\n53q76zVQz9qN4CkizEo+O2GFdTZkDhBt30f/k3zhX7wfZTniF3cJUwYX7ym6\r\nTAMhDptzXeXKxjaJCaR0QVG4A97uAchjvI6/Gf4eWn6bRVwe1J+81+iAE6BQ\r\n5dtf/gzSviiGSNrPTMKxZk9YOAhiKUQEDIug4Q/NnW+5HZ3QGlDsiSLucMdM\r\n54JI7DjMEDmV3NbelhTeHVHfnp+wknI6TFDhkWdiUOau3xqcA3jvVn0cHhiA\r\niaxde8Ov4Hm+YLtdUyoNWBWDpKzXIdI+MYcZgULBcX1vl/oicykR7oPFgUyx\r\nCVXl/+FFfpEP7MCOHkTEipHNRw9EbENdhPJoaA/0X99iBVr2T1My0q5mZi6l\r\nrJrX9L4Rqktjyp3GIc471UXOAIPWfJug7Qb/DBf+YCcN72MIstBlkT3BTxcx\r\nNMQfK7QjtGS8cVecUVB/BcLL39yHuVxETQoxSEjTDfVAqEU0i2bBZQE1KTfP\r\nNLNVqIBeA4xI37Yso2goONh4BhMbAchmd8qxK7Mu7IO5lc1hrhSl5/0dLXWd\r\nJGPCIT5HtDskoaL2k+9ZyxPTUtXPcv9ls18=\r\n=Aoqs\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.278_1652169623697_0.705142644889639"},"_hasShrinkwrap":false},"0.3.279":{"name":"wgraphbasic","version":"0.3.279","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.32.0"},"keywords":["wTools"],"gitHead":"81459f6ee5f03be64de0e3fcc703cdd6fd50ea70","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.279","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-yc3hA0x6HON5KLVCVQt/GTDi7ZRlFeVfVn3RF++OUvLaJjjsizzXYuzVvrJAIukELtI9c8e1vR457IoF5mBIbw==","shasum":"18f5b4a01eaf44e3634be4996afbc4b4f8acc4c7","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.279.tgz","fileCount":11,"unpackedSize":139531,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDzYHIgV3zg/OxiPgu5pka6hF7ycuZTBcUzXrRfDQtMXAIhANaVHlIbS4NV0zZGbGwvxCXq5F0hG1swImVRG0NLOZN8"}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJifMHXACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2Vmpt/Q/8D3n8jdkzVSdMdWpOhSDa1ZkUb3RQ9OwTgMsFefbtUdwT92To\r\nDUbMt9TLMiL3bqHqmKNfBTdavnMUugEyU8xdGe7YGdZF9mGXO832MZI5EJTo\r\nEQBI1180x8KD9bNgdOkPaDTUpDLSuRvwFW098h+xKm12Xlzit5OhdtdD2OsL\r\nSRcR7CANCKEMEozeQlccoJgFbZI8iogCOkcT/nfMhT98LUDZVzgZxfhNq07m\r\nvesCEoQ5igU3mE03N+l0jNKg84g2TMml2E8/a1DLrjQIc+DTUqVO3+CrS3Fp\r\nH54nBt9G6TLWm8ST7OiOSQVuQmCWpx26jxPQqAwsVEYNeUpR4Sc5JxLyAJJq\r\nhdRi8N2AxCvKU+YPaqDhiOkyVfXDVTDFahhZmQQEc5336MoChWHZ3nBNLTcD\r\nMGX0DLxtupCYmJeGByIYSYruEDEWYdqkaa0GXlHHar+j2MOjJRjqF7Fhom0f\r\nB5NCbxoNSRMA88dnTxSCFQ+y15nwd677mTsKwaGSe5MDh3HWjN7BYfYObiZL\r\nJtg7KaijKa62QmxxB7dXmxxVMKWg8aec134N1wWBVd+Jo9ijCvC1s4Yp0b7U\r\nTwFHeKRER/fHjnGxGWZ5TW6ixp2rhWrIv1awjaHkMtBvUEfZPWLna/+XOuAn\r\nX/Et6SZWE7EcI1m8nJe3rrdna2Qsdf4m4YU=\r\n=Em3O\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.279_1652343255546_0.4815090004905902"},"_hasShrinkwrap":false},"0.3.280":{"name":"wgraphbasic","version":"0.3.280","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.32.0"},"keywords":["wTools"],"gitHead":"26795b9ccf0bc96f1ca490f80f89e6a3fd1d56e4","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.280","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-yq+sfTw7F5Lfj21D7PXk3UlZ601JdIdWBdvQx4T8HAzmsTYgpbHIwfkz93hC7VVmQZ2BdzyBPUBq8isWaqoM+w==","shasum":"8869df511a3c7c6172dc6fc56c9ed37810242637","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.280.tgz","fileCount":11,"unpackedSize":139532,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDA9bx7mRIeQT4W1J8AUlylMhNVIOcUnhkpUWPobulivgIhAPBiz2pcG5/JC9SPDL0GyKSzhPgumgMQ/0oHJy/TG7p1"}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJifi7dACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmqA4g//QCeIVFtSzCnWM5sd6pcMKcGhPv0cZeaYIhNZbs8fOE5PSFka\r\nIYIqT2YGEnBPwQS/474xnWYl0+x3vCS5aN/sp2t+rMo1LAshOpDtYR71aWkC\r\nKc0nIzpdb4fcASduJDsJEb4w/A+da82weu3yhc2MeDVmWlAliiLoxBhFYg4Y\r\nl6ogtCVvroh2h44oxs0tWyuaVW8zqH1EMZxxnC/pKmguWxvQ8sqrFwnU0Gu2\r\ny2nYx8SRwsz2zJwvor9XLS+koqK/5VWqhYu4uN/j7/jQ1whyxrfdMvix/TjS\r\no5FQ6sSNJRvaT4JqvWjJaSa/iYJiXf2oOE+xiE6uiOVzbX8tjDZNrCNK+TzM\r\nOH312LtZtZhbufokvwjtrspisNIHHRktK1l223VKn76Yp8Z0a9kFQzSxDtft\r\nnhoFUuXPtAEnNuEnK4WTdqj9tDspA3DhwsON9qkFGrphdYcZ5hTYnNPqLtaf\r\nAq9b5/R08m/huNJ7WML45xO6ht4rU/YhtaUt47W7kMVHTmiwEWmCOUXHeLLz\r\n8hQPzHvTm+mZLBaNc5ZZKf7010klQ5LIBaMvyfEN8DkEX9GFl8+xvn4F5nP7\r\noeVqQgQmWsu/Q1G1zX2pY+g3aXKPox6DdjKgKm0gx4xzPKli2RmviYjXU6Pz\r\n7DV+De3fskRK45IH+5gViTFeh003M7aW278=\r\n=wkRL\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.280_1652436701322_0.6544353644628955"},"_hasShrinkwrap":false},"0.3.281":{"name":"wgraphbasic","version":"0.3.281","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wgraphbasic.git"},"bugs":{"url":"https://github.com/Wandalen/wgraphbasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.32.0"},"keywords":["wTools"],"gitHead":"9ca1e4e9d2c30318e5906bb8f949b68e112a11c0","homepage":"https://github.com/Wandalen/wgraphbasic#readme","_id":"wgraphbasic@0.3.281","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-cnhlIMZOEm6LkEB60uTK48uObWKL6phuT/rC85jfXwPyUvWgzOIzu3JEPBlS0BZcdJNQyqWOhN8vAAbuz5eO9Q==","shasum":"985eefabfdf89d862ed7a9afc76557f26b296515","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.281.tgz","fileCount":11,"unpackedSize":139532,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFQ+ZwBbD7nep5XO+Dc9IReCBQF95WMNbEiU4QW6gTZHAiAPFeeIZZ+ZUDTbS6Iuv/1+afxhqvNpalTaxf7KT+keZg=="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJihJNMACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmpFmg/+LSssszTYTGSwH29DIQom7M1fMaBIcisSckwTFEaHuVNqRuLB\r\nNrXHxrW14EVAaASt2KJ4LFq+bnFB+B1mtkl3nC8rEKDxT0XSPFpdYKyzdDpq\r\nrF8Dpu3ofPPW3EhaI+QmCA29iCsHTJh3WxybwJ6+VEBFzoJGXkbJQW6uxXAM\r\nDO7fa3vb/R8lRDkvlakfnm9Oqtw0EF/XVRkdkTAr7DfLikNh7yoG9jvTu+1/\r\ny8HpcuyyVPO+/N3DHIIcZ2FaevdK07KU8SrhYqHOavNoNBzAQw8v6z4Z8zTu\r\nh4cvYslCGvNZfegYm1oJ/c4BCHcwFpvDXlCBmXxx3HbU7Fd0ct6GBJNtGDZs\r\n1R7IsyOpMfm0bapGAxN6xFndcdsFVXbCubRbCRMPGDGWdCCRITee2Kd7R+3i\r\nyArtoZ6votfk8vbrvpx1A6GzTirsxuL49RXwI844dYwLquNWGgOwqysMCXLO\r\ndGYYbaIK/MTK2+oWUEn8wGmHwEalzUwMpU2bUdfAL37vLwwRoiT5UqVgCe/z\r\nZg2vKfkh0KhKCOcIrQfNVpK7ddXYk3Lw2IXP4uGcYFrw2kTZRkgoHxJ/+a3X\r\nd6bGlFjh61tqFJofSzqkSJsPwFWV+7USSeKc7AHlmshb6mvJsWQiRJRNxC3I\r\nifobhwUaEtU8PQzS72W7h9YrGRS/zwUI4YM=\r\n=qXcC\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.281_1652855628785_0.8850279933133189"},"_hasShrinkwrap":false},"0.3.282":{"name":"wgraphbasic","version":"0.3.282","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"contributors":[{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},{"name":"Volodymyr M.","email":"volodymyr.migdal@gmail.com"},{"name":"Dmytro Kryvoruchko","email":"dm.vict.kr@gmail.com"}],"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.32.0"},"keywords":["wTools"],"gitHead":"9cb569414efd451dabbc915f5b3c37f896c5b2ff","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.282","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-y6ctbmXtvAZYnd7CuivgBUn+I1J6XYNUlwPiJNp2G4eMlX4ondnTCxEQ3Z4vZ9ZdKCbCypO6vsNQ4gI3mahaKQ==","shasum":"cfa3b329a5b8969ded16a46a7b3732dc9c4e4e5e","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.282.tgz","fileCount":11,"unpackedSize":139705,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIDlzTGJFtXFTcywYtvIrEXIkw/GMSWSBiK7/O4/EIEMZAiEAompFv1gnQumLoMl9Wg/1MWMErNl+u7eH2HbU31qtSN4="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJihOnNACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2Vmqd7w/+OVBtsm+kxK2X8B34mybV2dnzk7eHTTHrS1VkIeXcVcSzcd7p\r\ng4siDbuOLXgWuZhgNSWhIsPMESK2yO1JNAR/2BlTM/TVKWdPlVa//dFNlhLh\r\nRY0fntn9f//yt7wSj/s8/FP09ezEgmm7gKqOzxAkKOqtwSXpWY3bTuBGCyWc\r\nGgICdTut42eAsKv/GGt9ydZbHODEMoSDedplPxkQL2brqqk1aNeuTlcLYEoI\r\nsx5lQFtGt95BCIsn2whYVJ1StvH3NyySu3VJ29k3Xd1FmSRdO3W4yWGID1Tk\r\nsgNSzzRJ8927iswrVhuF9bHkmpRR7zweQwUCZCh4Ws7quSWi1EdD6ErPIXkj\r\nd9Y1X58BbeaY/6L12GCtSoRlPtZ4DnDGL+1eeU3Nh0wjIImd+WkjmzR8Q+8L\r\nimfjvhN3JsDD0BY9cRTHYAYFTmKS5IEziWg6ZnULvrXqoMJirZCoIOwsfQOC\r\nPfs2hKwSdD6dtsFIYaVNi1BVoiIERPG34kQeiStIf5mOt1fk4xNH8cm6sTkE\r\nOsvkIFLRkzCU3Xii/2UMqLY6v+hCdUGgPMPCJJi4H8T5IMwTyTbKni1kcdBm\r\nel8PSgk6xTp7excWfvGsDelDoU/kECMXUU4b6PSX384+TTru/lCn6XX6RLAv\r\nzIcVZOpPVbMim+8SZ5WZywo9od/gz8Mrg6Q=\r\n=+vpi\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"wandalen@01.school"},"directories":{},"maintainers":[{"name":"wandalen","email":"wandalen@01.school"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.282_1652877773602_0.09952708015291933"},"_hasShrinkwrap":false},"0.3.283":{"name":"wgraphbasic","version":"0.3.283","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"contributors":[{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},{"name":"Volodymyr M.","email":"volodymyr.migdal@gmail.com"},{"name":"Dmytro Kryvoruchko","email":"dm.vict.kr@gmail.com"}],"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.32.0"},"keywords":["wTools"],"gitHead":"104ee8196ed4cb1151ce85f57b09b6cc26a84f77","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.283","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-iOAEJkZcCqACMwP5Aa90KM2+1ba2FtRs4WforOMxkszwtsGfD3nnAWphOPIe4jcJFEYNEz8KcWOM7M/5dGq3Hw==","shasum":"1ce470de447638c864d681225e2c716c8ff4a286","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.283.tgz","fileCount":11,"unpackedSize":139705,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICZ+AhXU4hpqpF/EpqMNNmA9OOX/umlLBtDDH5C7Cl8/AiAqUUUMe2jF245yIn7/S3/pSEsib78ugChQogkJ2RwY+Q=="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiqbqNACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmoQOw//cBP8ZWItoEQ3Rj/ndAkAX/uWK7k1UEQb69OZZl5XB8iipvJZ\r\n5zoAWmVg/Ann+AzZjaiyqxMkg62xPrsWB0vuDKedTBklATiT4oOrcoYzAFMK\r\n6xRr1GZK1s2IC2/sci4xTiuSGO4/VB0ktc37Ev8LFbdtVQLSaJbkRMbzYwUu\r\nzUqyOMvW+/ErkhOWi8Jc3pIUi3gCTHIZ6YymtzVfYtn4e5xZCNynJBzSht+4\r\n2hrU5eEASy1HF/ZyiEtjF66o3kPHjCNGSKycIox5IPQ5jZ2UiIjfFa36/V3r\r\nCkZf5cGvvMOOzTCUYAUDpDlswedXdiDN98ADqVOO8NJqkbgBjfYAxcLX4Gv3\r\nwu1hDFBLccZWoTHJ6VP27N4wz9JWt4wwqBZX53gSaW0MdG8+CScWGBHR8LfF\r\nizBW8LX4mWDEDhBSY4drQSs7X51T3KGKfmdxvLTS7hinroJ5/FpEENOisdKg\r\nEOwimWOVobKZ8hySGmry3Et60mBTfSncBNJRimKNkn2xrS1jLALtLLRxtMYu\r\nkrNEK64ZkFHB8KVCCNnXWSpwUx25MRvx0Fqzd5Vv6R3dxcIZ/19Cwix+6kW0\r\n8dyqWa250BkbOfzg3AHahmFvjWcqYlPQWHtYpirzIOTBDLMwsoxnwwm109Z1\r\nOk7zkBKVqLQLneY9YjHGSB8VpswKk9GlagY=\r\n=vgE0\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"kos.listing@gmail.com"},"directories":{},"maintainers":[{"name":"wandalen","email":"kos.listing@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.283_1655290509583_0.3720436398045719"},"_hasShrinkwrap":false},"0.3.284":{"name":"wgraphbasic","version":"0.3.284","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"contributors":[{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},{"name":"Volodymyr M.","email":"volodymyr.migdal@gmail.com"},{"name":"Dmytro Kryvoruchko","email":"dm.vict.kr@gmail.com"}],"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.32.0"},"keywords":["wTools"],"gitHead":"16207125b6f04a5f26ef583968f8fa5454841d0d","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.284","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-nLVuwXA2hAKXcnaLeUGPZ3rTaK09UTUYDeRbPE68qigZU05T+hjPlzW/r2WWJbR9jMG02O1MswxW30gCJFHRWQ==","shasum":"e41a16e22b1975ee551f5be72e2965b09087a505","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.284.tgz","fileCount":11,"unpackedSize":139705,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCQT3bw77e+l342jhYmkVhODtQy2IG0PnP1gUW+hcumIQIgW4LAFPLCNcBSidurYzErJb+4wufQBck1nTBKYeNzyj4="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJirSczACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmrMgw/8Dozikj2CcmU4UtifQjd9fta1h+D66Jmg23lsczRn3clzqFbh\r\n5ISxUIusGlPw/FVfl1PITV+IL01ea8vzS1vCC387uWGag9Er2N4eClTJqSa+\r\nfdoymh0D8yk7QLA7DwvvGjeN1ZWi01agoyIPD+bYbKXowkepTuSEVl4GVHNB\r\nINx4Y95D72lG0hnHTN+Vv6msdfiA2+syQSDAZ+0ncLbaz0+dP0hlZYJVs4w8\r\nGfOPym3XBPeQXoynJqhl5lkhUOaCP9sEEkZQ1yZOUF0dLoq1Z4JACpNomrqH\r\nDQxSnmO2dIfrkexBzM5BtQJl0KK7fyaf4Omfmwgqm6hbxfFb9gydB8dRgPIe\r\n8E4GfjzR/bXtawp9TYVqZLL24FKQwI664pleB/EtRxOI9GSBMTbnalssHRVm\r\nxKUET1Iyc46XVZJ/3Mp2qwD93hosePjoPbwBz/bymSfiwEys1HHF858kCLVt\r\n7RtdK2ZrOsk8HKIiDx7ftWLG4aEh7UM5iqubbGlEP5rwMznFKIzDhuTwJTwZ\r\nXTgH7SPuOTqyYC63dix+GKE5ZeczL77zxxwxMtmRKigOZ2nEAqGqBxNghxa/\r\nkZ4G+YrgF3ZXMv1JEK5lBaBcgM66jlDLCXmelQH5IcLnmm9hnNVDIje8bo1N\r\nL/jqwbijAdVpH4kHHAjZ5E/xsuvuBGGPJG8=\r\n=6aC6\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"kos.listing@gmail.com"},"directories":{},"maintainers":[{"name":"wandalen","email":"kos.listing@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.284_1655514931356_0.939040681164031"},"_hasShrinkwrap":false},"0.3.285":{"name":"wgraphbasic","version":"0.3.285","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"contributors":[{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},{"name":"Volodymyr M.","email":"volodymyr.migdal@gmail.com"},{"name":"Dmytro Kryvoruchko","email":"dm.vict.kr@gmail.com"}],"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.32.0"},"keywords":["wTools"],"gitHead":"f6fffd6c745d82146060a56471404e2a496a2181","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.285","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-WnxrvEoWdIYsN57Kqp5ISbbIUY3EozQpvTNx4ktRDLVVSYsZtpFZ5kpA0sDkjw1I4N6fhTkpwmcfGOKGytXovg==","shasum":"3b4b28cf9ee9e4e9f200f692c9b0895a65ae2510","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.285.tgz","fileCount":11,"unpackedSize":139705,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDgAaDcDfquAkIo6NRzHogLErNh8zitK6X9mvcgZykO7wIgUeJLTma/Yhtl78jbt+f2GSRLJ2hRjHyQkE0jraqDPMM="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJirTTXACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmoF6A//VSGgYX0w+qMLK2/zBOkotS2+gsQ65tfFUNs7tzut+XnhLxx6\r\n2yXn1oewZOKgsAoA9avamPUXtT4tz5U/NSliwYGS6GK3r7IzzRQ5RNcGLrdR\r\n3vqfkCRk3DZzFgDqH80GLjKwZJntdHIibHZujV0+zG5NlKxUpjNmYBCOU95z\r\nIhop4JMWAmV2iiv0PSUZgcoXjSmOD5uAo8VPj4v2Z5blKCwPFm5s/uwr63pf\r\nBW7bWbql8ZeFXNKC2VACiOJF5I1lGdysYMSwReKiHodVUgvcQiA1WKU/oiXY\r\nZv5VzOYoF8LOL6M9t/TbcTzjF7ZV37XLeyrZlWCkF0XflXaLtAKysiy7FGxX\r\nbwWA0IACHnchGrms5SIKz8T8ihkIHvtC1hvCItsslYLgXN/WXmw/998uxSSh\r\nUnLeUIpBfnmukRtBQmuZgQXfr6GFI4KynOJ5VpVjRIZVthZxuj120jJghywM\r\njfHV/rCJqwuvhAFGdbcC2q9XE/i7T4fZNnPUE+g16veITcSkwiZH3uNwRzwR\r\nD+S5/iC0gQYhgKQsu4usp51ph4Tnrz5idxDtVjOH2iMvrkua/ip3XfQppEaE\r\nQ7mvuCIfLTT/UcGzh4hUG5EXqBYJ6FMAxiAyv3DBDEySffKkUIprt/Feh601\r\nKLIrqtOTYDD04TeEvEmgdpgi5jiPGcRocco=\r\n=iwcc\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"kos.listing@gmail.com"},"directories":{},"maintainers":[{"name":"wandalen","email":"kos.listing@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.285_1655518423434_0.13887249719551376"},"_hasShrinkwrap":false},"0.3.286":{"name":"wgraphbasic","version":"0.3.286","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"contributors":[{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},{"name":"Volodymyr M.","email":"volodymyr.migdal@gmail.com"},{"name":"Dmytro Kryvoruchko","email":"dm.vict.kr@gmail.com"}],"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.32.0"},"keywords":["wTools"],"gitHead":"feb5ef8cc96143e7c789274426d748c8407df3c4","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.286","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-LgE5X2hmNjATW+0hGx9Z0P2+AvEfC9NoT0zJO9iAb7dErWa6Ret4XCZ4jdhh3RXqCYTkNFO9JVhFF2hO8s6HCw==","shasum":"50721c40d0dc0adf0b17754fcac586eae49ad943","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.286.tgz","fileCount":11,"unpackedSize":139705,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFhh9du5AECTz9UJ8r6GNBrsr/12NeWmuZYrwkM2tPkTAiAg0eAgu1zWL//cL74aKXZN/T5MYS80HfGexPe+NFeCVg=="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJi3Pn+ACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmqG6xAAhN/xYKKIDrItQsi7gM3ND7p9b7qe8uk9f2awHULQ87MncB2f\r\nGsbalM3Op13dO6tJaFlrIGCtsZCgUrPn5YKGeCH5ppUYpF2AJPtbePhBG/c0\r\nTZkCu6Vr4B34glQz0Bl96ZOrMsumV9ogVmHtaZWLwU7OWUhjTvIXNlP0JRP3\r\ne1p09pKXC6FV796CdzrLiplC+SkIl/mlDeqlz5WsQkXfWv7MYtd1tDWQo5D5\r\nhfxHbBQnobCn3DIVAIJTvQ+0yBiqhVqf2adGs4sbe0l54OVRzBDB/KKqs4Wk\r\nTEE7GNfuRqXwbgiL/RozNNeOBGobMliQMHruV/4wqRBTtc+Uet/lRloAJ3af\r\nbU3TCw4KFolHHXnLlPv3JnaUH7y1RB3wKIw00d/g5N6K4f7+Yrqw31uALfbj\r\nRZm2omb4aIGtsVAom8grGgvGN1sGeaRF2s9vxByZjxTZlIABeEkJjmKeG1me\r\nVpGzti82mnSC6gvw/suiXQkI1hQYMkM33zCEeOe24chMrghuSNHR9hwqgm98\r\nE6zR7Y1rTF0SXwIc2LVCGBtKm5uPAcXUbPYFjisaRzwJ3lXB2LSke2HRHdmu\r\n3NIekYNSGKf4hA10EACVFi6GUJgA63ftR9yVNebsI4PRsSlL+cyvxzQzFuWi\r\nOq3nuqzL1uo51SmrjiyfvDuZS62tWUwFets=\r\n=JO0X\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"kos.listing@gmail.com"},"directories":{},"maintainers":[{"name":"wandalen","email":"kos.listing@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.286_1658649086037_0.9008983843365099"},"_hasShrinkwrap":false},"0.3.287":{"name":"wgraphbasic","version":"0.3.287","description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"contributors":[{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},{"name":"Volodymyr M.","email":"volodymyr.migdal@gmail.com"},{"name":"Dmytro Kryvoruchko","email":"dm.vict.kr@gmail.com"}],"license":"MIT","main":"proto/node_modules/wgraphbasic","scripts":{"test":"wtest .run 'proto/**' rapidity:-1","docgen":"wdocgen proto"},"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"dependencies":{"wTools":"latest","wProto":"latest","wCopyable":"latest"},"devDependencies":{"wTesting":"latest","eslint":"7.32.0"},"keywords":["wTools"],"gitHead":"841f621361e6f07c51b7fe57786d49c0f946f213","homepage":"https://github.com/Wandalen/wGraphBasic#readme","_id":"wgraphbasic@0.3.287","_nodeVersion":"16.13.1","_npmVersion":"8.1.2","dist":{"integrity":"sha512-EE/T9B4tV1TSOHazAu7wHfsDKWlLVTg6kHj7uKDFkrSlNic+m7To5Vu44z1w04V7it8xYBUOu2BbxAHban928Q==","shasum":"b453592e2bf2bd33e2d96fdf43d1a4cb0fbffd1a","tarball":"https://registry.npmjs.org/wgraphbasic/-/wgraphbasic-0.3.287.tgz","fileCount":11,"unpackedSize":139705,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFnS2LcZ2QHYGypt8QIIeltJNxknXXlxMsiQw74lDqmKAiALDoS814eeo/pJOx1DT2U73ebEdEu74aRcg3C2Ld3SPA=="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJi3piWACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmpQPg/+I2qxIn7XrbH9iYVDdYGMpt4bmb7LrY/ZZDe1O6P8kH6sZcF4\r\nswGMGIY9V3RbGKds0xW9pfLwYtatfYoklY1ofLJx4JIGMPuGOcXo0HXGPood\r\nW6vQ1UjlKH+ytUrBz1W0IyDQYfHEtWvFGkyH6cWdZckeCWfJf4uC602dvcc7\r\nWxBn3lhiJO2BC3tKNzbk1t6QJ7lKo+AwwqJY6iAcyLwooo4G7tkK9NXBkLaM\r\n0AD5bE9WwS3fDRMwZ6g02EpKIJ1CVwLcid9egdykiMMgISdMUaxIllmWhiL+\r\nna6u287LRTo4zJosl7t19DzlPTCd+dJ0rzAx9PciR+vaHVH5M6lufMDq0wlE\r\nPNGatn9LhUiopA7QqyZ2mFbwYItmOVKFTjoIp3/dEKU5f/mpDMWAuhCufB9t\r\niZKgMMZrSX6mWI4EdocAKy+usSXywmzR2QXIk5UGWuvKP3tRj3XtjDzervQ4\r\nRy09dSEsPCc27LLcUaCmoz6HCPQgphWpg7KAA66YQvp0erfuYpMOUGkhtrf2\r\nfYfM6xxugFosbTaHFfe4PxfUsqFo8UChdJXS0b/SH1ogC/8N3N+QX0QtPrIn\r\nGucbe1qLxkdPGkbZcoguTIXzGP6m0X59lRTC8/nkiyBWNQH/Eb8Wi//PzqCi\r\njwG0iHe9O9jenzYheEpob/q0NZv4DWIjQeU=\r\n=1c69\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"wandalen","email":"kos.listing@gmail.com"},"directories":{},"maintainers":[{"name":"wandalen","email":"kos.listing@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/wgraphbasic_0.3.287_1658755222162_0.235194309776386"},"_hasShrinkwrap":false}},"time":{"created":"2019-10-03T17:17:39.254Z","0.3.34":"2019-10-03T17:17:39.520Z","modified":"2022-07-25T13:20:22.547Z","0.3.35":"2019-10-21T10:10:03.570Z","0.3.36":"2019-10-25T17:02:09.253Z","0.3.37":"2019-10-25T18:49:06.288Z","0.3.38":"2019-11-08T13:28:02.178Z","0.3.39":"2019-11-14T22:09:55.766Z","0.3.40":"2019-11-15T07:03:06.129Z","0.3.41":"2019-11-16T06:44:45.312Z","0.3.42":"2019-11-16T09:48:39.051Z","0.3.43":"2019-11-16T10:05:08.681Z","0.3.44":"2019-11-18T16:11:08.468Z","0.3.45":"2019-11-18T17:35:44.449Z","0.3.46":"2019-11-19T11:49:50.222Z","0.3.47":"2019-11-21T16:45:45.148Z","0.3.48":"2019-11-22T07:48:34.890Z","0.3.49":"2019-11-29T10:22:01.485Z","0.3.50":"2019-12-02T07:16:17.108Z","0.3.51":"2019-12-04T14:06:44.776Z","0.3.52":"2019-12-05T19:45:11.753Z","0.3.53":"2019-12-09T18:51:23.406Z","0.3.54":"2019-12-10T19:16:38.746Z","0.3.55":"2019-12-12T11:20:58.676Z","0.3.56":"2019-12-12T12:21:14.126Z","0.3.57":"2019-12-16T14:50:44.271Z","0.3.58":"2019-12-19T09:27:13.373Z","0.3.59":"2019-12-19T10:28:33.087Z","0.3.60":"2019-12-19T11:00:50.568Z","0.3.61":"2019-12-19T14:01:26.655Z","0.3.62":"2019-12-25T16:21:52.366Z","0.3.63":"2019-12-25T17:26:24.926Z","0.3.64":"2020-01-05T13:55:08.242Z","0.3.65":"2020-01-15T10:21:04.110Z","0.3.66":"2020-01-17T18:12:20.926Z","0.3.67":"2020-01-19T13:48:16.010Z","0.3.68":"2020-01-19T14:25:13.014Z","0.3.69":"2020-02-03T18:43:19.083Z","0.3.70":"2020-02-03T19:32:06.394Z","0.3.71":"2020-02-03T20:15:27.637Z","0.3.72":"2020-02-04T06:59:52.794Z","0.3.73":"2020-02-06T18:12:33.663Z","0.3.74":"2020-02-07T13:53:31.430Z","0.3.75":"2020-02-11T12:03:39.328Z","0.3.76":"2020-02-11T14:09:33.550Z","0.3.77":"2020-02-11T15:05:47.031Z","0.3.78":"2020-02-11T16:56:49.021Z","0.3.79":"2020-02-11T19:00:54.907Z","0.3.80":"2020-02-17T09:39:21.530Z","0.3.81":"2020-02-17T17:24:37.778Z","0.3.82":"2020-02-17T18:19:50.859Z","0.3.83":"2020-02-18T06:55:24.711Z","0.3.84":"2020-02-20T17:15:53.471Z","0.3.85":"2020-02-23T17:59:23.768Z","0.3.86":"2020-02-23T21:54:29.934Z","0.3.87":"2020-02-24T05:37:37.512Z","0.3.88":"2020-02-24T11:12:16.200Z","0.3.89":"2020-03-05T15:27:24.712Z","0.3.90":"2020-03-10T18:18:49.785Z","0.3.91":"2020-03-10T19:17:09.871Z","0.3.92":"2020-03-11T09:21:47.423Z","0.3.93":"2020-03-11T12:17:40.194Z","0.3.94":"2020-03-19T09:55:35.881Z","0.3.95":"2020-03-19T10:35:25.789Z","0.3.96":"2020-03-25T16:43:17.835Z","0.3.97":"2020-03-25T18:10:47.986Z","0.3.98":"2020-03-25T19:08:58.823Z","0.3.99":"2020-03-26T05:41:44.734Z","0.3.100":"2020-03-26T06:41:56.570Z","0.3.101":"2020-03-27T15:26:38.187Z","0.3.102":"2020-03-27T16:00:09.962Z","0.3.103":"2020-03-31T11:57:36.206Z","0.3.105":"2020-04-05T08:13:45.299Z","0.3.106":"2020-04-05T08:43:52.547Z","0.3.107":"2020-04-05T11:07:46.319Z","0.3.108":"2020-04-05T12:20:51.163Z","0.3.109":"2020-04-09T09:44:19.548Z","0.3.110":"2020-04-09T11:25:31.867Z","0.3.111":"2020-04-09T14:24:08.047Z","0.3.112":"2020-04-09T17:55:33.523Z","0.3.113":"2020-04-10T12:07:40.100Z","0.3.114":"2020-04-10T14:32:56.209Z","0.3.115":"2020-04-16T10:30:22.937Z","0.3.116":"2020-04-21T04:26:30.552Z","0.3.117":"2020-04-24T05:15:40.411Z","0.3.118":"2020-04-24T06:17:40.307Z","0.3.119":"2020-04-25T09:05:55.156Z","0.3.120":"2020-04-25T10:27:32.051Z","0.3.121":"2020-04-25T15:24:07.725Z","0.3.122":"2020-04-26T04:24:44.459Z","0.3.123":"2020-04-27T07:35:19.573Z","0.3.124":"2020-04-27T12:19:16.757Z","0.3.125":"2020-04-27T14:31:05.884Z","0.3.126":"2020-05-01T13:20:05.880Z","0.3.127":"2020-05-01T14:03:45.041Z","0.3.128":"2020-05-01T15:20:59.925Z","0.3.129":"2020-05-01T17:12:43.582Z","0.3.130":"2020-05-03T11:49:17.003Z","0.3.131":"2020-05-08T05:47:36.448Z","0.3.132":"2020-05-21T13:30:57.974Z","0.3.133":"2020-06-01T12:13:10.932Z","0.3.134":"2020-06-04T14:23:02.433Z","0.3.135":"2020-06-05T13:51:50.236Z","0.3.136":"2020-06-09T18:06:25.201Z","0.3.137":"2020-06-11T04:47:13.945Z","0.3.138":"2020-06-12T13:27:26.928Z","0.3.139":"2020-07-05T08:05:37.924Z","0.3.140":"2020-07-06T19:35:28.217Z","0.3.141":"2020-07-07T14:09:49.304Z","0.3.142":"2020-07-09T05:58:05.042Z","0.3.143":"2020-07-09T13:45:29.503Z","0.3.144":"2020-07-10T12:43:14.650Z","0.3.145":"2020-07-14T14:24:41.056Z","0.3.146":"2020-07-15T14:08:33.898Z","0.3.147":"2020-07-16T12:34:24.390Z","0.3.148":"2020-07-17T14:46:40.927Z","0.3.149":"2020-07-18T20:36:53.160Z","0.3.150":"2020-07-25T21:19:02.024Z","0.3.151":"2020-08-15T14:39:48.712Z","0.3.152":"2020-08-15T20:56:57.934Z","0.3.153":"2020-08-19T14:18:23.220Z","0.3.154":"2020-08-21T12:55:40.174Z","0.3.156":"2020-08-31T05:50:15.074Z","0.3.157":"2020-09-04T07:27:14.035Z","0.3.158":"2020-09-04T09:00:27.271Z","0.3.159":"2020-09-09T07:05:26.609Z","0.3.160":"2020-10-07T10:40:41.241Z","0.3.161":"2020-10-15T10:14:13.370Z","0.3.162":"2020-10-22T19:58:54.900Z","0.3.163":"2020-10-23T13:29:45.061Z","0.3.164":"2020-10-26T12:38:13.026Z","0.3.165":"2020-10-28T18:51:37.601Z","0.3.166":"2020-10-30T06:28:56.081Z","0.3.167":"2020-10-31T11:21:58.835Z","0.3.168":"2020-10-31T15:16:09.983Z","0.3.169":"2020-11-06T09:57:11.619Z","0.3.170":"2020-11-12T14:28:13.970Z","0.3.171":"2020-11-20T07:40:22.490Z","0.3.172":"2020-11-25T21:03:11.860Z","0.3.173":"2020-11-30T08:27:17.554Z","0.3.174":"2020-12-03T08:53:15.767Z","0.3.175":"2020-12-12T07:13:51.517Z","0.3.176":"2020-12-19T21:23:10.111Z","0.3.177":"2020-12-21T14:25:12.854Z","0.3.178":"2020-12-23T05:00:59.849Z","0.3.179":"2021-01-10T19:51:52.222Z","0.3.180":"2021-01-13T15:19:43.959Z","0.3.181":"2021-01-21T18:20:23.920Z","0.3.182":"2021-01-22T11:47:11.154Z","0.3.183":"2021-01-22T17:31:47.656Z","0.3.184":"2021-01-24T14:40:40.568Z","0.3.185":"2021-01-25T19:47:53.032Z","0.3.186":"2021-01-26T20:25:56.194Z","0.3.187":"2021-01-27T15:33:05.081Z","0.3.188":"2021-01-27T17:24:50.096Z","0.3.189":"2021-01-28T18:09:46.004Z","0.3.190":"2021-01-29T06:24:10.034Z","0.3.191":"2021-01-29T15:45:43.130Z","0.3.193":"2021-01-29T20:04:14.266Z","0.3.194":"2021-02-02T08:26:25.781Z","0.3.195":"2021-02-04T22:01:47.578Z","0.3.196":"2021-02-09T06:44:03.050Z","0.3.197":"2021-02-14T20:16:17.066Z","0.3.198":"2021-02-15T17:54:56.525Z","0.3.199":"2021-02-17T09:13:31.759Z","0.3.200":"2021-02-17T19:37:09.308Z","0.3.201":"2021-02-18T18:00:23.256Z","0.3.202":"2021-02-20T01:01:16.481Z","0.3.203":"2021-02-22T14:22:33.546Z","0.3.204":"2021-02-22T16:58:21.996Z","0.3.205":"2021-02-22T20:02:56.903Z","0.3.206":"2021-02-25T18:10:57.524Z","0.3.207":"2021-03-05T07:08:28.937Z","0.3.208":"2021-03-12T07:37:07.753Z","0.3.209":"2021-03-13T18:25:35.797Z","0.3.210":"2021-03-14T07:25:42.198Z","0.3.211":"2021-03-15T16:57:52.495Z","0.3.212":"2021-03-26T15:58:13.761Z","0.3.213":"2021-03-26T17:08:11.180Z","0.3.214":"2021-03-29T06:03:23.753Z","0.3.215":"2021-03-30T16:00:54.135Z","0.3.216":"2021-04-01T06:47:51.654Z","0.3.217":"2021-04-03T14:04:32.865Z","0.3.218":"2021-04-03T19:59:59.857Z","0.3.219":"2021-04-04T07:59:07.028Z","0.3.220":"2021-04-05T17:48:24.671Z","0.3.221":"2021-04-06T14:10:56.623Z","0.3.222":"2021-04-06T23:54:25.754Z","0.3.223":"2021-04-08T06:25:51.956Z","0.3.224":"2021-04-08T08:58:51.069Z","0.3.225":"2021-04-08T10:39:08.414Z","0.3.226":"2021-04-10T20:40:40.256Z","0.3.227":"2021-04-26T13:27:02.603Z","0.3.228":"2021-04-27T09:54:20.633Z","0.3.229":"2021-04-29T15:05:02.310Z","0.3.230":"2021-04-30T06:12:09.969Z","0.3.231":"2021-05-04T08:48:04.639Z","0.3.232":"2021-05-11T00:23:33.827Z","0.3.233":"2021-05-12T15:59:11.743Z","0.3.234":"2021-05-13T18:56:39.464Z","0.3.235":"2021-05-14T14:25:12.884Z","0.3.236":"2021-05-18T18:24:51.385Z","0.3.237":"2021-05-27T15:00:18.626Z","0.3.238":"2021-06-02T09:23:35.840Z","0.3.239":"2021-06-06T05:35:08.630Z","0.3.240":"2021-06-07T15:37:50.997Z","0.3.241":"2021-06-09T04:36:49.693Z","0.3.242":"2021-06-17T16:44:11.138Z","0.3.243":"2021-07-01T05:36:46.833Z","0.3.244":"2021-07-02T07:40:50.615Z","0.3.245":"2021-07-02T08:54:06.344Z","0.3.246":"2021-07-03T14:13:20.060Z","0.3.247":"2021-07-04T10:39:47.934Z","0.3.248":"2021-07-08T16:29:23.346Z","0.3.249":"2021-07-10T18:21:07.268Z","0.3.250":"2021-07-11T15:53:26.716Z","0.3.251":"2021-08-04T17:52:31.699Z","0.3.252":"2021-08-05T15:28:33.777Z","0.3.253":"2021-08-05T17:25:12.850Z","0.3.254":"2021-08-11T10:55:44.405Z","0.3.255":"2021-08-12T15:18:52.340Z","0.3.256":"2021-08-13T13:14:13.127Z","0.3.257":"2021-08-14T07:45:21.990Z","0.3.258":"2021-09-10T07:19:44.319Z","0.3.259":"2021-09-28T23:43:48.474Z","0.3.260":"2021-10-12T08:56:31.873Z","0.3.261":"2021-10-14T09:20:09.423Z","0.3.262":"2021-10-22T06:53:49.893Z","0.3.263":"2021-10-29T07:26:10.262Z","0.3.264":"2021-10-29T13:58:44.923Z","0.3.265":"2021-10-30T11:03:14.939Z","0.3.266":"2021-11-09T14:48:35.949Z","0.3.267":"2021-11-10T06:08:26.632Z","0.3.268":"2021-11-10T10:32:35.847Z","0.3.269":"2021-11-24T06:20:22.119Z","0.3.270":"2021-11-30T15:31:33.793Z","0.3.271":"2021-12-17T07:57:58.157Z","0.3.272":"2021-12-18T14:57:50.192Z","0.3.273":"2022-05-03T07:33:15.924Z","0.3.274":"2022-05-03T11:57:43.150Z","0.3.275":"2022-05-05T09:14:46.429Z","0.3.276":"2022-05-06T13:53:27.667Z","0.3.277":"2022-05-06T20:17:40.982Z","0.3.278":"2022-05-10T08:00:23.891Z","0.3.279":"2022-05-12T08:14:15.744Z","0.3.280":"2022-05-13T10:11:41.491Z","0.3.281":"2022-05-18T06:33:48.938Z","0.3.282":"2022-05-18T12:42:53.752Z","0.3.283":"2022-06-15T10:55:09.764Z","0.3.284":"2022-06-18T01:15:31.627Z","0.3.285":"2022-06-18T02:13:43.613Z","0.3.286":"2022-07-24T07:51:26.303Z","0.3.287":"2022-07-25T13:20:22.451Z"},"maintainers":[{"name":"wandalen","email":"kos.listing@gmail.com"}],"description":"Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro","homepage":"https://github.com/Wandalen/wGraphBasic#readme","keywords":["wTools"],"repository":{"type":"git","url":"git+https://github.com/Wandalen/wGraphBasic.git"},"author":{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},"bugs":{"url":"https://github.com/Wandalen/wGraphBasic/issues"},"license":"MIT","readme":"\n# module::GraphBasic [![status](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml/badge.svg)](https://github.com/Wandalen/wgraphbasic/actions/workflows/StandardPublish.yml) [![stable](https://img.shields.io/badge/stability-stable-brightgreen.svg)](https://github.com/emersion/stability-badges#stable)\n\nCollection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting strongly connected components, topological sort, shortest path search, and others.\n\n![Graph](doc/image/junction/WithoutLegend.png)\n\n## Documenration\n\nIndex of concepts behind the module and tutorials you may find [her](doc/version.eng/README.md).\n\n## Sample\n\n``` js\nrequire( '..' );\nlet _ = wTools;\n\n/*\nThis example shows how to create a simple graph.\nGraph :: set of nodes( vertices ) and set of edges or arcs connecting some or all nodes.\n*/\n\n/*\nDefine a graph of arbitrary structure.\nStrcuture of nodes is arbitrary. It could even be instance of a primitive type.\nGroup of nodes should have handlers which should return lists of neighbour nodes.\n*/\n\nvar a = { name : 'a', nodes : [] } // 1\nvar b = { name : 'b', nodes : [] } // 2\nvar c = { name : 'c', nodes : [] } // 3\n\n// declare lists neighbour nodes\n\na.nodes.push( b ); // add edge between nodes a and b\nb.nodes.push( c ); // add edge between nodes b and c\n\n/* declare the graph */\n\nvar sys = new _.graph.AbstractGraphSystem(); // declare sysyem of graphs\nvar group = sys.groupMake(); // declare group of nodes\ngroup.nodesAdd([ a, b, c ]); // add nodes to the group\n\nconsole.log( group.nodesExportInfo() ); // print information about nodes relation\n\n/*\n    1 : 2\n    2 : 3\n    3 :\n*/\n```\n\n### Try out from the repository\n\n```\ngit clone https://github.com/Wandalen/wgraphbasic\ncd wgraphbasic\nwill .npm.install\nnode sample/trivial/Sample.s\n```\n\nMake sure you have utility `willbe` installed. To install willbe: `npm i -g willbe@stable`. Willbe is required to build of the module.\n\n### To add to your project\n\n```\nnpm add 'wgraphbasic@stable'\n```\n\n`Willbe` is not required to use the module in your project as submodule.\n\n","readmeFilename":"Readme.md","contributors":[{"name":"Kostiantyn Wandalen","email":"wandalen@obox.systems"},{"name":"Volodymyr M.","email":"volodymyr.migdal@gmail.com"},{"name":"Dmytro Kryvoruchko","email":"dm.vict.kr@gmail.com"}]}