ngraph.kruskal
Advanced tools
Comparing version 1.0.1 to 1.1.0
{ | ||
"name": "ngraph.kruskal", | ||
"version": "1.0.1", | ||
"version": "1.1.0", | ||
"description": "A minimum-spanning-tree algorithm for ngraph.graph", | ||
"main": "index.js", | ||
"scripts": { | ||
"test": "tap test/*.js", | ||
"test": "tap --branches=80 --lines=80 --statements=80 --functions=80 test/*.js", | ||
"demo": "browserify demo/index.js > demo/bundle.js" | ||
@@ -20,10 +20,10 @@ }, | ||
"dependencies": { | ||
"ngraph.disjoint-set": "^1.1.0" | ||
"ngraph.disjoint-set": "^1.2.0" | ||
}, | ||
"devDependencies": { | ||
"ngraph.fromdot": "^6.0.1", | ||
"ngraph.graph": "19.1.0", | ||
"tap": "^14.10.8", | ||
"ngraph.fromdot": "^7.0.0", | ||
"ngraph.graph": "20.0.0", | ||
"tap": "^15.1.6", | ||
"vivagraphjs": "^0.12.0" | ||
} | ||
} |
@@ -1,2 +0,2 @@ | ||
# ngraph.kruskal [![Build Status](https://travis-ci.org/anvaka/ngraph.kruskal.svg)](https://travis-ci.org/anvaka/ngraph.kruskal) | ||
# ngraph.kruskal [![build status](https://github.com/anvaka/ngraph.kruskal/actions/workflows/tests.yaml/badge.svg)](https://github.com/anvaka/ngraph.kruskal/actions/workflows/tests.yaml) | ||
@@ -3,0 +3,0 @@ A minimum-spanning-tree algorithm for [ngraph.graph](https://github.com/anvaka/ngraph.graph). |
@@ -10,4 +10,4 @@ var test = require('tap').test; | ||
t.ok(tree.length === 1, 'Tree has one edge'); | ||
t.equals(tree[0].fromId, 1, 'it starts at 1'); | ||
t.equals(tree[0].toId, 2, 'and ends starts at 2'); | ||
t.equal(tree[0].fromId, 1, 'it starts at 1'); | ||
t.equal(tree[0].toId, 2, 'and ends starts at 2'); | ||
t.end(); | ||
@@ -29,7 +29,7 @@ }); | ||
t.ok(tree.length === 2, 'Tree has one edge'); | ||
t.equals(tree[0].fromId, 1, 'it starts at 1'); | ||
t.equals(tree[0].toId, 3, 'midpoint at 3'); | ||
t.equal(tree[0].fromId, 1, 'it starts at 1'); | ||
t.equal(tree[0].toId, 3, 'midpoint at 3'); | ||
t.equals(tree[1].fromId, 3, 'second midpoint 3'); | ||
t.equals(tree[1].toId, 2, 'ends at 2'); | ||
t.equal(tree[1].fromId, 3, 'second midpoint 3'); | ||
t.equal(tree[1].toId, 2, 'ends at 2'); | ||
t.end(); | ||
@@ -42,8 +42,8 @@ }); | ||
t.ok(forest.length === 2, 'There are two elements in the forest'); | ||
t.equals(forest[0].fromId, 1, 'first starts at 1'); | ||
t.equals(forest[0].toId, 2, 'ends at 2'); | ||
t.equal(forest[0].fromId, 1, 'first starts at 1'); | ||
t.equal(forest[0].toId, 2, 'ends at 2'); | ||
t.equals(forest[1].fromId, 3, 'second starts at 3'); | ||
t.equals(forest[1].toId, 4, 'ends at 4'); | ||
t.equal(forest[1].fromId, 3, 'second starts at 3'); | ||
t.equal(forest[1].toId, 4, 'ends at 4'); | ||
t.end(); | ||
}); |
Sorry, the diff of this file is not supported yet
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Major refactor
Supply chain riskPackage has recently undergone a major refactor. It may be unstable or indicate significant internal changes. Use caution when updating to versions that include significant changes.
Found 1 instance in 1 package
244709
0
Updatedngraph.disjoint-set@^1.2.0