Prep v2.0.0 release

Author: cpettitt

bower.json

@@ -1,6 +1,6 @@
 {
   "name": "graphlib",
-  "version": "1.0.7",
+  "version": "2.0.0",
   "main": [
     "dist/graphlib.core.js"
   ],

dist/graphlib.core.js

@@ -109,8 +109,9 @@ module.exports = dfs;
 
 /*
  * A helper that preforms a pre- or post-order traversal on the input graph
- * and returns the nodes in the order they were visited. This algorithm treats
- * the input as undirected.
+ * and returns the nodes in the order they were visited. If the graph is
+ * undirected then this algorithm will navigate using neighbors. If the graph
+ * is directed then this algorithm will navigate using successors.
  *
  * Order must be one of "pre" or "post".
  */
@@ -119,25 +120,27 @@ function dfs(g, vs, order) {
     vs = [vs];
   }
 
+  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);
+
   var acc = [],
       visited = {};
   _.each(vs, function(v) {
     if (!g.hasNode(v)) {
       throw new Error("Graph does not have node: " + v);
     }
 
-    doDfs(g, v, order === "post", visited, acc);
+    doDfs(g, v, order === "post", visited, navigation, acc);
   });
   return acc;
 }
 
-function doDfs(g, v, postorder, visited, acc) {
+function doDfs(g, v, postorder, visited, navigation, acc) {
   if (!_.has(visited, v)) {
     visited[v] = true;
 
     if (!postorder) { acc.push(v); }
-    _.each(g.neighbors(v), function(w) {
-      doDfs(g, w, postorder, visited, acc);
+    _.each(navigation(v), function(w) {
+      doDfs(g, w, postorder, visited, navigation, acc);
     });
     if (postorder) { acc.push(v); }
   }
@@ -1232,6 +1235,6 @@ if (!lodash) {
 module.exports = lodash;
 
 },{"lodash":undefined}],21:[function(require,module,exports){
-module.exports = '1.0.7';
+module.exports = '2.0.0';
 
 },{}]},{},[1]);

dist/graphlib.core.min.js

@@ -109,8 +109,9 @@ module.exports = dfs;
 
 /*
  * A helper that preforms a pre- or post-order traversal on the input graph
- * and returns the nodes in the order they were visited. This algorithm treats
- * the input as undirected.
+ * and returns the nodes in the order they were visited. If the graph is
+ * undirected then this algorithm will navigate using neighbors. If the graph
+ * is directed then this algorithm will navigate using successors.
  *
  * Order must be one of "pre" or "post".
  */
@@ -119,25 +120,27 @@ function dfs(g, vs, order) {
     vs = [vs];
   }
 
+  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);
+
   var acc = [],
       visited = {};
   _.each(vs, function(v) {
     if (!g.hasNode(v)) {
       throw new Error("Graph does not have node: " + v);
     }
 
-    doDfs(g, v, order === "post", visited, acc);
+    doDfs(g, v, order === "post", visited, navigation, acc);
   });
   return acc;
 }
 
-function doDfs(g, v, postorder, visited, acc) {
+function doDfs(g, v, postorder, visited, navigation, acc) {
   if (!_.has(visited, v)) {
     visited[v] = true;
 
     if (!postorder) { acc.push(v); }
-    _.each(g.neighbors(v), function(w) {
-      doDfs(g, w, postorder, visited, acc);
+    _.each(navigation(v), function(w) {
+      doDfs(g, w, postorder, visited, navigation, acc);
     });
     if (postorder) { acc.push(v); }
   }
@@ -1232,7 +1235,7 @@ if (!lodash) {
 module.exports = lodash;
 
 },{"lodash":22}],21:[function(require,module,exports){
-module.exports = '1.0.7';
+module.exports = '2.0.0';
 
 },{}],22:[function(require,module,exports){
 (function (global){

dist/graphlib.js

@@ -1 +1 @@
-module.exports = '1.0.8-pre';
+module.exports = '2.0.0';

dist/graphlib.min.js

@@ -1,6 +1,6 @@
 {
   "name": "graphlib",
-  "version": "1.0.8-pre",
+  "version": "2.0.0",
   "description": "A directed and undirected multi-graph library",
   "author": "Chris Pettitt <[email protected]>",
   "main": "index.js",
@@ -37,4 +37,4 @@
     "url": "https://github.com/cpettitt/graphlib.git"
   },
   "license": "MIT"
-}
+}