{
	"name": "tsort",
	"versions": {
		"0.0.1": {
			"name": "tsort",
			"version": "0.0.1",
			"description": "Topological sort on directed graphs.",
			"main": "index.js",
			"scripts": {
				"test": "./node_modules/.bin/mocha"
			},
			"repository": {
				"type": "git",
				"url": "git@github.com:eknkc/tsort.git"
			},
			"keywords": [
				"dependency",
				"graph",
				"topological",
				"sort",
				"graph"
			],
			"devDependencies": {
				"mocha": "*"
			},
			"author": {
				"name": "Ekin Koc"
			},
			"license": "MIT",
			"readmeFilename": "README.md",
			"_id": "tsort@0.0.1",
			"dist": {
				"shasum": "e2280f5e817f8bf4275657fd0f9aebd44f5a2786",
				"tarball": "https://registry.npmjs.org/tsort/-/tsort-0.0.1.tgz"
			},
			"_from": ".",
			"_npmVersion": "1.2.10",
			"_npmUser": {
				"name": "eknkc",
				"email": "ekin@eknkc.com"
			},
			"maintainers": [
				{
					"name": "eknkc",
					"email": "ekin@eknkc.com"
				}
			],
			"directories": {},
			"contributors": []
		}
	},
	"time": {
		"modified": "2013-02-28T18:00:23.654Z",
		"created": "2013-02-28T18:00:21.216Z",
		"0.0.1": "2013-02-28T18:00:23.654Z"
	},
	"users": {},
	"dist-tags": {
		"latest": "0.0.1"
	},
	"_uplinks": {
		"npmjs": {
			"etag": "W/\"7c545ed01a544d2940cd5e41f5234419\"",
			"fetched": 1602009376569
		}
	},
	"_distfiles": {
		"tsort-0.0.1.tgz": {
			"url": "https://registry.npmjs.org/tsort/-/tsort-0.0.1.tgz",
			"sha": "e2280f5e817f8bf4275657fd0f9aebd44f5a2786",
			"registry": "npmjs"
		}
	},
	"_attachments": {
		"tsort-0.0.1.tgz": {
			"shasum": "e2280f5e817f8bf4275657fd0f9aebd44f5a2786"
		}
	},
	"_rev": "13-8450d06633ef1f6d",
	"_id": "tsort",
	"readme": "# tsort - node.js topological sort utility\n\n    npm install tsort\n\n## usage\n\n```js\nvar tsort = require('tsort');\n\n// create an empty graph\nvar graph = tsort();\n\n// add nodes\ngraph.add('a', 'b');\ngraph.add('b', 'c');\ngraph.add('0', 'a');\n\n// outputs: [ '0', 'a', 'b', 'c' ]\nconsole.dir(graph.sort());\n\n// can add more than one node\ngraph.add('1', '2', '3', 'a');\n// outputs: [ '0', '1', '2', '3', 'a', 'b', 'c' ]\nconsole.dir(graph.sort());\n\n// can add in array form\ngraph.add(['1', '1.5']);\ngraph.add(['1.5', 'a']);\n// outputs: [ '0', '1', '2', '3', '1.5', 'a', 'b', 'c' ]\nconsole.dir(graph.sort());\n\n// detects cycles\ngraph.add('first', 'second');\ngraph.add('second', 'third', 'first');\n// throws: Error: There is a cycle in the graph. It is not possible to derive a topological sort.\ngraph.sort();\n```\n\n#license\nMIT"
}