{"_id":"graph.js","_rev":"51-8f57ed89cb9a650f202f0deb9eff609e","name":"graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","dist-tags":{"latest":"1.21.1"},"versions":{"1.8.0":{"name":"graph.js","version":"1.8.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"licenses":[{"type":"MIT","url":"https://github.com/mhelvens/graph.js/blob/master/LICENSE"}],"dependencies":{"babel":"~4"},"devDependencies":{"babel":"~4","babel-core":"~4","babel-loader":"~4","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.1","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~4","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"a7e946b5043764a48f9a6ced52b18f8cecef91b3","_id":"graph.js@1.8.0","_shasum":"02ea13924769f01b9b3bb50fd5689494fc4ede7c","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"02ea13924769f01b9b3bb50fd5689494fc4ede7c","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.8.0.tgz","integrity":"sha512-qAlJc3sKhopeNOuLfDGJdLe/ssUzdYIIWD8iyKN+T1p8w0tlDN0U+81ZnUG8LM8ZLDj8/gkCqo1O34o8Rko84A==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDq2b01aqiArakPcVj5U15K3NdK9wXMXU7FFOvXHmSdvQIgO3JR4Woq5CQq26sNswYATj+hfDfsIOX5kfmr66PnJB0="}]}},"1.8.1":{"name":"graph.js","version":"1.8.1","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"licenses":[{"type":"MIT","url":"https://github.com/mhelvens/graph.js/blob/master/LICENSE"}],"dependencies":{"babel":"~4"},"devDependencies":{"babel":"~4","babel-core":"~4","babel-loader":"~4","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.1","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~4","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"e24504906b83badfd3264f57185b573c34593dd1","_id":"graph.js@1.8.1","_shasum":"870cb649f07e6068fd539abe16191593170d52f3","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"870cb649f07e6068fd539abe16191593170d52f3","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.8.1.tgz","integrity":"sha512-RwiQao2l0nDoSM0zXuPSet8OzIG8vcEukES0G4P4Uf+kUkDZ9Lo7UDFkVMqSh9jMq8iO/E4m0O3Ym1E+3ah0cA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDhYGn/okaLUQuaQb5tPnybgNeCGHhmLX/8ehudy80RDQIgWCHPbAszEZq/lFwblG6TGQW0JhP3d73iawxF8zWvXOw="}]}},"1.8.2":{"name":"graph.js","version":"1.8.2","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"licenses":[{"type":"MIT","url":"https://github.com/mhelvens/graph.js/blob/master/LICENSE"}],"dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.3","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"d66b73e042ace3c86bdec62ecf9ff838924c7cea","_id":"graph.js@1.8.2","_shasum":"dc7a2029b3835a306bc07a2a46065e60dac85ea6","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"dc7a2029b3835a306bc07a2a46065e60dac85ea6","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.8.2.tgz","integrity":"sha512-Ow2LeUlTk3RGYpiVz6k8+qN8vXBhRcLO1GAK/Psd41FW9djVMqURXh4cZDy6cEbLJnoQoe/4fyQY87P7kiby6A==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIDVikyxrBCaYkaLmUpRG0xs9mfOuiA0YOM3q8b4eOuCwAiEA48Z7DCm0dpdkkwd/PL4daDuo3MtGLodPz4EvOGEH1hc="}]}},"1.9.0":{"name":"graph.js","version":"1.9.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"licenses":[{"type":"MIT","url":"https://github.com/mhelvens/graph.js/blob/master/LICENSE"}],"dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.3","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"e9459a403b27f09db8a5287c2d44f01586c0c6e3","_id":"graph.js@1.9.0","_shasum":"f4f89abdeb095d213d6b54ee9477d79a78b5d6e7","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"f4f89abdeb095d213d6b54ee9477d79a78b5d6e7","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.9.0.tgz","integrity":"sha512-deLWqPRFg57dQiL5Cd3f4nkTN9ER79dWSPLRcpd/pBq79LeL9Bws/4ootInELHIVxS8zUTChWXHswV7KjPXkPQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDDXTAwEMRzV5W54ZjgPUDelqaAAXk+PNQzwgqOisA+cgIgEeS9xvftU/AFTSRSVGuDy0WmqdTYcLuNRHY2e7n6ZOs="}]}},"1.10.0":{"name":"graph.js","version":"1.10.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"licenses":[{"type":"MIT","url":"https://github.com/mhelvens/graph.js/blob/master/LICENSE"}],"dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.3","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"300c117db65cad24950c04eb2bbe1da5d676c42b","_id":"graph.js@1.10.0","_shasum":"21ef65fe7863eabc7c472f8a28d8ba2b292e4bcd","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"21ef65fe7863eabc7c472f8a28d8ba2b292e4bcd","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.10.0.tgz","integrity":"sha512-wqPoACGLc7t14e+eiDLiJ5Eh3g393QsLzQJbhkOwpyogwbwP1b9bcnANRrq698vdjqq48hpbYuckSA8C6RCjPg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCWVFznTAai6a5ieamLgwbPuUetRJx2DJunoy8q9cRWfwIhAKE8hAER9txZKRwAgoIcU9AvvYpR3Ta2RFXQj/BZn1vR"}]}},"1.11.0":{"name":"graph.js","version":"1.11.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"licenses":[{"type":"MIT","url":"https://github.com/mhelvens/graph.js/blob/master/LICENSE"}],"dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.3","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"23e4e6e96e4ab8202bc26a3e765436b526348851","_id":"graph.js@1.11.0","_shasum":"1121fbb3b0c0f6ec8571efc762a46ec89e505c14","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"1121fbb3b0c0f6ec8571efc762a46ec89e505c14","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.11.0.tgz","integrity":"sha512-F+gdRe0R9jO8iCsMZ3nQazNsoD0BxpuORu1hi2sEs7BYm3sEDAum44ag3LrT6LsZey5W2H8z0gVTFyNEFfj6pA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIGyFKTXC7cTaOENn5mQUMJ4m78jpqytbAfNjoTgqDJeZAiEAmYxpbxXJfg0Ax2ZNjM93k/ZOrtBZhRX00+WwttE+qGk="}]}},"1.11.1":{"name":"graph.js","version":"1.11.1","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"licenses":[{"type":"MIT","url":"https://github.com/mhelvens/graph.js/blob/master/LICENSE"}],"dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.3","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"cab060c429b4c1801b391d9c8729ba89757af07d","_id":"graph.js@1.11.1","_shasum":"dba2a5d5463782c7f641edd41d1d21be85e6378d","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"dba2a5d5463782c7f641edd41d1d21be85e6378d","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.11.1.tgz","integrity":"sha512-pDVuDLmhZL1qpaJTG0WVHmDKOYVI9niQQcTs6gPHetsbVUtxg+6nIep7g7+BQVDrNUQYu10qlBGqDEJind1bYA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEW8wHU3PoY4l06gugtgacR3ZBbFOScQMDLJu+qUq79IAiB2+aLOn+bHu9V3/Pa3m33fnPrD2dY3luQGuB5Z9FnIeg=="}]}},"1.12.0":{"name":"graph.js","version":"1.12.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"licenses":[{"type":"MIT","url":"https://github.com/mhelvens/graph.js/blob/master/LICENSE"}],"dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.3","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"c78c3b8a44dc1179cceb962c641887d274a4ec6b","_id":"graph.js@1.12.0","_shasum":"414aa93294799e1d61ccadbf85445a857edf9bb3","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"414aa93294799e1d61ccadbf85445a857edf9bb3","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.12.0.tgz","integrity":"sha512-dfEMelGAb82aiO5NZ9djpOnvgoIQxqK/kr0EZU2YEMjFtlXqWM/ORad4wDPoOYdHSth68R6gPcWcbmKOo6GRWA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICeolBYaIFl1AZMNISn5Whl7urJbZ+l186E7esLaVskEAiBSsknVMWdP05X8dJ6Ejz5Z74EN6N368aUNMA6YaYW3Lg=="}]}},"1.12.1":{"name":"graph.js","version":"1.12.1","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.3","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"4a4197a24c64fec3d85bed4e2d45ae3c47830379","_id":"graph.js@1.12.1","_shasum":"c0c05aab6a2ac453f65bca5b28a4d31166c0a1d0","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"c0c05aab6a2ac453f65bca5b28a4d31166c0a1d0","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.12.1.tgz","integrity":"sha512-Sx/2HOv3pZrtqpML5YnO9pJayOgKhyGQKo8NhyBYs/jmcwG5UFEss2ADrzw+QMphQ/jLZxOUucYKbpFYQtZAtA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDwEjztUC2zP71sGvmRn5ga4kMvllHV1l7lqdkJOTMnwgIhAOM+YUXagm4yPzA9v01hZ99HDnJzBBgrZ7/3IT5qxCcv"}]}},"1.13.0":{"name":"graph.js","version":"1.13.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.3","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"8bca954a686fa98ff1b1ebe4ac040def86e293b0","_id":"graph.js@1.13.0","_shasum":"5f8424bd0084973114c853bb6017842dfc9da2d5","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"5f8424bd0084973114c853bb6017842dfc9da2d5","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.13.0.tgz","integrity":"sha512-HCeKvQ+QdOM7SZVXP05DyW95UmRectBlXXNZ897eSD1IcidyILkEAgGe0OfmJXZVQQ3le+nQrKRirf3yg18rog==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCbhTBgLLSQJ23ywHXqywnx432G8Z4Q/OECHLujLZ4FMwIhANW8rcLyIoh6S5F7XA5FU2x9VwUGegaBLDY4aEKtRemx"}]}},"1.14.0":{"name":"graph.js","version":"1.14.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.3","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"be5f40e61c91dd1979539af33bfcb50287005ef1","_id":"graph.js@1.14.0","_shasum":"4b4554a3d61550ca7b2fb2b576f3e948e52d481a","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"4b4554a3d61550ca7b2fb2b576f3e948e52d481a","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.14.0.tgz","integrity":"sha512-VtD1o8BJSk7S2BUJdI3/OdsNsU+8QusbR7z3+PbudLQ9usor6PIF/hfMJSPupYPdIeAs/r4foZSP7XLd+YfOJA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEnnU8QlAHZKuObpgw7auvJqiGPmspVUuwaGmCaiT6poAiEA5VYu2eKFbsLpKLm+EM8SepvmxD/pKay5N4LLBxl7XOM="}]}},"1.14.1":{"name":"graph.js","version":"1.14.1","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"5da739f3ee253e2a370139cafa73925686d4d7ec","_id":"graph.js@1.14.1","_shasum":"8422011e0ac7e154034069c4a35846068f816c19","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"8422011e0ac7e154034069c4a35846068f816c19","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.14.1.tgz","integrity":"sha512-yDSJ/pH1YPuHL5CdfF4vv7gVb/LMddP5/Cy9A81WhfYYtEQN6BDds7w+dudZ+EB0JElGULa529q1M4wgzoF9Cw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCe2VWHCx2e6rFZrlVgJ61qxQH3Fm8nWsl6RVtN7QXoIwIgZNFKS84OXKmOqPgkRFnR9xUazWNhO9fiPmfX54WnydI="}]}},"1.14.2":{"name":"graph.js","version":"1.14.2","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"ff5c255895a21448f721c2918d9cdcb7470cea22","_id":"graph.js@1.14.2","_shasum":"49c6a6386da896cfc47a7ac695f59e92a5f80acf","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"49c6a6386da896cfc47a7ac695f59e92a5f80acf","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.14.2.tgz","integrity":"sha512-aC9aUe+XUCUDsRjf29PekhgQCuae+fiXWSXbLAxO6JqwNrDYIn/y8jKJ6rtUaMqPxaPKDcaScIsDyAT1O7MrfQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCIamZWWDTlAmQ/nQteL0vSSe2MscvgDYxUFdjRoYJ2IQIhANZmZKNeYVJtzwj3DCkJ+bmTOgbpvXNkp0OTQzMUAu0m"}]}},"1.14.3":{"name":"graph.js","version":"1.14.3","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"49a76bfa668ee7de08ec56d45b4a3e44e6567352","_id":"graph.js@1.14.3","_shasum":"312516e4cd8c8a3e1e5c3dd0984a0b6bb42a7ee4","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"312516e4cd8c8a3e1e5c3dd0984a0b6bb42a7ee4","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.14.3.tgz","integrity":"sha512-MnerLfDKJRUo09zXsfploXbPKE8sw9hRBg8JIrJluJaRVDEJB+O1ivyTj73wV2NL2Tou3595mj7UK7xvy/jCFQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDQW8sQ9OU0CacKqrqhjb4PwfHrgLfNj/Ebi235LlIi0AIhAKP8U0tVN5ya0JH/h62PFlL5OHJvDgRuYLRKNAB2Z3mF"}]}},"1.15.0":{"name":"graph.js","version":"1.15.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"prepublish":"npm run build && npm run docs","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"a17787658defc3e7b04f0d366c5ff97b079f38a7","_id":"graph.js@1.15.0","_shasum":"57aaef33d84276d03a73e0ce728076517fddbe70","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"57aaef33d84276d03a73e0ce728076517fddbe70","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.15.0.tgz","integrity":"sha512-v+IEuVoGX645hsvTTV9Wety0+K38R6A4rcopMMxedwMR2gNE54oblAGLdxL+wIfOO9a1Ic2r4axS8ebxa0u+aA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEglwLacTd36tr7imeBEdJI/jT6wR6Izya2RmnRFbG+DAiEAkNhZsWwZbuqHeHeO2xsC3Gt8grv95caWNG6qGUzSta4="}]}},"1.15.2":{"name":"graph.js","version":"1.15.2","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel":"~5"},"devDependencies":{"babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"58c09d9c3b5ff41cc2f12e0cf1f582934856b339","_id":"graph.js@1.15.2","_shasum":"42606c6c88fb2e31547a13772d130397c66b2aea","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"42606c6c88fb2e31547a13772d130397c66b2aea","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.15.2.tgz","integrity":"sha512-vKWwOyyjdstDGltzHNhh5rreSgk/nQNgQkLM10kzGtlZrl4Cs1UYsaD5E5p/HrilmCRizu4BTbDEgcqDNlfe6A==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCisAzPELDI8tfPPtZs9j4HvAmeM6YmozRFDfJBirfNBQIgPURZ2Zx3WxGaoiibhZZaXOhmNxtpAq0oHkxmXNnRcN4="}]}},"1.16.0":{"name":"graph.js","version":"1.16.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"7a095cc74061686fd30313676b033d7e578461a0","_id":"graph.js@1.16.0","_shasum":"952f2da17592edcb2349086e7f78fa9a1650fab9","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"952f2da17592edcb2349086e7f78fa9a1650fab9","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.16.0.tgz","integrity":"sha512-NzvRxtmWn5wBuZ/WtB0LsYLKaBCG3H8ic1xG28KUHqndqb+cbz2y3ziqgU4Ra8ZB5HWfr2bmeJQwEG3WkGXKsg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDzBu9H/W0BqhnvMiKSTihWEFo+ge/RsjAheKLAC0FdLgIgWEfy2nQPXHChN1FlCviXx+yA5v+WxjjHe4vmVVNXJ+o="}]}},"1.16.1":{"name":"graph.js","version":"1.16.1","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"4a23b0c77b9f04fb05c874dea2c9495421ab0e46","_id":"graph.js@1.16.1","_shasum":"231c23880046f4f4443d7b750c8cfd4fb67b43b0","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"231c23880046f4f4443d7b750c8cfd4fb67b43b0","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.16.1.tgz","integrity":"sha512-JXCOvsCO+292Wqy83iEdxrcUqt7aGiUDqAc6f/s1t6nbRf82eY4nV/eKM45+cY/pxwMxf15f0QkxSCUc8vuHLw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIG/+Oa0ST/9586gCeilddQegS/BZheLQ0EBxC4g/R1cCAiBCYreY7Qsk0x0Bz7gI/etBHSTEFuD8Q8eXfvElIDrZYA=="}]}},"1.17.0":{"name":"graph.js","version":"1.17.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"770a47f886f8c2e9ddc348b1f3ae20a7a26cb379","_id":"graph.js@1.17.0","_shasum":"7dcb7a3b25f5c1c27d92b9deae19bba1e9c99911","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"7dcb7a3b25f5c1c27d92b9deae19bba1e9c99911","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.17.0.tgz","integrity":"sha512-nNoOCg5bnFRfshqumGlJ0XDPoesgpZGyKVGj8BeosRwILGGuZBKGrdv1KXJacFPHwQlu2O52W1u3zfEegPMbZg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHIL90iEsJABI486fY+nVfMgxpEAestK7jqzvZeS6WbCAiEA49OEZqLvmCIku0vAsoy4jpNPyyoTxgJlTWfUUxoce+o="}]}},"1.17.1":{"name":"graph.js","version":"1.17.1","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"git+https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"a6bfbd0daefabbbbe129572f3ebe88855024d567","_id":"graph.js@1.17.1","_shasum":"843fd7282c4f35b461dee9c0a05598e7fadf210b","_from":".","_npmVersion":"2.9.0","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"843fd7282c4f35b461dee9c0a05598e7fadf210b","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.17.1.tgz","integrity":"sha512-e9CRNnptunJIKxojBAyMHvG3Gw3boEhkbuGQpuih8brrFmK7NCDqSuQVtdRhfiwqjDPTb+yPklIsyC4I7mq0Tw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCHwiRDZk072anbYwN7MHogeXOsfmev9ury8RaDrRDpAgIgWZJUMBupc19cJ77mRJrVvFkf1bnzG+QilQIrUwp1BA0="}]}},"1.19.0":{"name":"graph.js","version":"1.19.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"2f86025011df56fe5a343defd9e911cd89168f9b","_id":"graph.js@1.19.0","_shasum":"bc0f0320c0acf4ff114df6acc46f5287c1c6a20f","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"bc0f0320c0acf4ff114df6acc46f5287c1c6a20f","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.19.0.tgz","integrity":"sha512-GYiNkNIRp7pBPkgfOK4d/bKmaSXqgh/haLffoXAW4M/z1ubkf/9muzpSuJvGIYYZbFmxaZYMmbzyKr/X5atZVQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCbfy9GfJyLuiK2jL9xq5htpbtynnSExzEMX2p+Mk7HwgIhAOouJhMcxINjc8ECTlfht4AECyv7jqrruC8uJUESpGLw"}]}},"1.20.1":{"name":"graph.js","version":"1.20.1","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"6773cde737aec724496fbff61defffa1c0b499e0","_id":"graph.js@1.20.1","_shasum":"d2043f6bb2577a43ada23f1f09ca24e8ba2fff41","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"d2043f6bb2577a43ada23f1f09ca24e8ba2fff41","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.20.1.tgz","integrity":"sha512-Y1bNWjcQINDJD2JAaf60IfjhME11h9fBcQfiJOdxj1Estj9CKUCr6JSwXjW83ZnbBrEER6vfQ7ivPWPPVt3Idw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCxwEsRCprl8Ymvnqwbp8IUeB8yDMilI3lXQ5KJFpkVWgIgCOI41N4YCpP5a1Pp+qAytMxiNeORPrT97TETKOmNqgs="}]}},"2.0.0-alpha-1":{"name":"graph.js","version":"2.0.0-alpha-1","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"f6bff451b88b6b02dde0d771f2d754ad3c8cfa73","_id":"graph.js@2.0.0-alpha-1","_shasum":"4125f4eb7d8a9154a43d52c113cd5bd1eca27df0","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"4125f4eb7d8a9154a43d52c113cd5bd1eca27df0","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-2.0.0-alpha-1.tgz","integrity":"sha512-9gIblKNg7JsHakXM2NMotnf3me/apnn0aztmdNOw00P45JnHTLfGPGwx6wm1FRDjRPsYENODFeKHB/VrQODzXw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIDCXuivn3md5R3Y645oapwkcDk4hgE7gZP3kJyYJTBKKAiA5eNCYnd36W1uE+bW6N7S84uZOZD/khzRjLXTtHk4Ong=="}]}},"2.0.0-alpha-2":{"name":"graph.js","version":"2.0.0-alpha-2","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/*.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"fc4c3560129f04d8a86c78b758467afb73353f00","_id":"graph.js@2.0.0-alpha-2","_shasum":"c8819fc01058d31c50526384a7603a713a4c0b72","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"c8819fc01058d31c50526384a7603a713a4c0b72","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-2.0.0-alpha-2.tgz","integrity":"sha512-EchEH6fWgY/G9cbSSB/v+tgF1gqTPdsskUFvj2UQpKNucKtl9SC2oHsaRAT20s/v/BDGEtL0Q99U1+4dCtzxcQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIAI2Ej03vD5KPJRi7MyTC1SsGF31Lzi5yq5y1+DpShUPAiASgZ+/cdY7Jwx7uvt6ujv4qBBtF9EAbXfjM0SBpvb39g=="}]}},"2.0.0-alpha-3":{"name":"graph.js","version":"2.0.0-alpha-3","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/*.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"11d1e32e90d131287312830c013a331939a4eea4","_id":"graph.js@2.0.0-alpha-3","_shasum":"8ddfe1f3edcd4cbc8254c0ebd037871d4de6c3b2","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"8ddfe1f3edcd4cbc8254c0ebd037871d4de6c3b2","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-2.0.0-alpha-3.tgz","integrity":"sha512-cEv9JBVwsJ2IFMUkOnRGTOCKKnW/xdO9YTYSJ+5JpVwL+w0h5O1Z6eUqmkgMs9pS3Xue8CIz1HJ5x3skqrHEYg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHe9itC8J+jjzIFHXB7z6miw6a9oThOqZrxW/sLiih7vAiBWrOAmC7cWlBayFgfhkIYKdqNwHiN1aaIEfh2u7b+0QQ=="}]}},"2.0.0-alpha-4":{"name":"graph.js","version":"2.0.0-alpha-4","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/*.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"ffbbacb62f2fa83375b0550c63b00fa223fbe39c","_id":"graph.js@2.0.0-alpha-4","_shasum":"c7100d091b9babac64da0491ee7132b4859f714c","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"c7100d091b9babac64da0491ee7132b4859f714c","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-2.0.0-alpha-4.tgz","integrity":"sha512-3UmrJOL9gjtsAYU67Ce+yuN+UF2nly6SIyRT+VV4z2xC1UAuYvpKWxScA2R1ekILHBBOLr448IoyRgKDXcWi9A==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGV8JDKzBvnwvsBQADpmPIJ3OO4kb23QWWirMzFtXU80AiBaCEbrsddyy2saXUaOschMPIhVvn6MEAleUhcO3FXTuw=="}]}},"2.0.0-alpha-5":{"name":"graph.js","version":"2.0.0-alpha-5","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/*.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"206291543283193990cdbf5f467443f13c4baef7","_id":"graph.js@2.0.0-alpha-5","_shasum":"5ffe22680681a78540ea4f1323358ef25f3fe4a2","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"5ffe22680681a78540ea4f1323358ef25f3fe4a2","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-2.0.0-alpha-5.tgz","integrity":"sha512-3UmPXKgATNvB7ykf+6TQm99Kizd8CquIPpqQPVSCxAv2eu77AprIZICWr658/Ud9mydBnyQDtEyraMNlMp1qfQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCUam6dpmEYxoD2AKBnneC6oimWIigB7j/xnJOP5k1d3QIgH+vc8gsPZea8fUbj675QH9YZw9JPG2rhqpwJla/jg8c="}]}},"2.0.0-alpha-6":{"name":"graph.js","version":"2.0.0-alpha-6","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/*.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"d0dc63a0c5fd4e5f9c9a2c7b2480e7b3eaaa9aac","_id":"graph.js@2.0.0-alpha-6","_shasum":"22648890ad8b7d847b0941992f0ecc6c103f1fd5","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"22648890ad8b7d847b0941992f0ecc6c103f1fd5","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-2.0.0-alpha-6.tgz","integrity":"sha512-wLG3E0AFJiDywuNZcqOrHPXoXvYWeKkNlG8aEI+enkg9HEv0w1oFjPuUalxMNadWcuSpKvn3kY81B+p3OoI46w==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCkRPWBzFy+BDejJ+KIKC/4ZRnqWtd9BIIF8rZZ/ep2YwIgcyydl9/ZH68PuwoSbq0o3uSixEpEOJd4J6POOW1PvG4="}]}},"2.0.0-alpha-7":{"name":"graph.js","version":"2.0.0-alpha-7","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/*.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"65e46965b0b516fb3fc14753d78be4602a66fca2","_id":"graph.js@2.0.0-alpha-7","_shasum":"ec7353e2f88106a60f5d8817e9bc16ff6a9fcfac","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"ec7353e2f88106a60f5d8817e9bc16ff6a9fcfac","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-2.0.0-alpha-7.tgz","integrity":"sha512-gNnSxEJC23Txu1H+XpWWENTZkzt6a4rT6cAaj349cJ7grwU/DHwQJ1xRG9rYrTxa3L78JJQz4BXPx+TkSBQZKg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHQqjV7IrQ8a4S3sIL48fhN90HFUSmbdJOp0VdWAnCy7AiAkXMYko5mblymUhym2nsVcoeLFO5LX72PjNtT9VfkksA=="}]}},"2.0.0-alpha-8":{"name":"graph.js","version":"2.0.0-alpha-8","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/*.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"8539d6aaeed63014e792bf32b90c875de97568be","_id":"graph.js@2.0.0-alpha-8","_shasum":"82029df18235b6fb109619e91a50cc23c4c48b13","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"82029df18235b6fb109619e91a50cc23c4c48b13","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-2.0.0-alpha-8.tgz","integrity":"sha512-uebmdIJXlBO6p8PZrKc7bhRd5BUBMkC18yAi6FEQSacsnRT4Ad1AxEY9A2WYIYSg3T8LYk+suNhdXZ64BnKJUw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFi1VBzUenzh7DHxv0WZQmsZ9v8WDHiez8HkKkmCIazbAiBRvRRIU6rgldO7BCKYyBwqQBka196/z5XhPgB4XhuRzQ=="}]}},"2.0.0-alpha-9":{"name":"graph.js","version":"2.0.0-alpha-9","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/*.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"e6bd9a7dd4e65491046a8ef79862d7436d87763f","_id":"graph.js@2.0.0-alpha-9","_shasum":"a6d674f95d9178b826ee14c44a813dff1e8608af","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"a6d674f95d9178b826ee14c44a813dff1e8608af","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-2.0.0-alpha-9.tgz","integrity":"sha512-Lm9h1heVFMCh3I59CZlylMHjaYqIc2p0QH94gJFyZvuYU4ZyQLdx9pPq8I8bGx3ELk6xBJPgNiH2V504fc5DPQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICNngmWgDc4JITJEekjh5Gj58bltkkyEXM+Hhe2Dy4R+AiEAtkB6h1cRJ5oGdS+HS+XWFujghsDSiUMYj0ivHKAg1dI="}]}},"1.20.2":{"name":"graph.js","version":"1.20.2","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"ca1fac3a40aaffed76036e115a08365e8c97caf2","_id":"graph.js@1.20.2","_shasum":"c1de2dced2b162ec642698b69f40a16d0a21e918","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"c1de2dced2b162ec642698b69f40a16d0a21e918","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.20.2.tgz","integrity":"sha512-ihGWZd85CsWUZDgeOG6g+WdWF1EXIakeo3IqRmsamJ2gf8FQLmsKEjA34yu7f18OnaAT1WO5F3RAF+L1tRTT/g==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHazWo1rsba2r9byynUgK2V8pGpcba/H+/Z47RFFMn5AAiEA+jdSUgESSYqKrdXbkBblP5bhYcNXu2e9jr6G/pBTL58="}]}},"1.20.3":{"name":"graph.js","version":"1.20.3","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.12","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"00ed8629bcbd1e77ed133594be2e0aa8fe47a260","_id":"graph.js@1.20.3","_shasum":"941b6855259608b3970de95e610f9c70aebfe4c1","_from":".","_npmVersion":"2.7.5","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"941b6855259608b3970de95e610f9c70aebfe4c1","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.20.3.tgz","integrity":"sha512-nmE6NKbGq+EyIgvLRd2uO+XkSZ1UNC5tW92GUcvXaH5GopdPGO3J6fLKcw/Hjnk8Ie0aOaQuCEs9nqTaD4y6aQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIQDnKmStFB4r37t4QZ6rpT525NQhz66pjNNzerUW82FNsgIfInmb3dW/L7SUfVv9Gy4S0HjYeJQknjwQD3717YplgQ=="}]}},"1.20.4":{"name":"graph.js","version":"1.20.4","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"git+https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.13","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"081f11e5bb59766a15c795ad7d2917b121b58032","_id":"graph.js@1.20.4","_shasum":"4872e8ab0690a486ad2e3decee898d45e78cfbff","_from":".","_npmVersion":"2.8.3","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"4872e8ab0690a486ad2e3decee898d45e78cfbff","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.20.4.tgz","integrity":"sha512-R7ulDbWsZZYe/FVe8Npy1WiVVHI1xh8Bz5sM19DhCQOFJtgxs5RIL5W/Cz8gwJq4CxWeOjkPweP9ZMckZyQTJA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEYxSoznrtNjLyrHbG5HLwLjbas/BYPqa13/quYowC9ZAiAtAwXC2ML8M4+XhlTOhtZ/xlQm0Gt3Sksx+FDV6RuAGA=="}]}},"1.20.6":{"name":"graph.js","version":"1.20.6","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"git+https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.13","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"1e4900f9785567b7185ec82e4e7fb24b4f3afcae","_id":"graph.js@1.20.6","_shasum":"38711b2904ffec4fe729310fcfefff0683423a3a","_from":".","_npmVersion":"2.8.3","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"38711b2904ffec4fe729310fcfefff0683423a3a","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.20.6.tgz","integrity":"sha512-oYjgcBRYk8tuWBZPviM0FcQ77JxbKZ8YeuyI/3GlKwnTwfYdM+4K+PxA+IjVsodRTSCF/CIVBrzkoZFt/qHNUw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCW552K1asDUI9Gsj/mmgXB/JsIPVafvFeDkFluvLEajAIhANv3YCW4G6cS7w0olbOvxhNpNr8ZSSFEJXfEbrv0YTBj"}]}},"1.20.10":{"name":"graph.js","version":"1.20.10","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"git+https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","dependencies":{"babel-core":"~5"},"devDependencies":{"babel":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"~1","karma":"~0.13","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"52000909beb5dc1082e3f2fb5ce8ee0ee872ad4c","_id":"graph.js@1.20.10","_shasum":"941c8ed0dc0cc6051b07ed25be67d5f291441ef8","_from":".","_npmVersion":"2.8.3","_nodeVersion":"0.12.2","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"dist":{"shasum":"941c8ed0dc0cc6051b07ed25be67d5f291441ef8","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.20.10.tgz","integrity":"sha512-bB7WuJoAcJQGah1rcPPGZ4wzVLUmwx5+hh9Q/Ry+chyYddbtAFmR0jcE3RoBuckajvZUFO+ozG9dk3rXB6rFpA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICrWbg37JUtJcXFTwGPIUMntIgmrum7lZ3px2kBFitbVAiBerTlM7E0zAyb/d0t6SFKQRrgMC8F6jtsrsiW+2Vh0gA=="}]}},"1.20.12":{"name":"graph.js","version":"1.20.12","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"git+https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","devDependencies":{"babel":"~5","babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"1.3.3","karma":"~0.13","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","mversion":"^1.10.1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"046b13627590b4cf332ae952d210e53d6b7e7b56","_id":"graph.js@1.20.12","_shasum":"3aeaa4e4c8d30ff5c9e53f6ea0e2a0697c378495","_from":".","_npmVersion":"3.6.0","_nodeVersion":"5.7.1","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"dist":{"shasum":"3aeaa4e4c8d30ff5c9e53f6ea0e2a0697c378495","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.20.12.tgz","integrity":"sha512-pJ65mJgbY/dHm0ZpQapD/kIdgzPHwXW6P9cz7sb8VWIOPr7gZpSPMfLxCTjB2c5U5wcYcAbbbNirxMvqVlCl4g==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHO792uRo64Qqk1q+k+Y73N+lv/YU2xnS73SNtArniuvAiEA7GRJBLM1/abH2TRb7M6vjt+gnT5iNwYeh3QchTJnrpI="}]},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"_npmOperationalInternal":{"host":"packages-12-west.internal.npmjs.com","tmp":"tmp/graph.js-1.20.12.tgz_1477266726052_0.10927625582553446"}},"1.21.0":{"name":"graph.js","version":"1.21.0","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"git+https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","devDependencies":{"babel":"~5","babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"1.3.3","karma":"~0.13","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","mversion":"^1.10.1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"4d268d41afd38709b13f0cf5d77a8216dec7a93a","_id":"graph.js@1.21.0","_shasum":"ecd197ca34662956fc2977db5aeb3d0cc0a5101d","_from":".","_npmVersion":"3.6.0","_nodeVersion":"5.7.1","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"dist":{"shasum":"ecd197ca34662956fc2977db5aeb3d0cc0a5101d","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.21.0.tgz","integrity":"sha512-BKPOGlXLrLK3MwgQYbiG4zDh5YMomohlQSRZH111brhFMJBzTMTZ81BIpzvYENfYaZqhUVJVA77kDQWsw8wGFA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIDlDN6Xx6FKvU3tZ8af5LzawqdPpvpbUm5YSyCSVKDFOAiEAqkzvTbCSY8ieh/+TDelTp25Ss/7p5SQguLUMDl9ewrg="}]},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"_npmOperationalInternal":{"host":"packages-18-east.internal.npmjs.com","tmp":"tmp/graph.js-1.21.0.tgz_1483064622554_0.9381382733117789"}},"1.21.1":{"name":"graph.js","version":"1.21.1","title":"Javascript Graph Datastructure","homepage":"https://github.com/mhelvens/graph.js","description":"a javascript library for storing arbitrary data in mathematical (di)graphs, as well as traversing and analyzing them in various ways (ECMAScript 6 Ready)","main":"dist/graph.es6.js","author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"git+https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"license":"MIT","devDependencies":{"babel":"~5","babel-core":"~5","babel-loader":"~5","bower":"~1","isparta":"~2","isparta-instrumenter-loader":"~0.2","istanbul":"~0.3","jasmine-core":"~2","jsdoc":"~3","jsdoc-to-markdown":"1.3.3","karma":"~0.13","karma-babel-preprocessor":"~5","karma-cli":"~0.0","karma-coverage":"~0.2","karma-coveralls":"~0.1","karma-jasmine":"~0.3","karma-phantomjs-launcher":"~0.1","karma-sourcemap-loader":"~0.3","karma-webpack":"~1","mversion":"^1.10.1","phantomjs-polyfill":"*","uglifyjs":"~2","wallaby-webpack":"~0","webpack":"~1"},"scripts":{"pp":"npm run build && npm run docs && npm run test","build":"mkdir -p dist && cp src/graph.es6.js dist && webpack && uglifyjs dist/graph.js -mo dist/graph.min.js --in-source-map dist/graph.js.map --source-map dist/graph.min.js.map && uglifyjs dist/graph.full.js -mo dist/graph.full.min.js --in-source-map dist/graph.full.js.map --source-map dist/graph.full.min.js.map","test":"karma start","test-ci":"karma start ./karma.ci.conf.js","docs":"jsdoc2md src/**/*.es6.js -t docs/README.md.hbs -d 3 --partial \"./docs/partials/**/*.hbs\" --separators -l JavaScript > README.md"},"contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"gitHead":"c2dd9b82101b05a0439f957c64ff94208b657630","_id":"graph.js@1.21.1","_shasum":"7e0354b41f7494dfd1869b9dec1b77ef30653853","_from":".","_npmVersion":"3.6.0","_nodeVersion":"5.7.1","_npmUser":{"name":"mhelvens","email":"mhelvens@gmail.com"},"dist":{"shasum":"7e0354b41f7494dfd1869b9dec1b77ef30653853","tarball":"https://registry.npmjs.org/graph.js/-/graph.js-1.21.1.tgz","integrity":"sha512-h37V3CoVDdsuzpKAzjyrcgnKBqjBAB6EnncJCx+d42o6XX9a+eOrvtBjW+LM7vxVr3dBtUcIIaSsKCTyAi1kew==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCTnrrj408AYxyNKpKq4jmhXQ/6eBL/tYoG4ZMgjRB7lwIgcsw8JV64zMIyV9v1B1a5uvvPellDRr92VQV3zJ29eVE="}]},"maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"_npmOperationalInternal":{"host":"packages-12-west.internal.npmjs.com","tmp":"tmp/graph.js-1.21.1.tgz_1483065384083_0.8202048405073583"}}},"readme":"graph.js\n========\n[![Build Status](http://img.shields.io/travis/mhelvens/graph.js.svg)](https://travis-ci.org/mhelvens/graph.js?branch=master)\n[![Coverage Status](http://img.shields.io/coveralls/mhelvens/graph.js.svg)](https://coveralls.io/r/mhelvens/graph.js?branch=master)\n[![npm](https://img.shields.io/npm/v/graph.js.svg)](https://www.npmjs.com/package/graph.js)\n[![Bower](https://img.shields.io/bower/v/graph.js.svg)](http://bower.io/search/?q=graph.js)\n\n*formerly known as js-graph*\n\n`graph.js` is a javascript library for storing arbitrary data in mathematical (di)graphs,\nas well as traversing and analyzing them in various ways. It was originally created to\ntrack dependencies between options and modules. It is written in ECMAScript 6, but\nauto-generated ECMAScript 5 versions are shipped with it.\n\nFeedback of any kind (questions, issues, pull requests) is greatly appreciated.\n\n\nInstalling graph.js\n-------------------\n\nWhen running in an ECMAScript 5 environment, this library depends on the\n[Babel ES6 polyfill](https://babeljs.io/docs/usage/polyfill).\nFor your convenience, a standalone version of graph.js is available,\nwhich has the polyfill already baked in.\n\ngraph.js is available from [NPM](https://www.npmjs.org) and [Bower](http://bower.io):\n\n```shell\nnpm install graph.js --save\n```\n\n```shell\nbower install graph.js --save\n```\n\nThe Babel polyfill is [not distributed through Bower](https://github.com/babel/babel/issues/315).\nSo Bower users have to either use the standalone version of graph.js, or get the polyfill from\nsomeplace else, like NPM.\n\n\nLoading graph.js\n----------------\n\nThe graph.js library supports all popular module systems:\n[ECMAScript 6](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/import),\nCommonJS ([Node.js](https://nodejs.org),\n          [IO.js](https://iojs.org),\n          [browserify](http://browserify.org),\n          [webpack](http://webpack.github.io)),\nAMD ([RequireJS](http://requirejs.org)),\nand good old-fashioned [HTML script tags](https://developer.mozilla.org/en/docs/Web/HTML/Element/script).\n\n```javascript\nimport Graph from 'graph.js'; // the ES6 version is default\n// use Graph\n```\n\n```javascript\nvar Graph = require('graph.js/dist/graph.full.js');\n// use Graph\n```\n\n```javascript\nrequirejs(['graph.js/dist/graph.full.js'], function (Graph) {\n    // use Graph\n});\n```\n\n```html\n<script src=\"graph.js/dist/graph.full.js\"></script>\n<script>\n    // use Graph\n</script>\n```\n\nThe `dist` directory offers different files for use in different circumstances.\nUse the following table to determine which file to use in your situation.\n\n| File                                    | Description                                                                                 |\n| --------------------------------------- | ------------------------------------------------------------------------------------------- |\n| `graph.es6.js`                          | for use in an ECMAScript 6 context, e.g., a modern browser or transpiler                    |\n| `graph.js`,<br>`graph.min.js`           | requires you to load the [Babel polyfill](https://babeljs.io/docs/usage/polyfill/) yourself |\n| `graph.full.js`,<br>`graph.full.min.js` | already includes the Babel polyfill                                                         |\n\nIf you don't know which you need, you probably want `graph.full.js`, because it will work out-of-the-box.\nBut it is generally more elegant to load the polyfill yourself, especially if you use other libraries that\nalso depend on it.\n\n\nAPI Documentation\n-----------------\n\n\n* [Graph](#Graph)\n    * [new Graph(...parts)](#new_Graph_new)\n    * <ins><b>instance</b></ins>\n    * [.on(event, handler)](#Graph+on)\n    * [.off(event, handler)](#Graph+off)\n    * [.addNewVertex(key, [value])](#Graph+addNewVertex)\n    * [.setVertex(key, [value])](#Graph+setVertex)\n    * [.ensureVertex(key, [value])](#Graph+ensureVertex)\n    * [.addVertex(key, [value])](#Graph+addVertex)\n    * [.removeExistingVertex(key)](#Graph+removeExistingVertex)\n    * [.destroyExistingVertex(key)](#Graph+destroyExistingVertex)\n    * [.removeVertex(key)](#Graph+removeVertex)\n    * [.destroyVertex(key)](#Graph+destroyVertex)\n    * [.vertexCount()](#Graph+vertexCount) ⇒ <code>number</code>\n    * [.hasVertex(key)](#Graph+hasVertex) ⇒ <code>boolean</code>\n    * [.vertexValue(key)](#Graph+vertexValue) ⇒ <code>\\*</code>\n    * [.addNewEdge(from, to, [value])](#Graph+addNewEdge)\n    * [.createNewEdge(from, to, [value])](#Graph+createNewEdge)\n    * [.setEdge(from, to, [value])](#Graph+setEdge)\n    * [.spanEdge(from, to, [value])](#Graph+spanEdge)\n    * [.addEdge(from, to, [value])](#Graph+addEdge)\n    * [.ensureEdge(from, to, [value])](#Graph+ensureEdge)\n    * [.createEdge(from, to, [value])](#Graph+createEdge)\n    * [.removeExistingEdge(from, to)](#Graph+removeExistingEdge)\n    * [.removeEdge(from, to)](#Graph+removeEdge)\n    * [.edgeCount()](#Graph+edgeCount) ⇒ <code>number</code>\n    * [.hasEdge(from, to)](#Graph+hasEdge) ⇒ <code>boolean</code>\n    * [.edgeValue(from, to)](#Graph+edgeValue) ⇒ <code>\\*</code>\n    * [.vertices()](#Graph+vertices) ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\n    * [.@@iterator()](#Graph+@@iterator) ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\n    * [.edges()](#Graph+edges) ⇒ <code>Iterator.&lt;string, string, \\*&gt;</code>\n    * [.verticesFrom(from)](#Graph+verticesFrom) ⇒ <code>Iterator.&lt;string, \\*, \\*&gt;</code>\n    * [.verticesTo(to)](#Graph+verticesTo) ⇒ <code>Iterator.&lt;string, \\*, \\*&gt;</code>\n    * [.verticesWithPathFrom(from)](#Graph+verticesWithPathFrom) ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\n    * [.verticesWithPathTo(to)](#Graph+verticesWithPathTo) ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\n    * [.sources()](#Graph+sources) ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\n    * [.sinks()](#Graph+sinks) ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\n    * [.vertices_topologically()](#Graph+vertices_topologically) ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\n    * [.clearEdges()](#Graph+clearEdges)\n    * [.clear()](#Graph+clear)\n    * [.equals(other, [eqV], [eqE])](#Graph+equals) ⇒ <code>boolean</code>\n    * [.cycles()](#Graph+cycles) ⇒ <code>Iterator.&lt;Array.&lt;string&gt;&gt;</code>\n    * [.cycle()](#Graph+cycle) ⇒ <code>Array</code>\n    * [.hasCycle()](#Graph+hasCycle) ⇒ <code>boolean</code>\n    * [.paths(from, to)](#Graph+paths) ⇒ <code>Iterator.&lt;Array.&lt;string&gt;&gt;</code>\n    * [.path(from, to)](#Graph+path) ⇒ <code>Array</code>\n    * [.hasPath(from, to)](#Graph+hasPath) ⇒ <code>boolean</code>\n    * [.outDegree(key)](#Graph+outDegree) ⇒ <code>number</code>\n    * [.inDegree(key)](#Graph+inDegree) ⇒ <code>number</code>\n    * [.degree(key)](#Graph+degree) ⇒ <code>number</code>\n    * [.mergeIn(other, [mV], [mE])](#Graph+mergeIn)\n    * [.clone([trV], [trE])](#Graph+clone) ⇒ <code>[Graph](#Graph)</code>\n    * [.transitiveReduction([trV], [trE])](#Graph+transitiveReduction) ⇒ <code>[Graph](#Graph)</code>\n    * [.contractPaths([isNexus])](#Graph+contractPaths)\n    * [.toJSON()](#Graph+toJSON)\n    * [\"vertex-added\"](#Graph+event_vertex-added)\n    * [\"vertex-removed\"](#Graph+event_vertex-removed)\n    * [\"vertex-modified\"](#Graph+event_vertex-modified)\n    * [\"edge-added\"](#Graph+event_edge-added)\n    * [\"edge-removed\"](#Graph+event_edge-removed)\n    * [\"edge-modified\"](#Graph+event_edge-modified)\n    * <ins><b>static</b></ins>\n    * [.fromJSON()](#Graph.fromJSON)\n    * [.VertexExistsError](#Graph.VertexExistsError) ⇐ <code>Error</code>\n        * [.vertices](#Graph.VertexExistsError+vertices) : <code>Set.&lt;Array&gt;</code>\n    * [.VertexNotExistsError](#Graph.VertexNotExistsError) ⇐ <code>Error</code>\n        * [.vertices](#Graph.VertexNotExistsError+vertices) : <code>Set.&lt;string&gt;</code>\n    * [.EdgeExistsError](#Graph.EdgeExistsError) ⇐ <code>Error</code>\n        * [.edges](#Graph.EdgeExistsError+edges) : <code>Set.&lt;Array&gt;</code>\n    * [.EdgeNotExistsError](#Graph.EdgeNotExistsError) ⇐ <code>Error</code>\n        * [.edges](#Graph.EdgeNotExistsError+edges) : <code>Set.&lt;Array.&lt;string&gt;&gt;</code>\n    * [.HasConnectedEdgesError](#Graph.HasConnectedEdgesError) ⇐ <code>[EdgeExistsError](#Graph.EdgeExistsError)</code>\n        * [.vertex](#Graph.HasConnectedEdgesError+vertex) : <code>string</code>\n        * [.edges](#Graph.EdgeExistsError+edges) : <code>Set.&lt;Array&gt;</code>\n    * [.CycleError](#Graph.CycleError) ⇐ <code>Error</code>\n        * [.cycle](#Graph.CycleError+cycle) : <code>Array.&lt;string&gt;</code>\n    * [.BranchlessCycleError](#Graph.BranchlessCycleError) ⇐ <code>[CycleError](#Graph.CycleError)</code>\n        * [.cycle](#Graph.CycleError+cycle) : <code>Array.&lt;string&gt;</code>\n\n\n-----\n\n<a name=\"Graph\"></a>\n### Graph\nThe main class of this library, to be used for representing a mathematical (di)graph.\n\n\n-----\n\n<a name=\"new_Graph_new\"></a>\n#### new Graph(...parts)\nConstructor arguments can be used to supply initial vertices and edges.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| ...parts | <code>Array.&lt;Array&gt;</code> | a short notation for vertices and edges to initially add to the graph;        A vertex should be an array of the form `[key, value]`.        An edge should be an array of the form `[[from, to], value]`.        Later values of vertices or edges in this list will overwrite earlier        values, but vertices need not precede their edges. Vertices that are        connected but store no value need not be listed at all. |\n\n**Example**  \n```JavaScript\nvar map = new Graph(\n    ['Amsterdam',             { population: 825000 }], // vertex\n    ['Leiden',                { population: 122000 }], // vertex\n    [['Amsterdam', 'Leiden'], { distance:   \"40km\" }]  // edge\n);\n```\n\n-----\n\n<a name=\"Graph+on\"></a>\n#### *graph*.on(event, handler)\nRegister an event handler.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| event | <code>string</code> | the event to listen for |\n| handler | <code>function</code> | the function to call for each such event fired, receiving its corresponding value |\n\n\n-----\n\n<a name=\"Graph+off\"></a>\n#### *graph*.off(event, handler)\nDeregister a previously registered event handler.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| event | <code>string</code> | the event used to originally register a handler |\n| handler | <code>function</code> | the handler originally registered |\n\n\n-----\n\n<a name=\"Graph+addNewVertex\"></a>\n#### *graph*.addNewVertex(key, [value])\nAdd a new vertex to this graph.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key with which to refer to this new vertex |\n| [value] | <code>\\*</code> | the value to store in this new vertex |\n\n**Throws**:\n\n- <code>[VertexExistsError](#Graph.VertexExistsError)</code> if a vertex with this key already exists\n\n\n-----\n\n<a name=\"Graph+setVertex\"></a>\n#### *graph*.setVertex(key, [value])\nSet the value of an existing vertex in this graph.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key belonging to the vertex |\n| [value] | <code>\\*</code> | the value to store in this vertex |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if a vertex with this key does not exist\n\n\n-----\n\n<a name=\"Graph+ensureVertex\"></a>\n#### *graph*.ensureVertex(key, [value])\nMake sure a vertex with a specific key exists in this graph. If it already exists,\ndo nothing. If it does not yet exist, add a new vertex with the given value.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key for the vertex |\n| [value] | <code>\\*</code> | the value to store if a new vertex is added |\n\n\n-----\n\n<a name=\"Graph+addVertex\"></a>\n#### *graph*.addVertex(key, [value])\nAdd a new vertex to this graph. If a vertex with this key already exists,\nthe value of that vertex is overwritten.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key with which to refer to this new vertex |\n| [value] | <code>\\*</code> | the value to store in this new vertex |\n\n\n-----\n\n<a name=\"Graph+removeExistingVertex\"></a>\n#### *graph*.removeExistingVertex(key)\nRemove an existing vertex from this graph.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key of the vertex to remove |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if a vertex with this key does not exist\n- <code>[HasConnectedEdgesError](#Graph.HasConnectedEdgesError)</code> if there are still edges connected to this vertex\n\n\n-----\n\n<a name=\"Graph+destroyExistingVertex\"></a>\n#### *graph*.destroyExistingVertex(key)\nRemove an existing vertex from this graph, as well as all edges connected to it.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key of the vertex to remove |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if a vertex with this key does not exist\n\n\n-----\n\n<a name=\"Graph+removeVertex\"></a>\n#### *graph*.removeVertex(key)\nRemove an existing vertex from this graph.\nIf a vertex with this key does not exist, nothing happens.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key of the vertex to remove |\n\n**Throws**:\n\n- <code>[HasConnectedEdgesError](#Graph.HasConnectedEdgesError)</code> if there are still edges connected to this vertex\n\n\n-----\n\n<a name=\"Graph+destroyVertex\"></a>\n#### *graph*.destroyVertex(key)\nRemove a vertex from this graph, as well as all edges connected to it.\nIf a vertex with this key does not exist, nothing happens.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key of the vertex to remove |\n\n\n-----\n\n<a name=\"Graph+vertexCount\"></a>\n#### *graph*.vertexCount() ⇒ <code>number</code>\n**Returns**: <code>number</code> - the number of vertices in the whole graph  \n\n-----\n\n<a name=\"Graph+hasVertex\"></a>\n#### *graph*.hasVertex(key) ⇒ <code>boolean</code>\nAsk whether a vertex with a given key exists.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key to query |\n\n**Returns**: <code>boolean</code> - whether there is a vertex with the given key  \n\n-----\n\n<a name=\"Graph+vertexValue\"></a>\n#### *graph*.vertexValue(key) ⇒ <code>\\*</code>\nGet the value associated with the vertex of a given key.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key to query |\n\n**Returns**: <code>\\*</code> - the value associated with the vertex of the given key.\nNote that a return value of `undefined` can mean\n\n1. that there is no such vertex, or\n2. that the stored value is actually `undefined`.\n\nUse [hasVertex](#Graph+hasVertex) to distinguish these cases.  \n\n-----\n\n<a name=\"Graph+addNewEdge\"></a>\n#### *graph*.addNewEdge(from, to, [value])\nAdd a new edge to this graph.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n| [value] | <code>\\*</code> | the value to store in this new edge |\n\n**Throws**:\n\n- <code>[EdgeExistsError](#Graph.EdgeExistsError)</code> if an edge between `from` and `to` already exists\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if the `from` and/or `to` vertices do not yet exist in the graph\n\n\n-----\n\n<a name=\"Graph+createNewEdge\"></a>\n#### *graph*.createNewEdge(from, to, [value])\nAdd a new edge to this graph. If the `from` and/or `to` vertices do not yet exist\nin the graph, they are implicitly added with an `undefined` value.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n| [value] | <code>\\*</code> | the value to store in this new edge |\n\n**Throws**:\n\n- <code>[EdgeExistsError](#Graph.EdgeExistsError)</code> if an edge between `from` and `to` already exists\n\n\n-----\n\n<a name=\"Graph+setEdge\"></a>\n#### *graph*.setEdge(from, to, [value])\nSet the value of an existing edge in this graph.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n| [value] | <code>\\*</code> | the value to store in this edge |\n\n**Throws**:\n\n- <code>[EdgeNotExistsError](#Graph.EdgeNotExistsError)</code> if an edge between `from` and `to` does not yet exist\n\n\n-----\n\n<a name=\"Graph+spanEdge\"></a>\n#### *graph*.spanEdge(from, to, [value])\nMake sure an edge between the `from` and `to` vertices in this graph.\nIf one already exists, nothing is done.\nIf one does not yet exist, a new edge is added with the given value.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n| [value] | <code>\\*</code> | the value to store if a new edge is added |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if the `from` and/or `to` vertices do not yet exist in the graph\n\n\n-----\n\n<a name=\"Graph+addEdge\"></a>\n#### *graph*.addEdge(from, to, [value])\nAdd a new edge to this graph. If an edge between `from` and `to` already exists,\nthe value of that edge is overwritten.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n| [value] | <code>\\*</code> | the value to store in this new edge |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if the `from` and/or `to` vertices do not yet exist in the graph\n\n\n-----\n\n<a name=\"Graph+ensureEdge\"></a>\n#### *graph*.ensureEdge(from, to, [value])\nMake sure an edge between the `from` and `to` vertices exists in this graph.\nIf it already exists, nothing is done.\nIf it does not yet exist, a new edge is added with the given value.\nIf the `from` and/or `to` vertices do not yet exist\nin the graph, they are implicitly added with an `undefined` value.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n| [value] | <code>\\*</code> | the value to store if a new edge is added |\n\n\n-----\n\n<a name=\"Graph+createEdge\"></a>\n#### *graph*.createEdge(from, to, [value])\nAdd a new edge to this graph. If an edge between the `from` and `to`\nvertices already exists, the value of that edge is overwritten.\nIf the `from` and/or `to` vertices do not yet exist\nin the graph, they are implicitly added with an `undefined` value.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n| [value] | <code>\\*</code> | the value to store if a new edge is added |\n\n\n-----\n\n<a name=\"Graph+removeExistingEdge\"></a>\n#### *graph*.removeExistingEdge(from, to)\nRemove an existing edge from this graph.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n\n**Throws**:\n\n- <code>[EdgeNotExistsError](#Graph.EdgeNotExistsError)</code> if an edge between the `from` and `to` vertices doesn't exist\n\n\n-----\n\n<a name=\"Graph+removeEdge\"></a>\n#### *graph*.removeEdge(from, to)\nRemove an edge from this graph.\nIf an edge between the `from` and `to` vertices doesn't exist, nothing happens.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n\n\n-----\n\n<a name=\"Graph+edgeCount\"></a>\n#### *graph*.edgeCount() ⇒ <code>number</code>\n**Returns**: <code>number</code> - the number of edges in the whole graph  \n\n-----\n\n<a name=\"Graph+hasEdge\"></a>\n#### *graph*.hasEdge(from, to) ⇒ <code>boolean</code>\nAsk whether an edge between given `from` and `to` vertices exist.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n\n**Returns**: <code>boolean</code> - whether there is an edge between the given `from` and `to` vertices  \n\n-----\n\n<a name=\"Graph+edgeValue\"></a>\n#### *graph*.edgeValue(from, to) ⇒ <code>\\*</code>\nGet the value associated with the edge between given `from` and `to` vertices.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n\n**Returns**: <code>\\*</code> - the value associated with the edge between the given `from` and `to` vertices\nNote that a return value of `undefined` can mean\n\n1. that there is no such edge, or\n2. that the stored value is actually `undefined`.\n\nUse [hasEdge](#Graph+hasEdge) to distinguish these cases.  \n\n-----\n\n<a name=\"Graph+vertices\"></a>\n#### *graph*.vertices() ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\nIterate over all vertices of the graph, in no particular order.\n\n**Returns**: <code>Iterator.&lt;string, \\*&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol)  \n**Example**  \n```JavaScript\nfor (var it = graph.vertices(), kv; !(kv = it.next()).done;) {\n    var key   = kv.value[0],\n        value = kv.value[1];\n    // iterates over all vertices of the graph\n}\n```\n**Example**  \n```JavaScript\n// in ECMAScript 6, you can use a for..of loop\nfor (let [key, value] of graph.vertices()) {\n    // iterates over all vertices of the graph\n}\n```\n**See**: [@@iterator](#Graph+@@iterator)\n\n-----\n\n<a name=\"Graph+@@iterator\"></a>\n#### *graph*.@@iterator() ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\nA [Graph](#Graph) object is itself [iterable](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterable_protocol),\nand serves as a short notation in ECMAScript 6 to iterate over all vertices in the graph, in no particular order.\n\n**Returns**: <code>Iterator.&lt;string, \\*&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol)  \n**Example**  \n```JavaScript\nfor (let [key, value] of graph) {\n    // iterates over all vertices of the graph\n}\n```\n**See**: [vertices](#Graph+vertices)\n\n-----\n\n<a name=\"Graph+edges\"></a>\n#### *graph*.edges() ⇒ <code>Iterator.&lt;string, string, \\*&gt;</code>\nIterate over all edges of the graph, in no particular order.\n\n**Returns**: <code>Iterator.&lt;string, string, \\*&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol)  \n**Example**  \n```JavaScript\nfor (var it = graph.edges(), kv; !(kv = it.next()).done;) {\n    var from  = kv.value[0],\n        to    = kv.value[1],\n        value = kv.value[2];\n    // iterates over all edges of the graph\n}\n```\n**Example**  \n```JavaScript\n// in ECMAScript 6, you can use a for..of loop\nfor (let [from, to, value] of graph.edges()) {\n    // iterates over all vertices of the graph\n}\n```\n\n-----\n\n<a name=\"Graph+verticesFrom\"></a>\n#### *graph*.verticesFrom(from) ⇒ <code>Iterator.&lt;string, \\*, \\*&gt;</code>\nIterate over the outgoing edges of a given vertex in the graph, in no particular order.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key of the vertex to take the outgoing edges from |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if a vertex with the given `from` key does not exist\n\n**Returns**: <code>Iterator.&lt;string, \\*, \\*&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol)  \n**Example**  \n```JavaScript\nfor (var it = graph.verticesFrom(from), kv; !(kv = it.next()).done;) {\n    var to          = kv.value[0],\n        vertexValue = kv.value[1],\n        edgeValue   = kv.value[2];\n    // iterates over all outgoing vertices of the `from` vertex\n}\n```\n**Example**  \n```JavaScript\n// in ECMAScript 6, you can use a for..of loop\nfor (let [to, vertexValue, edgeValue] of graph.verticesFrom(from)) {\n    // iterates over all outgoing edges of the `from` vertex\n}\n```\n\n-----\n\n<a name=\"Graph+verticesTo\"></a>\n#### *graph*.verticesTo(to) ⇒ <code>Iterator.&lt;string, \\*, \\*&gt;</code>\nIterate over the incoming edges of a given vertex in the graph, in no particular order.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| to | <code>string</code> | the key of the vertex to take the incoming edges from |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if a vertex with the given `to` key does not exist\n\n**Returns**: <code>Iterator.&lt;string, \\*, \\*&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol)  \n**Example**  \n```JavaScript\nfor (var it = graph.verticesTo(to), kv; !(kv = it.next()).done;) {\n    var from        = kv.value[0],\n        vertexValue = kv.value[1],\n        edgeValue   = kv.value[2];\n    // iterates over all outgoing vertices of the `from` vertex\n}\n```\n**Example**  \n```JavaScript\n// in ECMAScript 6, you can use a for..of loop\nfor (let [from, vertexValue, edgeValue] of graph.verticesTo(to)) {\n    // iterates over all incoming edges of the `to` vertex\n}\n```\n\n-----\n\n<a name=\"Graph+verticesWithPathFrom\"></a>\n#### *graph*.verticesWithPathFrom(from) ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\nIterate over all vertices reachable from a given vertex in the graph, in no particular order.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key of the vertex to take the reachable vertices from |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if a vertex with the given `from` key does not exist\n\n**Returns**: <code>Iterator.&lt;string, \\*&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol)  \n**Example**  \n```JavaScript\nfor (var it = graph.verticesWithPathFrom(from), kv; !(kv = it.next()).done;) {\n    var key   = kv.value[0],\n        value = kv.value[1];\n    // iterates over all vertices reachable from `from`\n}\n```\n**Example**  \n```JavaScript\n// in ECMAScript 6, you can use a for..of loop\nfor (let [key, value] of graph.verticesWithPathFrom(from)) {\n    // iterates over all vertices reachable from `from`\n}\n```\n\n-----\n\n<a name=\"Graph+verticesWithPathTo\"></a>\n#### *graph*.verticesWithPathTo(to) ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\nIterate over all vertices from which a given vertex in the graph can be reached, in no particular order.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| to | <code>string</code> | the key of the vertex to take the reachable vertices from |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if a vertex with the given `to` key does not exist\n\n**Returns**: <code>Iterator.&lt;string, \\*&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol)  \n**Example**  \n```JavaScript\nfor (var it = graph.verticesWithPathTo(to), kv; !(kv = it.next()).done;) {\n    var key   = kv.value[0],\n        value = kv.value[1];\n    // iterates over all vertices from which `to` can be reached\n}\n```\n**Example**  \n```JavaScript\n// in ECMAScript 6, you can use a for..of loop\nfor (let [key, value] of graph.verticesWithPathTo(to)) {\n    // iterates over all vertices from which `to` can be reached\n}\n```\n\n-----\n\n<a name=\"Graph+sources\"></a>\n#### *graph*.sources() ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\nIterate over all vertices that have no incoming edges, in no particular order.\n\n**Returns**: <code>Iterator.&lt;string, \\*&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol)  \n**Example**  \n```JavaScript\nfor (var it = graph.sources(), kv; !(kv = it.next()).done;) {\n    var key   = kv.value[0],\n        value = kv.value[1];\n    // iterates over all vertices with no incoming edges\n}\n```\n**Example**  \n```JavaScript\n// in ECMAScript 6, you can use a for..of loop\nfor (let [key, value] of graph.sources()) {\n    // iterates over all vertices with no incoming edges\n}\n```\n\n-----\n\n<a name=\"Graph+sinks\"></a>\n#### *graph*.sinks() ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\nIterate over all vertices that have no outgoing edges, in no particular order.\n\n**Returns**: <code>Iterator.&lt;string, \\*&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol)  \n**Example**  \n```JavaScript\nfor (var it = graph.sinks(), kv; !(kv = it.next()).done;) {\n    var key   = kv.value[0],\n        value = kv.value[1];\n    // iterates over all vertices with no outgoing edges\n}\n```\n**Example**  \n```JavaScript\n// in ECMAScript 6, you can use a for..of loop\nfor (let [key, value] of graph.sinks()) {\n    // iterates over all vertices with no outgoing edges\n}\n```\n\n-----\n\n<a name=\"Graph+vertices_topologically\"></a>\n#### *graph*.vertices_topologically() ⇒ <code>Iterator.&lt;string, \\*&gt;</code>\nIterate over all vertices of the graph in topological order.\n\n**Returns**: <code>Iterator.&lt;string, \\*&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol)  \n**Example**  \n```JavaScript\nfor (var it = graph.vertices_topologically(), kv; !(kv = it.next()).done;) {\n    var key   = kv.value[0],\n        value = kv.value[1];\n    // iterates over all vertices of the graph in topological order\n}\n```\n**Example**  \n```JavaScript\n// in ECMAScript 6, you can use a for..of loop\nfor (let [key, value] of graph.vertices_topologically()) {\n    // iterates over all vertices of the graph in topological order\n}\n```\n\n-----\n\n<a name=\"Graph+clearEdges\"></a>\n#### *graph*.clearEdges()\nRemove all edges from the graph, but leave the vertices intact.\n\n\n-----\n\n<a name=\"Graph+clear\"></a>\n#### *graph*.clear()\nRemove all edges and vertices from the graph, putting it back in its initial state.\n\n\n-----\n\n<a name=\"Graph+equals\"></a>\n#### *graph*.equals(other, [eqV], [eqE]) ⇒ <code>boolean</code>\nAsk whether `this` graph and a given `other` graph are equal.\nTwo graphs are equal if they have the same vertices and the same edges.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| other | <code>[Graph](#Graph)</code> | the other graph to compare to `this` one |\n| [eqV] | <code>function</code> | a custom equality function for values stored in vertices;     defaults to `===` comparison; The first two arguments are the     values to compare. The third is the corresponding `key`. |\n| [eqE] | <code>function</code> | a custom equality function for values stored in edges;     defaults to the function given for `trV`; The first two arguments     are the values to compare. The third and fourth are the `from`     and `to` keys respectively. |\n\n**Returns**: <code>boolean</code> - `true` if the two graphs are equal; `false` otherwise  \n\n-----\n\n<a name=\"Graph+cycles\"></a>\n#### *graph*.cycles() ⇒ <code>Iterator.&lt;Array.&lt;string&gt;&gt;</code>\nIterate over all simple directed cycles in this graph, in no particular order.\nIf you mutate the graph in between iterations, behavior of the iterator\nbecomes unspecified. (So, don't.)\n\n**Returns**: <code>Iterator.&lt;Array.&lt;string&gt;&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol).\n         Each iterated value is an array containing the vertex keys describing the cycle.\n         These arrays will contain each vertex key only once — even the first/last one.  \n**Example**  \n```JavaScript\nfor (var it = graph.cycles(), kv; !(kv = it.next()).done;) {\n    var cycle = kv.value;\n    // iterates over all cycles of the graph\n}\n```\n**Example**  \n```JavaScript\n// in ECMAScript 6, you can use a for..of loop\nfor (let cycle of graph.cycles()) {\n    // iterates over all cycles of the graph\n}\n```\n\n-----\n\n<a name=\"Graph+cycle\"></a>\n#### *graph*.cycle() ⇒ <code>Array</code>\nFind any directed cycle in this graph.\n\n**Returns**: <code>Array</code> - an array containing the vertex keys describing the cycle; `null`, if there is no cycle;\n                  The array will contain each vertex key only once — even the first/last one.  \n\n-----\n\n<a name=\"Graph+hasCycle\"></a>\n#### *graph*.hasCycle() ⇒ <code>boolean</code>\nTest whether this graph contains a directed cycle.\n\n**Returns**: <code>boolean</code> - whether this graph contains any directed cycle  \n\n-----\n\n<a name=\"Graph+paths\"></a>\n#### *graph*.paths(from, to) ⇒ <code>Iterator.&lt;Array.&lt;string&gt;&gt;</code>\nIterate over all paths between two given keys in this graph, in no particular order.\nIf you mutate the graph in between iterations, behavior of the iterator\nbecomes unspecified. (So, don't.)\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the key for the originating vertex |\n| to | <code>string</code> | the key for the terminating vertex |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if the `from` and/or `to` vertices do not yet exist in the graph\n\n**Returns**: <code>Iterator.&lt;Array.&lt;string&gt;&gt;</code> - an object conforming to the [ES6 iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_iterator_protocol).\n         Each iterated value is an array containing the vertex-keys describing the path.  \n**Example**  \n```JavaScript\nfor (var it = graph.paths(), kv; !(kv = it.next()).done;) {\n    var path = kv.value;\n    // iterates over all paths between `from` and `to` in the graph\n}\n```\n**Example**  \n```JavaScript\n// in ECMAScript 6, you can use a for..of loop\nfor (let path of graph.paths()) {\n    // iterates over all paths between `from` and `to` in the graph\n}\n```\n\n-----\n\n<a name=\"Graph+path\"></a>\n#### *graph*.path(from, to) ⇒ <code>Array</code>\nFind any path between a given pair of keys.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the originating vertex |\n| to | <code>string</code> | the terminating vertex |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if the `from` and/or `to` vertices do not yet exist in the graph\n\n**Returns**: <code>Array</code> - an array with the keys of the path found between the two vertices,\n                  including those two vertices themselves; `null` if no such path exists  \n\n-----\n\n<a name=\"Graph+hasPath\"></a>\n#### *graph*.hasPath(from, to) ⇒ <code>boolean</code>\nTest whether there is a directed path between a given pair of keys.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| from | <code>string</code> | the originating vertex |\n| to | <code>string</code> | the terminating vertex |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if the `from` and/or `to` vertices do not yet exist in the graph\n\n**Returns**: <code>boolean</code> - whether such a path exists  \n\n-----\n\n<a name=\"Graph+outDegree\"></a>\n#### *graph*.outDegree(key) ⇒ <code>number</code>\nGet the number of edges going out of a given vertex.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key of the vertex to query |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if a vertex with this key does not exist\n\n**Returns**: <code>number</code> - the number of edges going out of the `key` vertex  \n\n-----\n\n<a name=\"Graph+inDegree\"></a>\n#### *graph*.inDegree(key) ⇒ <code>number</code>\nGet the number of edges coming into a given vertex.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key of the vertex to query |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if a vertex with this key does not exist\n\n**Returns**: <code>number</code> - the number of edges coming into the `key` vertex  \n\n-----\n\n<a name=\"Graph+degree\"></a>\n#### *graph*.degree(key) ⇒ <code>number</code>\nGet the number of edges connected to a given vertex.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| key | <code>string</code> | the key of the vertex to query |\n\n**Throws**:\n\n- <code>[VertexNotExistsError](#Graph.VertexNotExistsError)</code> if a vertex with this key does not exist\n\n**Returns**: <code>number</code> - the number of edges connected to the `key` vertex  \n\n-----\n\n<a name=\"Graph+mergeIn\"></a>\n#### *graph*.mergeIn(other, [mV], [mE])\nMerge another graph into this graph.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| other | <code>[Graph](#Graph)</code> | the other graph to merge into this one |\n| [mV] | <code>function</code> | a custom merge function for values stored in vertices;     defaults to whichever of the two values is not `undefined`,     giving preference to that of the other graph; The first and     second arguments are the vertex values of `this` graph and the     `other` graph respectively. The third is the corresponding `key`. |\n| [mE] | <code>function</code> | a custom merge function for values stored in edges;     defaults to whichever of the two values is not `undefined`,     giving preference to that of the other graph; The first and     second arguments are the edge values of `this` graph and the     `other` graph respectively. The third and fourth are the     corresponding `from` and `to` keys. |\n\n\n-----\n\n<a name=\"Graph+clone\"></a>\n#### *graph*.clone([trV], [trE]) ⇒ <code>[Graph](#Graph)</code>\nCreate a clone of this graph.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| [trV] | <code>function</code> | a custom transformation function for values stored in vertices;     defaults to the identity function; The first argument is the     value to clone. The second is the corresponding `key`. |\n| [trE] | <code>function</code> | a custom transformation function for values stored in edges;     defaults to the function given for `trV`; The first argument     is the value to clone. The second and third are the `from`     and `to` keys respectively. |\n\n**Returns**: <code>[Graph](#Graph)</code> - a clone of this graph  \n\n-----\n\n<a name=\"Graph+transitiveReduction\"></a>\n#### *graph*.transitiveReduction([trV], [trE]) ⇒ <code>[Graph](#Graph)</code>\nCreate a clone of this graph, but without any transitive edges.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| [trV] | <code>function</code> | a custom transformation function for values stored in vertices;     defaults to the identity function; The first argument is the     value to clone. The second is the corresponding `key`. |\n| [trE] | <code>function</code> | a custom transformation function for values stored in edges;     defaults to the function given for `trV`; The first argument     is the value to clone. The second and third are the `from`     and `to` keys respectively. |\n\n**Returns**: <code>[Graph](#Graph)</code> - a clone of this graph with all transitive edges removed  \n\n-----\n\n<a name=\"Graph+contractPaths\"></a>\n#### *graph*.contractPaths([isNexus])\nThis method replaces stretches of non-branching directed pathway into single edges.\nMore specifically, it identifies all 'nexus' vertices in the graph and preserves them.\nIt then removes all other vertices and all edges from the graph, then inserts edges\nbetween nexuses that summarize the connectivity that was there before.\n\nA nexus is any vertex that is *not* characterized by '1 edge in, 1 edge out'.\nA custom `isNexus` function may be provided to manually select additional vertices\nthat should be preserved as nexus.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| [isNexus] | <code>function</code> | a predicate for identifying additional vertices that should be treated as nexus;                  It receives a `key` and `value` associated to a vertex and should return                  true if and only if that vertex should be a nexus. |\n\n**Throws**:\n\n- <code>[BranchlessCycleError](#Graph.BranchlessCycleError)</code> if the graph contains a cycle with no branches or nexuses\n\n-----\n\n<a name=\"Graph+toJSON\"></a>\n### toJSON() ⇒ <code>string</code>\nSerialize this graph into a JSON string.\nThe resulting string can be deserialized with `Graph.fromJSON`\n\n**Returns**: <code>string</code> - a JSON string representation of the current state of this graph  \n**Example**  \n```JavaScript\nlet json   = graph1.toJSON();\nlet graph2 = Graph.fromJSON(json);\nconsole.log(graph1.equals(graph2)); // true\n```\n**See**: [Graph.fromJSON](Graph.fromJSON)\n\n-----\n\n<a name=\"Graph.fromJSON\"></a>\n### fromJSON(json) ⇒ <code>[Graph](#Graph)</code>\nDeserialize a string returned from `.toJSON()`\ninto a new `Graph` instance equal to the original.\n\n\n| Param | Type | Description |\n| --- | --- | --- |\n| json | <code>string</code> | a string originally returned from `.toJSON()` |\n\n**Returns**: <code>[Graph](#Graph)</code> - a graph equal to the original  \n**Example**  \n```JavaScript\nlet json   = graph1.toJSON();\nlet graph2 = Graph.fromJSON(json);\nconsole.log(graph1.equals(graph2)); // true\n```\n**See**: [Graph#toJSON](Graph#toJSON)\n\n-----\n\n<a name=\"Graph+event_vertex-added\"></a>\n#### \"vertex-added\"\nAn event that is triggered just after a vertex is added to this graph.\nHandlers receive the new vertex `[key, value]` as an argument.\n\n**See**: [on](#Graph+on), [off](#Graph+off)\n\n-----\n\n<a name=\"Graph+event_vertex-removed\"></a>\n#### \"vertex-removed\"\nAn event that is triggered just after a vertex is removed from this graph.\nHandlers receive the vertex key as an argument.\n\n**See**: [on](#Graph+on), [off](#Graph+off)\n\n-----\n\n<a name=\"Graph+event_vertex-modified\"></a>\n#### \"vertex-modified\"\nAn event that is triggered after a vertex in this graph is modified.\nIt is also triggered after any [\"vertex-added\"](#Graph#event_vertex-added) event.\nHandlers receive the vertex `[key, value]` as an argument.\n\n**See**: [on](#Graph+on), [off](#Graph+off)\n\n-----\n\n<a name=\"Graph+event_edge-added\"></a>\n#### \"edge-added\"\nAn event that is triggered just after an edge is added to this graph.\nHandlers receive the new edge `[[from, to], value]` as an argument.\n\n**See**: [on](#Graph+on), [off](#Graph+off)\n\n-----\n\n<a name=\"Graph+event_edge-removed\"></a>\n#### \"edge-removed\"\nAn event that is triggered just after an edge is removed from this graph.\nHandlers receive the edge key `[from, to]` as an argument.\n\n**See**: [on](#Graph+on), [off](#Graph+off)\n\n-----\n\n<a name=\"Graph+event_edge-modified\"></a>\n#### \"edge-modified\"\nAn event that is triggered after an edge in this graph is modified.\nIt is also triggered after any [\"edge-added\"](#Graph#event_edge-added) event.\nHandlers receive the edge `[[from, to], value]` as an argument.\n\n**See**: [on](#Graph+on), [off](#Graph+off)\n\n-----\n\n<a name=\"Graph.VertexExistsError\"></a>\n#### *Graph*.VertexExistsError ⇐ <code>Error</code>\nThis type of error is thrown when specific vertices are expected not to exist, but do.\n\n**Extends:** <code>Error</code>  \n\n-----\n\n<a name=\"Graph.VertexExistsError+vertices\"></a>\n##### *vertexExistsError*.vertices : <code>Set.&lt;Array&gt;</code>\nthe set of relevant vertices as `[key, value]` shaped arrays\n\n\n-----\n\n<a name=\"Graph.VertexNotExistsError\"></a>\n#### *Graph*.VertexNotExistsError ⇐ <code>Error</code>\nThis type of error is thrown when specific vertices are expected to exist, but don't.\n\n**Extends:** <code>Error</code>  \n\n-----\n\n<a name=\"Graph.VertexNotExistsError+vertices\"></a>\n##### *vertexNotExistsError*.vertices : <code>Set.&lt;string&gt;</code>\nthe set of relevant vertex keys\n\n\n-----\n\n<a name=\"Graph.EdgeExistsError\"></a>\n#### *Graph*.EdgeExistsError ⇐ <code>Error</code>\nThis type of error is thrown when specific edges are expected not to exist, but do.\n\n**Extends:** <code>Error</code>  \n\n-----\n\n<a name=\"Graph.EdgeExistsError+edges\"></a>\n##### *edgeExistsError*.edges : <code>Set.&lt;Array&gt;</code>\nthe set of relevant edges as `[[from, to], value]` shaped arrays\n\n\n-----\n\n<a name=\"Graph.EdgeNotExistsError\"></a>\n#### *Graph*.EdgeNotExistsError ⇐ <code>Error</code>\nThis type of error is thrown when specific edges are expected to exist, but don't.\n\n**Extends:** <code>Error</code>  \n\n-----\n\n<a name=\"Graph.EdgeNotExistsError+edges\"></a>\n##### *edgeNotExistsError*.edges : <code>Set.&lt;Array.&lt;string&gt;&gt;</code>\nthe set of relevant edge keys as `[from, to]` shaped arrays\n\n\n-----\n\n<a name=\"Graph.HasConnectedEdgesError\"></a>\n#### *Graph*.HasConnectedEdgesError ⇐ <code>[EdgeExistsError](#Graph.EdgeExistsError)</code>\nThis type of error is thrown when a vertex is expected not to have any connected edges, but does.\n\n**Extends:** <code>[EdgeExistsError](#Graph.EdgeExistsError)</code>  \n\n-----\n\n<a name=\"Graph.HasConnectedEdgesError+vertex\"></a>\n##### *hasConnectedEdgesError*.vertex : <code>string</code>\nthe key of the vertex that has connected edges\n\n\n-----\n\n<a name=\"Graph.EdgeExistsError+edges\"></a>\n##### *hasConnectedEdgesError*.edges : <code>Set.&lt;Array&gt;</code>\nthe set of relevant edges as `[[from, to], value]` shaped arrays\n\n\n-----\n\n<a name=\"Graph.CycleError\"></a>\n#### *Graph*.CycleError ⇐ <code>Error</code>\nThis type of error is thrown when a graph is expected not to have a directed cycle, but does.\n\n**Extends:** <code>Error</code>  \n\n-----\n\n<a name=\"Graph.CycleError+cycle\"></a>\n##### *cycleError*.cycle : <code>Array.&lt;string&gt;</code>\nthe vertices involved in the cycle, in order but with an unspecified starting point\n\n\n-----\n\n<a name=\"Graph.BranchlessCycleError\"></a>\n#### *Graph*.BranchlessCycleError ⇐ <code>[CycleError](#Graph.CycleError)</code>\nThis type of error is thrown when a graph is expected not to have a branch-less directed cycle, but does.\n\n**Extends:** <code>[CycleError](#Graph.CycleError)</code>  \n\n-----\n\n<a name=\"Graph.CycleError+cycle\"></a>\n##### *branchlessCycleError*.cycle : <code>Array.&lt;string&gt;</code>\nthe vertices involved in the cycle, in order but with an unspecified starting point\n\n\n-----\n","maintainers":[{"name":"mhelvens","email":"mhelvens@gmail.com"}],"time":{"modified":"2022-06-18T13:51:26.474Z","created":"2013-01-25T18:40:39.079Z","0.0.0":"2013-01-25T18:40:40.120Z","1.8.0":"2015-04-18T17:33:06.205Z","1.8.1":"2015-04-18T17:41:32.544Z","1.8.2":"2015-04-18T20:15:58.009Z","1.9.0":"2015-04-20T07:37:17.192Z","1.10.0":"2015-04-28T21:18:53.285Z","1.11.0":"2015-04-29T14:28:09.778Z","1.11.1":"2015-04-30T13:09:19.620Z","1.12.0":"2015-05-02T11:53:45.377Z","1.12.1":"2015-05-02T12:33:59.932Z","1.13.0":"2015-05-03T09:25:40.135Z","1.14.0":"2015-05-03T21:42:35.400Z","1.14.1":"2015-05-04T11:03:31.244Z","1.14.2":"2015-05-04T13:03:43.631Z","1.14.3":"2015-05-04T13:38:31.050Z","1.15.0":"2015-05-04T20:24:35.196Z","1.15.2":"2015-05-04T21:59:30.267Z","1.16.0":"2015-05-11T18:30:58.006Z","1.16.1":"2015-05-11T20:59:46.657Z","1.17.0":"2015-05-11T23:00:25.341Z","1.17.1":"2015-05-13T23:27:18.221Z","1.19.0":"2015-05-17T18:57:27.352Z","1.20.1":"2015-05-18T07:28:28.665Z","2.0.0-alpha-1":"2015-05-23T16:32:44.443Z","2.0.0-alpha-2":"2015-05-23T16:38:27.981Z","2.0.0-alpha-3":"2015-05-23T16:56:13.739Z","2.0.0-alpha-4":"2015-05-23T21:23:05.638Z","2.0.0-alpha-5":"2015-05-23T22:36:37.917Z","2.0.0-alpha-6":"2015-05-24T11:01:16.430Z","2.0.0-alpha-7":"2015-05-24T19:06:35.102Z","2.0.0-alpha-8":"2015-05-24T22:14:46.253Z","2.0.0-alpha-9":"2015-05-25T12:18:47.949Z","1.20.2":"2015-10-29T11:00:48.861Z","1.20.3":"2015-10-29T11:02:14.342Z","1.20.4":"2015-10-29T11:44:16.510Z","1.20.6":"2015-10-29T11:48:05.765Z","1.20.10":"2015-10-29T12:39:40.370Z","1.20.12":"2016-10-23T23:52:08.842Z","1.21.0":"2016-12-30T02:23:43.476Z","1.21.1":"2016-12-30T02:36:26.323Z"},"author":{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com","url":"http://mhelvens.net"},"repository":{"type":"git","url":"git+https://github.com/mhelvens/graph.js.git"},"keywords":["datastructure","graph","directed graph","traversal","dependencies"],"readmeFilename":"README.md","homepage":"https://github.com/mhelvens/graph.js","contributors":[{"name":"Authors ordered by first contribution."},{"name":"Michiel Helvensteijn","email":"mhelvens@gmail.com"}],"bugs":{"url":"https://github.com/mhelvens/graph.js/issues"},"users":{"mhelvens":true,"jessaustin":true,"sballan":true,"martinspinks":true},"license":"MIT"}