diff --git a/Algorithms.Tests/Graph/KosarajuTests.cs b/Algorithms.Tests/Graph/KosarajuTests.cs
index c24b576d..ad0d07d6 100644
--- a/Algorithms.Tests/Graph/KosarajuTests.cs
+++ b/Algorithms.Tests/Graph/KosarajuTests.cs
@@ -29,7 +29,7 @@ public void GetRepresentativesTest()
         graph.AddEdge(vertex5, vertex4, 1);
         graph.AddEdge(vertex5, vertex6, 1);
 
-        // Run the agorithm and obtain the representative vertex of the SCC to which each vertex belongs.
+        // Run the algorithm and obtain the representative vertex of the SCC to which each vertex belongs.
         Dictionary<Vertex<int>, Vertex<int>> result = Kosaraju<int>.GetRepresentatives(graph);
 
         // Check every Vertex belongs to a SCC