almete.bronkerbosch - npm Package Compare versions

Comparing version 17.10.29 to 17.11.33

almete.BronKerbosch.js

@@ -1,1 +0,1 @@
-(function(a,b){'object'==typeof exports&&'undefined'!=typeof module?module.exports=b():'function'==typeof define&&define.amd?define(b):(a.almete=a.almete||{},a.almete.BronKerbosch=b())})(this,function(){'use strict';var a=function(){for(var a=new Set,b=arguments.length,c=Array(b),d=0;d<b;d++)c[d]=arguments[d];return c.forEach(function(b){b.forEach(function(b){a.add(b)})}),a},b=function(a,b){var c=new Set;return a.forEach(function(a){b.has(a)&&c.add(a)}),c},c=function(a,b){var c=new Set;return a.forEach(function(a){b.has(a)||c.add(a)}),c},d=function(a){var b=[];return a.forEach(function(a){b.push(a)}),b};return function(e){var f=new Set;if(e.forEach(function(a){f.add(a[0]).add(a[1])}),2>f.size)return[];var g=new Map;f.forEach(function(a){g.set(a,new Set)}),e.forEach(function(a){g.get(a[0]).add(a[1]),g.get(a[1]).add(a[0])});var h=[];return function e(f,i,j){1>i.size&&1>j.size&&h.push(d(f));var k=new Set;a(i,j).forEach(function(a){var c=b(g.get(a),i);c.size>k.size&&(k=c)}),c(i,k).forEach(function(a){var c=g.get(a);e(new Set(f).add(a),b(i,c),b(j,c)),i.delete(a),j.add(a)})}(new Set,f,new Set),h}});
+!function(n,e){"object"==typeof exports&&"undefined"!=typeof module?module.exports=e():"function"==typeof define&&define.amd?define(e):(n.almete=n.almete||{},n.almete.BronKerbosch=e())}(this,function(){"use strict";var n=function(){for(var n=[],e=arguments.length;e--;)n[e]=arguments[e];var t=new Set;return n.forEach(function(n){n.forEach(function(n){t.add(n)})}),t},e=function(n,e){var t=new Set;return n.forEach(function(n){e.has(n)&&t.add(n)}),t},t=function(n,e){var t=new Set;return n.forEach(function(n){e.has(n)||t.add(n)}),t},r=function(n){var e=[];return n.forEach(function(n){e.push(n)}),e},o=function(n){var e=function(){for(var t=[],r=arguments.length;r--;)t[r]=arguments[r];return n.call.apply(n,[this,e].concat(t))};return e};return function(a){var f=new Set;if(a.forEach(function(n){f.add(n[0]).add(n[1])}),f.size<2)return[];var c=new Map;f.forEach(function(n){c.set(n,new Set)}),a.forEach(function(n){c.get(n[0]).add(n[1]),c.get(n[1]).add(n[0])});var u=[];return o(function(o,a,f,i){f.size<1&&i.size<1&&u.push(r(a));var d=new Set;n(f,i).forEach(function(n){var t=e(c.get(n),f);t.size>d.size&&(d=t)}),t(f,d).forEach(function(n){var t=c.get(n);o(new Set(a).add(n),e(f,t),e(i,t)),f.delete(n),i.add(n)})})(new Set,f,new Set),u}});

package.json

 {
 	"name": "almete.bronkerbosch",
-	"version": "17.10.29",
+	"version": "17.11.33",
 	"description": "Implementation of Bron-Kerbosch algorithm to find maximal cliques in an undirected graph.",
@@ -8,3 +8,2 @@ "main": "almete.BronKerbosch.js",
 		"build": "rollup -c",
-		"dev": "rollup -c -w",
 		"prepublishOnly": "npm run build"
@@ -21,3 +20,3 @@ },
 		"graph",
-		"undirected-graphs",
+		"undirected-graph",
 		"edge",
@@ -35,11 +34,7 @@ "node",
 	"devDependencies": {
-		"babel-plugin-transform-runtime": "^6.23.0",
-		"babel-preset-env": "^1.6.1",
 		"eslint": "^4.10.0",
 		"rollup": "^0.50.0",
-		"rollup-plugin-babel": "^3.0.2",
-		"rollup-plugin-babel-minify": "^3.1.2",
-		"rollup-plugin-commonjs": "^8.2.5",
-		"rollup-plugin-node-resolve": "^3.0.0"
+		"rollup-plugin-buble": "^0.16.0",
+		"rollup-plugin-uglify": "^2.0.1"
 	}
 }

README.md

@@ -45,2 +45,10 @@ # almete.BronKerbosch
 
+Include [polyfills](https://polyfill.io/) to support older browsers.
+
+```html
+
+<script src="https://cdn.polyfill.io/v2/polyfill.min.js"></script>
+
+```
+
 ## usage
@@ -47,0 +55,0 @@

No alert changes

Improved metrics

Total package byte prevSize

4602

increased by2.09%

Dev dependency count

4

decreased by-50%

Number of lines in readme file

67

increased by13.56%

No dependency changes