Commit0ecc151

committed

fix(build): handle jscs errors

1 parentc1a1b2f commit0ecc151Copy full SHA for 0ecc151

File tree

+12

-9

lines changed

+12

-9

lines changed

Lines changed: 11 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,7 @@`
`1`	`1`	`(function(exports){`
	`2`	`+'use strict';`
`2`	`3`
`3`		`-/**`
	`4`	`+/**`
`4`	`5`	`* Tarjan's algorithm for finding the connected components in a graph.<br><br>`
`5`	`6`	`* Time complexity: O(\|E\| + \|V\|) where E is a number of edges and \|V\|`
`6`	`7`	`* is the number of nodes.`
`@@ -30,15 +31,15 @@`
`30`	`31`	`constonStack={};`
`31`	`32`	`constresult=[];`
`32`	`33`	`conststack=[];`
`33`		`-letindex=1;`
	`34`	`+varindex=1;`
`34`	`35`
`35`		`-constconnectedComponent=node=>{`
	`36`	`+constconnectedComponent=function(node){`
`36`	`37`	`stack.push(node);`
`37`	`38`	`onStack[node]=true;`
`38`	`39`	`indexes[node]=index;`
`39`	`40`	`lowIndexes[node]=index;`
`40`	`41`	`index+=1;`
`41`		`-graph[node].forEach(n=>{`
	`42`	`+graph[node].forEach(function(n){`
`42`	`43`	`if(indexes[n]===undefined){`
`43`	`44`	`connectedComponent(n);`
`44`	`45`	`lowIndexes[node]=Math.min(lowIndexes[n],lowIndexes[node]);`
`@@ -49,7 +50,7 @@`
`49`	`50`	`// This is a "root" node`
`50`	`51`	`constcc=[];`
`51`	`52`	`if(indexes[node]===lowIndexes[node]){`
`52`		`-letcurrent;`
	`53`	`+varcurrent;`
`53`	`54`	`do{`
`54`	`55`	`current=stack.pop();`
`55`	`56`	`onStack[current]=false;`
`@@ -60,7 +61,11 @@`
`60`	`61`	`};`
`61`	`62`
`62`	`63`	`Object.keys(graph)`
`63`		`-.forEach(n=>!indexes[n]&&connectedComponent(n));`
	`64`	`+.forEach(function(n){`
	`65`	`+if(!indexes[n]){`
	`66`	`+connectedComponent(n);`
	`67`	`+}`
	`68`	`+});`
`64`	`69`
`65`	`70`	`returnresult;`
`66`	`71`	`}`

Lines changed: 1 addition & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,6 @@ var cyclicGraph = {`
`16`	`16`	`v5:['v1']`
`17`	`17`	`};`
`18`	`18`
`19`		`-`
`20`	`19`	`describe('Tarjan\'s algorithm for finding connected components',function(){`
`21`	`20`	`'use strict';`
`22`	`21`	`it('should be defined',function(){`
`@@ -31,8 +30,7 @@ describe('Tarjan\'s algorithm for finding connected components', function () {`
`31`	`30`	`expect(tj(nonConnected)).toEqual([['v1'],['v2'],['v3'],['v4'],['v5']]);`
`32`	`31`	`});`
`33`	`32`
`34`		`-it('should workw ith cycles',()=>{`
	`33`	`+it('should workw ith cycles',function(){`
`35`	`34`	`expect(tj(cyclicGraph)).toEqual([['v5','v4','v3','v2','v1']]);`
`36`	`35`	`});`
`37`		`-`
`38`	`36`	`});`

Comments

(0)