Add Tarjan's algorithm.

trekhleb · trekhleb · commit 1dd480b906df · 2018-05-11T15:40:59.000+03:00
diff --git a/src/algorithms/graph/articulation-points/articulationPoints.js b/src/algorithms/graph/articulation-points/articulationPoints.js
@@ -38,15 +38,15 @@ export default function articulationPoints(graph) {
      * @param {GraphVertex} previousVertex
      */
     enterVertex: ({ currentVertex, previousVertex }) => {
+      // Tick discovery time.
+      discoveryTime += 1;
+
       // Put current vertex to visited set.
       visitedSet[currentVertex.getKey()] = new VisitMetadata({
         discoveryTime,
         lowDiscoveryTime: discoveryTime,
       });
 
-      // Tick discovery time.
-      discoveryTime += 1;
-
       if (previousVertex) {
         // Update children counter for previous vertex.
         visitedSet[previousVertex.getKey()].independantChildrenCount += 1;
diff --git a/src/algorithms/graph/bridges/README.md b/src/algorithms/graph/bridges/README.md
@@ -21,6 +21,6 @@ An undirected connected graph with no cut edges
 
 ## References
 
+- [GeeksForGeeks on YouTube](https://www.youtube.com/watch?time_continue=110&v=thLQYBlz2DM)
 - [Wikipedia](https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29#Tarjan.27s_Bridge-finding_algorithm)
 - [GeeksForGeeks](https://www.geeksforgeeks.org/bridge-in-a-graph/)
-- [GeeksForGeeks on YouTube](https://www.youtube.com/watch?time_continue=110&v=thLQYBlz2DM)
