@buggyorg/graphtools - npm Package Compare versions

Comparing version 0.2.10 to 0.2.11

lib/walkPort.js

@@ -55,3 +55,3 @@ 'use strict';
 function predecessorPort(graph, node, port) {
-  var edges = graph.nodeEdges(node);
+  var edges = graph.edges(node);
   var nodes = _lodash2.default.filter(edges, function (e) {
@@ -64,2 +64,5 @@ return e.v === node + '_PORT_' + port;
     var predecessors = graph.predecessors(nodes[i]);
+    if (predecessors.length === 0) {
+      return [];
+    }
     while (graph.predecessors(predecessors[0]).length > 0 && graph.node(predecessors[0]).hierarchyBorder) {
@@ -66,0 +69,0 @@ predecessors = graph.predecessors(predecessors[0]);

package.json

 {
   "name": "@buggyorg/graphtools",
-  "version": "0.2.10",
+  "version": "0.2.11",
   "description": "Tools for processing buggy graphs.",
@@ -5,0 +5,0 @@ "main": "lib/api.js",

src/walkPort.js

@@ -31,6 +31,9 @@
 export function predecessorPort (graph, node, port) {
-  var edges = graph.nodeEdges(node)
+  var edges = graph.edges(node)
   var nodes = _.filter(edges, (e) => e.v === node + '_PORT_' + port).map((e) => e.v)
   for (var i = 0; i < nodes.length; i++) {
     var predecessors = graph.predecessors(nodes[i])
+    if (predecessors.length === 0) {
+      return []
+    }
     while (graph.predecessors(predecessors[0]).length > 0 && graph.node(predecessors[0]).hierarchyBorder) {
@@ -37,0 +40,0 @@ predecessors = graph.predecessors(predecessors[0])

test/walk.js

@@ -102,3 +102,3 @@ /* global describe, it */
 
-  it('can walk through into a compound node', () => {
+  it('can walk into a compound node', () => {
     var path = walk.walk(pGraph2, '0_STDIN', ['output', 'i'])
@@ -105,0 +105,0 @@ expect(path).to.have.length(1)

No alert changes

Improved metrics

Total package byte prevSize

85005

increased by0.12%

Lines of code

2233

increased by0.27%

No dependency changes