{"_id":"toposort","_rev":"88023","name":"toposort","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","dist-tags":{"latest":"2.0.2"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"time":{"modified":"2021-06-03T10:28:36.000Z","created":"2012-11-02T14:21:26.533Z","2.0.2":"2018-04-28T12:50:40.867Z","2.0.1":"2018-04-28T12:41:54.600Z","1.0.7":"2018-04-28T12:32:28.690Z","1.0.6":"2017-10-02T14:42:40.395Z","1.0.5":"2017-10-02T13:11:25.882Z","1.0.4":"2017-09-26T17:09:09.974Z","1.0.3":"2017-02-14T20:15:02.645Z","1.0.2":"2017-01-28T13:10:14.197Z","1.0.1":"2017-01-28T13:00:54.454Z","1.0.0":"2016-05-13T13:02:59.316Z","0.2.12":"2015-08-24T12:04:27.812Z","0.2.10":"2013-09-15T10:24:16.847Z","0.2.9":"2013-04-10T10:22:40.827Z","0.2.8":"2013-02-19T15:56:21.821Z","0.2.7":"2013-02-17T15:16:00.267Z","0.2.5":"2013-02-08T21:03:45.797Z","0.2.4":"2013-01-27T19:41:22.833Z","0.2.3":"2013-01-27T19:30:50.983Z","0.2.2":"2012-11-04T19:14:46.213Z","0.2.1":"2012-11-04T14:14:38.755Z","0.2.0":"2012-11-04T14:12:50.950Z","0.1.0":"2012-11-02T14:21:26.533Z"},"users":{"jlagunas":true,"antixrist":true,"seldszar":true,"alexpearly":true},"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"versions":{"2.0.2":{"name":"toposort","version":"2.0.2","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"0.7.x"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","gitHead":"3e3d72d1b48196ab0e87348d142ef23788a5bb67","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"homepage":"https://github.com/marcelklehr/toposort#readme","_id":"toposort@2.0.2","_shasum":"ae21768175d1559d48bef35420b2f4962f09c330","_from":".","_npmVersion":"3.9.5","_nodeVersion":"6.2.2","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"dist":{"shasum":"ae21768175d1559d48bef35420b2f4962f09c330","size":5866,"noattachment":false,"key":"/toposort/-/toposort-2.0.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-2.0.2.tgz"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/toposort_2.0.2_1524919840757_0.7718593122946391"},"_hasShrinkwrap":false,"publish_time":1524919840867,"_cnpm_publish_time":1524919840867},"2.0.1":{"name":"toposort","version":"2.0.1","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"0.7.x"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","gitHead":"7d14527ad104cb3362b7c3410cd0b9f047ca1a5e","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"homepage":"https://github.com/marcelklehr/toposort#readme","_id":"toposort@2.0.1","_shasum":"f52ef0e7f7557e2a2acdc16414a60798ece71858","_from":".","_npmVersion":"3.9.5","_nodeVersion":"6.2.2","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"dist":{"shasum":"f52ef0e7f7557e2a2acdc16414a60798ece71858","size":5788,"noattachment":false,"key":"/toposort/-/toposort-2.0.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-2.0.1.tgz"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/toposort_2.0.1_1524919314534_0.2250364597905825"},"_hasShrinkwrap":false,"publish_time":1524919314600,"_cnpm_publish_time":1524919314600},"1.0.7":{"name":"toposort","version":"1.0.7","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"0.7.x"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","gitHead":"c00606d0a4dc4404c334886128c0cac5ded22df3","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"homepage":"https://github.com/marcelklehr/toposort#readme","_id":"toposort@1.0.7","_shasum":"2e68442d9f64ec720b8cc89e6443ac6caa950029","_from":".","_npmVersion":"3.9.5","_nodeVersion":"6.2.2","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"dist":{"shasum":"2e68442d9f64ec720b8cc89e6443ac6caa950029","size":5575,"noattachment":false,"key":"/toposort/-/toposort-1.0.7.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-1.0.7.tgz"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/toposort_1.0.7_1524918748591_0.9234556349794514"},"_hasShrinkwrap":false,"publish_time":1524918748690,"_cnpm_publish_time":1524918748690},"1.0.6":{"name":"toposort","version":"1.0.6","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"0.7.x"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","gitHead":"c884098ec3fe722303305cab41836a015e4faf9b","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"homepage":"https://github.com/marcelklehr/toposort#readme","_id":"toposort@1.0.6","_shasum":"c31748e55d210effc00fdcdc7d6e68d7d7bb9cec","_from":".","_npmVersion":"3.9.5","_nodeVersion":"6.2.2","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"dist":{"shasum":"c31748e55d210effc00fdcdc7d6e68d7d7bb9cec","size":5490,"noattachment":false,"key":"/toposort/-/toposort-1.0.6.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-1.0.6.tgz"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/toposort-1.0.6.tgz_1506955358505_0.8359004552476108"},"directories":{},"publish_time":1506955360395,"_cnpm_publish_time":1506955360395,"_hasShrinkwrap":false},"1.0.5":{"name":"toposort","version":"1.0.5","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"0.7.x"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","gitHead":"6b4dfd848332b72b3f9ff2c6faeef68e9585aa31","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"homepage":"https://github.com/marcelklehr/toposort#readme","_id":"toposort@1.0.5","_shasum":"21cc73580261a15b55338c6292cca5121574b573","_from":".","_npmVersion":"3.9.5","_nodeVersion":"6.2.2","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"dist":{"shasum":"21cc73580261a15b55338c6292cca5121574b573","size":5593,"noattachment":false,"key":"/toposort/-/toposort-1.0.5.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-1.0.5.tgz"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/toposort-1.0.5.tgz_1506949884954_0.07612862205132842"},"directories":{},"publish_time":1506949885882,"_cnpm_publish_time":1506949885882,"_hasShrinkwrap":false},"1.0.4":{"name":"toposort","version":"1.0.4","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"0.7.x"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","gitHead":"e7e00947cd543b849659a64e31c05ace76d1b681","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"homepage":"https://github.com/marcelklehr/toposort#readme","_id":"toposort@1.0.4","_shasum":"a86107690cbee8cae43b349d2f60162500924dfc","_from":".","_npmVersion":"3.9.5","_nodeVersion":"6.2.2","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"dist":{"shasum":"a86107690cbee8cae43b349d2f60162500924dfc","size":5371,"noattachment":false,"key":"/toposort/-/toposort-1.0.4.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-1.0.4.tgz"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/toposort-1.0.4.tgz_1506445749051_0.5975394241977483"},"directories":{},"publish_time":1506445749974,"_hasShrinkwrap":false,"_cnpm_publish_time":1506445749974},"1.0.3":{"name":"toposort","version":"1.0.3","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"0.7.x"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","gitHead":"8b14e9fdef5c93c9d2fe72281b2dd5bc615480c3","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"homepage":"https://github.com/marcelklehr/toposort#readme","_id":"toposort@1.0.3","_shasum":"f02cd8a74bd8be2fc0e98611c3bacb95a171869c","_from":".","_npmVersion":"3.9.5","_nodeVersion":"6.2.2","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"dist":{"shasum":"f02cd8a74bd8be2fc0e98611c3bacb95a171869c","size":5351,"noattachment":false,"key":"/toposort/-/toposort-1.0.3.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-1.0.3.tgz"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"_npmOperationalInternal":{"host":"packages-12-west.internal.npmjs.com","tmp":"tmp/toposort-1.0.3.tgz_1487103300632_0.6892355768941343"},"directories":{},"publish_time":1487103302645,"_cnpm_publish_time":1487103302645,"_hasShrinkwrap":false},"1.0.2":{"name":"toposort","version":"1.0.2","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"0.7.x"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","gitHead":"699570f647fc98099d8ee7d43564c824e856abf0","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"homepage":"https://github.com/marcelklehr/toposort#readme","_id":"toposort@1.0.2","_shasum":"be1de72431320fcefe35a7b539c1c336cbcfd32c","_from":".","_npmVersion":"3.9.5","_nodeVersion":"6.2.2","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"dist":{"shasum":"be1de72431320fcefe35a7b539c1c336cbcfd32c","size":12975,"noattachment":false,"key":"/toposort/-/toposort-1.0.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-1.0.2.tgz"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"_npmOperationalInternal":{"host":"packages-18-east.internal.npmjs.com","tmp":"tmp/toposort-1.0.2.tgz_1485609013510_0.016206995118409395"},"directories":{},"publish_time":1485609014197,"_cnpm_publish_time":1485609014197,"_hasShrinkwrap":false},"1.0.1":{"name":"toposort","version":"1.0.1","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"0.7.x"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","gitHead":"8c40c53e1c212f80e7753738eff0b00a139bcc79","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"homepage":"https://github.com/marcelklehr/toposort#readme","_id":"toposort@1.0.1","_shasum":"0a3480a29024b11f26dabe51d40f3a665c01e7de","_from":".","_npmVersion":"3.9.5","_nodeVersion":"6.2.2","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"dist":{"shasum":"0a3480a29024b11f26dabe51d40f3a665c01e7de","size":12965,"noattachment":false,"key":"/toposort/-/toposort-1.0.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-1.0.1.tgz"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"_npmOperationalInternal":{"host":"packages-18-east.internal.npmjs.com","tmp":"tmp/toposort-1.0.1.tgz_1485608453816_0.2737545792479068"},"directories":{},"publish_time":1485608454454,"_cnpm_publish_time":1485608454454,"_hasShrinkwrap":false},"1.0.0":{"name":"toposort","version":"1.0.0","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"0.7.x"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","gitHead":"f0d4d51ad98b62202edfe309be8aeec021dfb4af","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"homepage":"https://github.com/marcelklehr/toposort#readme","_id":"toposort@1.0.0","_shasum":"b66cf385a1a8a8e68e45b8259e7f55875e8b06ef","_from":".","_npmVersion":"3.8.2","_nodeVersion":"5.6.0","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"dist":{"shasum":"b66cf385a1a8a8e68e45b8259e7f55875e8b06ef","size":38532,"noattachment":false,"key":"/toposort/-/toposort-1.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-1.0.0.tgz"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"_npmOperationalInternal":{"host":"packages-16-east.internal.npmjs.com","tmp":"tmp/toposort-1.0.0.tgz_1463144577487_0.7748489447403699"},"directories":{},"publish_time":1463144579316,"_cnpm_publish_time":1463144579316,"_hasShrinkwrap":false},"0.2.12":{"name":"toposort","version":"0.2.12","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git+https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"0.7.x"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","gitHead":"db79641853aeb3b9488faa86daedfd63b92c3a79","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"homepage":"https://github.com/marcelklehr/toposort#readme","_id":"toposort@0.2.12","_shasum":"c7d2984f3d48c217315cc32d770888b779491e81","_from":".","_npmVersion":"2.8.4","_nodeVersion":"0.12.7","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"dist":{"shasum":"c7d2984f3d48c217315cc32d770888b779491e81","size":38527,"noattachment":false,"key":"/toposort/-/toposort-0.2.12.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.2.12.tgz"},"directories":{},"publish_time":1440417867812,"_cnpm_publish_time":1440417867812,"_hasShrinkwrap":false},"0.2.10":{"name":"toposort","version":"0.2.10","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"*"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","readmeFilename":"README.md","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"_id":"toposort@0.2.10","dist":{"shasum":"bd86f4bb2408307d1912ba6aacbd01790a64fd2c","size":16970,"noattachment":false,"key":"/toposort/-/toposort-0.2.10.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.2.10.tgz"},"_from":".","_npmVersion":"1.3.7","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"publish_time":1379240656847,"_cnpm_publish_time":1379240656847,"_hasShrinkwrap":false},"0.2.9":{"name":"toposort","version":"0.2.9","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"*"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","readmeFilename":"README.md","_id":"toposort@0.2.9","dist":{"shasum":"ba40039840b42f6ef7597f6683d98234655bcc17","size":16656,"noattachment":false,"key":"/toposort/-/toposort-0.2.9.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.2.9.tgz"},"_from":".","_npmVersion":"1.2.15","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"publish_time":1365589360827,"_cnpm_publish_time":1365589360827,"_hasShrinkwrap":false},"0.2.8":{"name":"toposort","version":"0.2.8","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"*"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","readmeFilename":"README.md","_id":"toposort@0.2.8","dist":{"shasum":"1a3f2f0a3432c06338f67e4e732a28ce8d3f207b","size":3316,"noattachment":false,"key":"/toposort/-/toposort-0.2.8.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.2.8.tgz"},"_from":".","_npmVersion":"1.2.11","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"publish_time":1361289381821,"_cnpm_publish_time":1361289381821,"_hasShrinkwrap":false},"0.2.7":{"name":"toposort","version":"0.2.7","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"https://github.com/marcelklehr/toposort.git"},"devDependencies":{"vows":"*"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","readmeFilename":"README.md","_id":"toposort@0.2.7","dist":{"shasum":"3d8e0b6f7d90bc7b30b93b0e90724fa1dde66a76","size":3300,"noattachment":false,"key":"/toposort/-/toposort-0.2.7.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.2.7.tgz"},"_from":".","_npmVersion":"1.2.11","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"publish_time":1361114160267,"_cnpm_publish_time":1361114160267,"_hasShrinkwrap":false},"0.2.5":{"name":"toposort","version":"0.2.5","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"https://github.com/marcelklehr/node-toposort.git"},"devDependencies":{"vows":"*"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","readmeFilename":"README.md","_id":"toposort@0.2.5","dist":{"shasum":"ea5a4327ff00cf555451d15cfb38ec1c881d4edb","size":3109,"noattachment":false,"key":"/toposort/-/toposort-0.2.5.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.2.5.tgz"},"_npmVersion":"1.1.68","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"publish_time":1360357425797,"_cnpm_publish_time":1360357425797,"_hasShrinkwrap":false},"0.2.4":{"name":"toposort","version":"0.2.4","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"https://github.com/marcelklehr/node-toposort.git"},"devDependencies":{"vows":"*"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","readmeFilename":"README.md","_id":"toposort@0.2.4","dist":{"shasum":"70714e487ce5bf3b3afdea8c80ccb77d3ec9b2d0","size":3040,"noattachment":false,"key":"/toposort/-/toposort-0.2.4.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.2.4.tgz"},"_npmVersion":"1.1.68","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"publish_time":1359315682833,"_cnpm_publish_time":1359315682833,"_hasShrinkwrap":false},"0.2.3":{"name":"toposort","version":"0.2.3","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"https://github.com/marcelklehr/node-toposort.git"},"devDependencies":{"vows":"*"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","readmeFilename":"README.md","_id":"toposort@0.2.3","dist":{"shasum":"21cdf2d4690763378b5d175f4e4f30ed4ad39d7c","size":3010,"noattachment":false,"key":"/toposort/-/toposort-0.2.3.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.2.3.tgz"},"_npmVersion":"1.1.68","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"publish_time":1359315050983,"_cnpm_publish_time":1359315050983,"_hasShrinkwrap":false},"0.2.2":{"name":"toposort","version":"0.2.2","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"https://github.com/marcelklehr/node-toposort.git"},"devDependencies":{"vows":"*"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","readmeFilename":"README.md","_id":"toposort@0.2.2","dist":{"shasum":"e3a5717763d269427e4395464ed98653f99cd915","size":3011,"noattachment":false,"key":"/toposort/-/toposort-0.2.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.2.2.tgz"},"_npmVersion":"1.1.64","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"publish_time":1352056486213,"_cnpm_publish_time":1352056486213,"_hasShrinkwrap":false},"0.2.1":{"name":"toposort","version":"0.2.1","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"https://github.com/marcelklehr/node-toposort.git"},"devDependencies":{"vows":"*"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","readmeFilename":"README.md","_id":"toposort@0.2.1","dist":{"shasum":"0d8997a20e0f54ea2f986ba764bc741b48a38f0e","size":2539,"noattachment":false,"key":"/toposort/-/toposort-0.2.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.2.1.tgz"},"_npmVersion":"1.1.64","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"publish_time":1352038478755,"_cnpm_publish_time":1352038478755,"_hasShrinkwrap":false},"0.2.0":{"name":"toposort","version":"0.2.0","description":"Topological sort of directed ascyclic graphs (like dependecy lists)","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"https://github.com/marcelklehr/node-toposort.git"},"devDependencies":{"vows":"*"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies","acyclic"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","readmeFilename":"README.md","_id":"toposort@0.2.0","dist":{"shasum":"6e26f86ad707c18bdbdca3257dafec703d9364d7","size":2548,"noattachment":false,"key":"/toposort/-/toposort-0.2.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.2.0.tgz"},"_npmVersion":"1.1.64","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"publish_time":1352038370950,"_cnpm_publish_time":1352038370950,"_hasShrinkwrap":false},"0.1.0":{"name":"toposort","version":"0.1.0","description":"Topologically sort directed graphs (like dependecy lists)","main":"index.js","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"repository":{"type":"git","url":"https://github.com/marcelklehr/node-toposort.git"},"keywords":["topological","sort","sorting","graphs","graph","dependency","list","dependencies"],"author":{"name":"Marcel Klehr","email":"mklehr@gmx.net"},"license":"MIT","readmeFilename":"README.md","_id":"toposort@0.1.0","dist":{"shasum":"aaf3c3451b0ab9fba0e59d67953a89928c317267","size":2254,"noattachment":false,"key":"/toposort/-/toposort-0.1.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/toposort/download/toposort-0.1.0.tgz"},"_npmVersion":"1.1.64","_npmUser":{"name":"marcelklehr","email":"mklehr@gmx.net"},"maintainers":[{"name":"marcelklehr","email":"mklehr@gmx.net"}],"directories":{},"publish_time":1351866086533,"_cnpm_publish_time":1351866086533,"_hasShrinkwrap":false}},"readme":"# Toposort\n\nSort directed acyclic graphs\n\n[![Build Status](https://travis-ci.org/marcelklehr/toposort.png)](https://travis-ci.org/marcelklehr/toposort)\n\n## Installation\n\n`npm install toposort` or `component install marcelklehr/toposort`  \n\nthen in your code:\n\n```js\ntoposort = require('toposort')\n```\n\n## Usage\nWe want to sort the following graph.\n\n![graph](https://cdn.rawgit.com/marcelklehr/toposort/8b14e9fd/graph.svg)\n\n```js\n// First, we define our edges.\nvar graph = [\n  ['put on your shoes', 'tie your shoes']\n, ['put on your shirt', 'put on your jacket']\n, ['put on your shorts', 'put on your jacket']\n, ['put on your shorts', 'put on your shoes']\n]\n\n\n// Now, sort the vertices topologically, to reveal a legal execution order.\ntoposort(graph)\n// [ 'put on your shirt'\n// , 'put on your shorts'\n// , 'put on your jacket'\n// , 'put on your shoes'\n// , 'tie your shoes' ]\n```\n\n(Note that there is no defined order for graph parts that are not connected\n -- you could also put on your jacket after having tied your shoes...)\n\n### Sorting dependencies\nIt is usually more convenient to specify *dependencies* instead of \"sequences\".\n```js\n// This time, edges represent dependencies.\nvar graph = [\n  ['tie your shoes', 'put on your shoes']\n, ['put on your jacket', 'put on your shirt']\n, ['put on your shoes', 'put on your shorts']\n, ['put on your jacket', 'put on your shorts']\n]\n\ntoposort(graph) \n// [ 'tie your shoes'\n// , 'put on your shoes'\n// , 'put on your jacket'\n// , 'put on your shirt'\n// , 'put on your shorts' ]\n\n// Now, reversing the list will reveal a legal execution order.\ntoposort(graph).reverse() \n// [ 'put on your shorts'\n// , 'put on your shirt'\n// , 'put on your jacket'\n// , 'put on your shoes'\n// , 'tie your shoes' ]\n```\n\n## API\n\n### toposort(edges)\n\n+ edges {Array} An array of directed edges describing a graph. An edge looks like this: `[node1, node2]` (vertices needn't be strings but can be of any type).\n\nReturns: {Array} a list of vertices, sorted from \"start\" to \"end\"\n\nThrows an error if there are any cycles in the graph.\n\n### toposort.array(nodes, edges)\n\n+ nodes {Array} An array of nodes\n+ edges {Array} An array of directed edges. You don't need to mention all `nodes` here.\n\nThis is a convenience method that allows you to define nodes that may or may not be connected to any other nodes. The ordering of unconnected nodes is not defined.\n\nReturns: {Array} a list of vertices, sorted from \"start\" to \"end\"\n\nThrows an error if there are any cycles in the graph.\n\n## Tests\n\nRun the tests with `node test.js`.\n\n## Legal\n\nMIT License\n","_attachments":{},"homepage":"https://github.com/marcelklehr/toposort#readme","bugs":{"url":"https://github.com/marcelklehr/toposort/issues"},"license":"MIT"}