diff --git a/test/performance/data-structures/graph/directed-graph.test.ts b/test/performance/data-structures/graph/directed-graph.test.ts
index e20091a..0a6f013 100644
--- a/test/performance/data-structures/graph/directed-graph.test.ts
+++ b/test/performance/data-structures/graph/directed-graph.test.ts
@@ -26,7 +26,7 @@ suite
       graph.getEdge(vertexes[getRandomIndex(vertexes)], vertexes[getRandomIndex(vertexes)]);
   })
   .add(`tarjan`, () => {
-    graph.tarjan(true);
+    graph.tarjan();
   })
   // .add(`tarjan all`, () => {
   //   graph.tarjan(true, true, true, true);
diff --git a/test/unit/data-structures/graph/directed-graph.test.ts b/test/unit/data-structures/graph/directed-graph.test.ts
index dfa2c7f..a29ac40 100644
--- a/test/unit/data-structures/graph/directed-graph.test.ts
+++ b/test/unit/data-structures/graph/directed-graph.test.ts
@@ -639,11 +639,11 @@ describe('cycles, strongly connected components, bridges, articular points in Di
   const dfnMap = graph.getDFNMap();
   const lowMap = graph.getLowMap();
   expect(cycles.length).toBe(2);
-  // expect(scCs.size).toBe(5);
+  expect(scCs.size).toBe(5);
   // expect(bridges.length).toBe(4);
   // expect(cutVertices.length).toBe(4);
-  // expect(dfnMap.size).toBe(8);
-  // expect(lowMap.size).toBe(8);
+  expect(dfnMap.size).toBe(8);
+  expect(lowMap.size).toBe(8);
 });
 
 describe('DirectedGraph iterative Methods', () => {