algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2026-03-13 08:51:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix typos (#59)

Browse Source 
* Fixed typo in the word 'independant'

* Fixed typo in the word 'subsequnce'

* Fixed typo in the word 'icecream'

* Fixed typo in the word 'subsequnce' in shortestCommonSubsequence

* Fixed typo in the word 'depected'

* Fixed typo in the word 'paramaters'
This commit is contained in:
Felix Rilling
2018-06-12 16:46:40 +02:00
committed by Oleksii Trekhleb
parent 19aa6fa4fc
commit 5734e0a43e
8 changed files with 19 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/algorithms/graph/articulation-points/articulationPoints.js
View File

@@ -9,7 +9,7 @@ class VisitMetadata {
this.lowDiscoveryTime = lowDiscoveryTime;
// We need this in order to check graph root node, whether it has two
// disconnected children or not.
this.independantChildrenCount = 0;
this.independentChildrenCount = 0;
}
}
@@ -49,7 +49,7 @@ export default function articulationPoints(graph) {
if (previousVertex) {
// Update children counter for previous vertex.
visitedSet[previousVertex.getKey()].independantChildrenCount += 1;
visitedSet[previousVertex.getKey()].independentChildrenCount += 1;
}
},
/**
@@ -85,7 +85,7 @@ export default function articulationPoints(graph) {
// 2. If its visited time is <= low time of adjacent vertex.
if (previousVertex === startVertex) {
// Check that root vertex has at least two independent children.
if (visitedSet[previousVertex.getKey()].independantChildrenCount >= 2) {
if (visitedSet[previousVertex.getKey()].independentChildrenCount >= 2) {
articulationPointsSet[previousVertex.getKey()] = previousVertex;
}
} else {