Fix all 17 Codacy static analysis issues

- Add curly braces to all single-statement blocks
- Fix naming conventions: GetSCCCount -> GetSccCount, InSameSCC -> InSameScc, GetSCC -> GetScc
- Add meaningful exception message to ArgumentOutOfRangeException
- Split multi-statement lines into separate lines
- Update all test method names to match renamed methods

Author: 0xsatoshi99

Algorithms.Tests/Graph/TarjanStronglyConnectedComponentsTests.cs

@@ -67,7 +67,7 @@ public void FindSCCs_ComplexGraph_ReturnsCorrectSCCs()
     }
 
     [Test]
-    public void GetSCCCount_AfterFindingSCCs_ReturnsCorrectCount()
+    public void GetSccCount_AfterFindingSCCs_ReturnsCorrectCount()
     {
         var tarjan = new TarjanStronglyConnectedComponents(5);
         tarjan.AddEdge(0, 1);
@@ -77,46 +77,46 @@ public void GetSCCCount_AfterFindingSCCs_ReturnsCorrectCount()
         tarjan.AddEdge(4, 2);
 
         tarjan.FindSCCs();
-        var count = tarjan.GetSCCCount();
+        var count = tarjan.GetSccCount();
 
         count.Should().Be(2);
     }
 
     [Test]
-    public void InSameSCC_VerticesInSameSCC_ReturnsTrue()
+    public void InSameScc_VerticesInSameScc_ReturnsTrue()
     {
         var tarjan = new TarjanStronglyConnectedComponents(3);
         tarjan.AddEdge(0, 1);
         tarjan.AddEdge(1, 2);
         tarjan.AddEdge(2, 0);
 
-        var result = tarjan.InSameSCC(0, 2);
+        var result = tarjan.InSameScc(0, 2);
 
         result.Should().BeTrue();
     }
 
     [Test]
-    public void InSameSCC_VerticesInDifferentSCCs_ReturnsFalse()
+    public void InSameScc_VerticesInDifferentSccs_ReturnsFalse()
     {
         var tarjan = new TarjanStronglyConnectedComponents(4);
         tarjan.AddEdge(0, 1);
         tarjan.AddEdge(1, 0);
         tarjan.AddEdge(2, 3);
 
-        var result = tarjan.InSameSCC(0, 2);
+        var result = tarjan.InSameScc(0, 2);
 
         result.Should().BeFalse();
     }
 
     [Test]
-    public void GetSCC_ValidVertex_ReturnsSCCContainingVertex()
+    public void GetScc_ValidVertex_ReturnsSccContainingVertex()
     {
         var tarjan = new TarjanStronglyConnectedComponents(3);
         tarjan.AddEdge(0, 1);
         tarjan.AddEdge(1, 2);
         tarjan.AddEdge(2, 0);
 
-        var scc = tarjan.GetSCC(1);
+        var scc = tarjan.GetScc(1);
 
         scc.Should().NotBeNull();
         scc.Should().Contain(1);

Algorithms/Graph/TarjanStronglyConnectedComponents.cs

@@ -40,7 +40,9 @@ public TarjanStronglyConnectedComponents(int vertices)
     public void AddEdge(int u, int v)
     {
         if (u < 0 || u >= graph.Length || v < 0 || v >= graph.Length)
-            throw new ArgumentOutOfRangeException();
+        {
+            throw new ArgumentOutOfRangeException(nameof(u), "Vertex indices must be within valid range.");
+        }
 
         graph[u].Add(v);
     }
@@ -54,7 +56,9 @@ public List<List<int>> FindSCCs()
         for (int i = 0; i < graph.Length; i++)
         {
             if (ids[i] == -1)
+            {
                 Dfs(i);
+            }
         }
 
         return sccs;
@@ -63,19 +67,24 @@ public List<List<int>> FindSCCs()
     /// <summary>
     /// Gets the number of strongly connected components.
     /// </summary>
-    public int GetSCCCount() => sccs.Count;
+    public int GetSccCount() => sccs.Count;
 
     /// <summary>
     /// Checks if two vertices are in the same SCC.
     /// </summary>
-    public bool InSameSCC(int u, int v)
+    public bool InSameScc(int u, int v)
     {
-        if (sccs.Count == 0) FindSCCs();
+        if (sccs.Count == 0)
+        {
+            FindSCCs();
+        }
 
         foreach (var scc in sccs)
         {
             if (scc.Contains(u) && scc.Contains(v))
+            {
                 return true;
+            }
         }
 
         return false;
@@ -84,9 +93,12 @@ public bool InSameSCC(int u, int v)
     /// <summary>
     /// Gets the SCC containing the given vertex.
     /// </summary>
-    public List<int>? GetSCC(int vertex)
+    public List<int>? GetScc(int vertex)
     {
-        if (sccs.Count == 0) FindSCCs();
+        if (sccs.Count == 0)
+        {
+            FindSCCs();
+        }
 
         return sccs.FirstOrDefault(scc => scc.Contains(vertex));
     }
@@ -96,18 +108,25 @@ public bool InSameSCC(int u, int v)
     /// </summary>
     public List<int>[] BuildCondensationGraph()
     {
-        if (sccs.Count == 0) FindSCCs();
+        if (sccs.Count == 0)
+        {
+            FindSCCs();
+        }
 
         var sccIndex = new int[graph.Length];
         for (int i = 0; i < sccs.Count; i++)
         {
             foreach (var vertex in sccs[i])
+            {
                 sccIndex[vertex] = i;
+            }
         }
 
         var condensation = new List<int>[sccs.Count];
         for (int i = 0; i < sccs.Count; i++)
+        {
             condensation[i] = new List<int>();
+        }
 
         var edges = new HashSet<(int, int)>();
         for (int u = 0; u < graph.Length; u++)
@@ -136,8 +155,15 @@ private void Dfs(int at)
 
         foreach (var to in graph[at])
         {
-            if (ids[to] == -1) Dfs(to);
-            if (onStack[to]) low[at] = Math.Min(low[at], low[to]);
+            if (ids[to] == -1)
+            {
+                Dfs(to);
+            }
+
+            if (onStack[to])
+            {
+                low[at] = Math.Min(low[at], low[to]);
+            }
         }
 
         if (ids[at] == low[at])
@@ -148,7 +174,10 @@ private void Dfs(int at)
                 int node = stack.Pop();
                 onStack[node] = false;
                 scc.Add(node);
-                if (node == at) break;
+                if (node == at)
+                {
+                    break;
+                }
             }
             sccs.Add(scc);
         }