modified

build/node_modules/dag-map/LICENSE

@@ -1,20 +0,0 @@
-Copyright (c) 2014 Kris Selden and contributors
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of
-this software and associated documentation files (the "Software"), to deal in
-the Software without restriction, including without limitation the rights to
-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
-of the Software, and to permit persons to whom the Software is furnished to do
-so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
-

build/node_modules/dag-map/README.md

@@ -1,48 +0,0 @@
-# dag-map [![Build Status](https://travis-ci.org/krisselden/dag-map.png?branch=master)](https://travis-ci.org/krisselden/dag-map)
-A [directed acyclic graph](http://en.wikipedia.org/wiki/Directed_acyclic_graph) library for JavaScript.
-
-In addition to being a DAG implmentation, it also provides value storage on the
-vertices. So in-short, it is a key/value DAG.
-
-
-## Downloads
-
-## API
-
-```js
-  // create a new draph;
-  var graph = new DAG();
-
-  // add some nodes
-  graph.add('foo');
-  graph.add('bar');
-  graph.add('baz');
-
-  // currently, no edges exist between these nodes, so lets add some
-
-  graph.addEdge('foo', 'bar');
-
-  // we now have an edge from 'foo' -> 'bar';
-
-  graph.addEdge('bar', 'baz');
-
-  // we now have an edge from 'foo' -> 'bar' -> 'baz';
-
-  // to have the graph calculate this topSort for us, we can use the topSort
-  // iterator, to build an ordered
-  var vertices = [];
-
-  graph.topsort(function(vertex, path){
-    vertices.push(vertex.name);
-  });
-
-  vertices === [ 'foo', 'bar', 'baz' ];
-```
-
-## Developing
-
-* `npm install`
-* `npm test` runs the tests headless
-* `npm run test:server` runs the tests and the development server
-* `npm build` builds the development dist
-* `npm build:production` builds the production dist

build/node_modules/dag-map/package.json

@@ -1,28 +0,0 @@
-{
-  "name": "dag-map",
-  "version": "1.0.2",
-  "description": "DAG stands for Directed acyclic graph. It is used to build a graph of dependencies checking that there isn't circular dependencies",
-  "main": "dist/dag-map.js",
-  "repository": {
-    "type": "git",
-    "url": "https://github.com/krisselden/dag-map.git"
-  },
-  "scripts": {
-    "build": "ember build",
-    "build:production": "ember build --environment=production",
-    "test": "ember test",
-    "test:server": "ember test --server",
-    "prepublish": "ember build --environment production"
-  },
-  "author": "Kris Selden",
-  "license": "MIT",
-  "readmeFilename": "README.md",
-  "devDependencies": {
-    "broccoli-es6-module-transpiler": "^0.5.0",
-    "broccoli-stew": "^0.2.1",
-    "broccoli-uglify-js": "^0.1.3",
-    "ember-cli": "^0.2.0",
-    "es6-module-transpiler-amd-formatter": "^0.3.0",
-    "qunitjs": "^1.17.1"
-  }
-}