hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-12-26 23:21:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add Tarjan's algorithm.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2018-05-11 15:42:42 +03:00
parent 1dd480b906
commit 670ec093f4
1 changed files with 13 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -65,13 +65,19 @@ export default function articulationPoints(graph) {
// Update the low time with the smallest time of adjacent vertices. // Update the low time with the smallest time of adjacent vertices.
// Get minimum low discovery time from all neighbors. // Get minimum low discovery time from all neighbors.
/** @param {GraphVertex} neighbor */ /** @param {GraphVertex} neighbor */
visitedSet[currentVertex.getKey()].lowDiscoveryTime = currentVertex.getNeighbors().reduce( visitedSet[currentVertex.getKey()].lowDiscoveryTime = currentVertex.getNeighbors()
(lowestDiscoveryTime, neighbor) => { .filter(earlyNeighbor => earlyNeighbor.getKey() !== previousVertex.getKey())
const neighborLowTime = visitedSet[neighbor.getKey()].lowDiscoveryTime; /**
return neighborLowTime < lowestDiscoveryTime ? neighborLowTime : lowestDiscoveryTime; * @param {number} lowestDiscoveryTime
}, * @param {GraphVertex} neighbor
visitedSet[currentVertex.getKey()].lowDiscoveryTime, */
); .reduce(
(lowestDiscoveryTime, neighbor) => {
const neighborLowTime = visitedSet[neighbor.getKey()].lowDiscoveryTime;
return neighborLowTime < lowestDiscoveryTime ? neighborLowTime : lowestDiscoveryTime;
},
visitedSet[currentVertex.getKey()].lowDiscoveryTime,
);
// Detect whether previous vertex is articulation point or not. // Detect whether previous vertex is articulation point or not.
// To do so we need to check two [OR] conditions: // To do so we need to check two [OR] conditions: