cytoscape - npm Package Compare versions

Comparing version 3.4.6 to 3.4.7

.size-snapshot.json

 {
   "build/cytoscape.umd.js": {
-    "bundled": 895726,
-    "minified": 331525,
-    "gzipped": 103189
+    "bundled": 895831,
+    "minified": 331545,
+    "gzipped": 103198
   },
   "build/cytoscape.cjs.js": {
-    "bundled": 825274,
-    "minified": 348644,
-    "gzipped": 105237
+    "bundled": 825373,
+    "minified": 348664,
+    "gzipped": 105246
   },
   "build/cytoscape.esm.js": {
-    "bundled": 825101,
-    "minified": 348501,
-    "gzipped": 105193,
+    "bundled": 825200,
+    "minified": 348521,
+    "gzipped": 105204,
     "treeshaked": {
       "rollup": {
-        "code": 326263,
+        "code": 326283,
         "import_statements": 51
       },
       "webpack": {
-        "code": 328089
+        "code": 328109
       }
@@ -24,0 +24,0 @@ }

package.json

 {
   "name": "cytoscape",
-  "version": "3.4.6",
+  "version": "3.4.7",
   "license": "MIT",
@@ -5,0 +5,0 @@ "description": "Graph theory (a.k.a. network) library for analysis and visualisation",

src/collection/algorithms/hierarchical-clustering.js

@@ -45,3 +45,3 @@ // Implemented by Zoe Xi @zoexi for GSOC 2016
 
-  let getDist = (n1, n2) => clusteringDistance( opts.distance, attrs.length, i => attrs[i](n1), i => attrs[i](n2) );
+  let getDist = (n1, n2) => clusteringDistance( opts.distance, attrs.length, i => attrs[i](n1), i => attrs[i](n2), n1, n2 );
 
@@ -245,3 +245,3 @@ for ( let i = 0; i < clusters.length; i++ ) {
   let attrs = opts.attributes;
-  let getDist = (n1, n2) => clusteringDistance( opts.distance, attrs.length, i => attrs[i](n1), i => attrs[i](n2) );
+  let getDist = (n1, n2) => clusteringDistance( opts.distance, attrs.length, i => attrs[i](n1), i => attrs[i](n2), n1, n2 );
 
@@ -248,0 +248,0 @@ // Begin hierarchical algorithm

src/collection/algorithms/k-clustering.js

@@ -40,6 +40,9 @@ // Implemented by Zoe Xi @zoexi for GSOC 2016
 let getDist = function(type, node, centroid, attributes, mode){
-  let getP = mode === 'kMedoids' ? ( i => attributes[i](centroid) ) : ( i => centroid[i] );
+  let noNodeP = mode !== 'kMedoids';
+  let getP = noNodeP ? ( i => centroid[i] ) : ( i => attributes[i](centroid) );
   let getQ = i => attributes[i](node);
+  let nodeP = centroid;
+  let nodeQ = node;
 
-  return clusteringDistance( type, attributes.length, getP, getQ );
+  return clusteringDistance( type, attributes.length, getP, getQ, nodeP, nodeQ );
 };
@@ -46,0 +49,0 @@

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

3737850

increased by0.01%

Lines of code

101321

increased by0.01%

No dependency changes