Formatted code using clang-format to ensure consistent styling

Author: DenizAltunkapan

src/main/java/com/thealgorithms/dynamicprogramming/TreeMatching.java

@@ -37,12 +37,12 @@ public TreeMatching(UndirectedAdjacencyListGraph graph) {
      * @return The maximum weighted matching for the tree, starting from the root node.
      *
      */
-    public int getMaxMatching(int root, int parent){
+    public int getMaxMatching(int root, int parent) {
         if (root < 0 || root >= graph.size()) {
             throw new IllegalArgumentException("Invalid root: " + root);
         }
         MaxMatching(root, parent);
-        return Math.max(dp[root][0],dp[root][1]);
+        return Math.max(dp[root][0], dp[root][1]);
     }
 
     /**
@@ -58,7 +58,7 @@ private void MaxMatching(int node, int parent) {
 
         int sumWithoutEdge = 0;
         for (int adjNode : graph.getNeighbors(node)) {
-            if (adjNode == parent){
+            if (adjNode == parent) {
                 continue;
             }
             MaxMatching(adjNode, node);
@@ -68,13 +68,11 @@ private void MaxMatching(int node, int parent) {
         dp[node][0] = sumWithoutEdge;
 
         for (int adjNode : graph.getNeighbors(node)) {
-            if (adjNode == parent){
+            if (adjNode == parent) {
                 continue;
             }
             int weight = graph.getEdgeWeight(node, adjNode);
-            dp[node][1] = Math.max(dp[node][1],
-                    sumWithoutEdge - Math.max(dp[adjNode][0], dp[adjNode][1]) + dp[adjNode][0] + weight);
+            dp[node][1] = Math.max(dp[node][1], sumWithoutEdge - Math.max(dp[adjNode][0], dp[adjNode][1]) + dp[adjNode][0] + weight);
         }
     }
-
 }

src/test/java/com/thealgorithms/dynamicprogramming/TreeMatchingTest.java

@@ -1,9 +1,10 @@
 package com.thealgorithms.dynamicprogramming;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.thealgorithms.datastructures.graphs.UndirectedAdjacencyListGraph;
 import org.junit.jupiter.api.BeforeEach;
 import org.junit.jupiter.api.Test;
-import com.thealgorithms.datastructures.graphs.UndirectedAdjacencyListGraph;
-import static org.junit.jupiter.api.Assertions.assertEquals;
 
 class TreeMatchingTest {
     UndirectedAdjacencyListGraph graph;
@@ -29,7 +30,7 @@ void testMaxMatchingForGeneralTree() {
         graph.addEdge(5, 9, 10);
 
         TreeMatching treeMatching = new TreeMatching(graph);
-        assertEquals(110,treeMatching.getMaxMatching(0,-1));
+        assertEquals(110, treeMatching.getMaxMatching(0, -1));
     }
 
     @Test
@@ -47,7 +48,7 @@ void testMaxMatchingForBalancedTree() {
         graph.addEdge(7, 11, 10);
         graph.addEdge(7, 12, 5);
         TreeMatching treeMatching = new TreeMatching(graph);
-        assertEquals(100,treeMatching.getMaxMatching(0,-1));
+        assertEquals(100, treeMatching.getMaxMatching(0, -1));
     }
 
     @Test
@@ -65,13 +66,13 @@ void testMaxMatchingForTreeWithVariedEdgeWeights() {
         graph.addEdge(4, 11, 50);
         graph.addEdge(4, 12, 20);
         TreeMatching treeMatching = new TreeMatching(graph);
-        assertEquals(140,treeMatching.getMaxMatching(0,-1));
+        assertEquals(140, treeMatching.getMaxMatching(0, -1));
     }
 
     @Test
     void emptyTree() {
         TreeMatching treeMatching = new TreeMatching(graph);
-        assertEquals(0,treeMatching.getMaxMatching(0,-1));
+        assertEquals(0, treeMatching.getMaxMatching(0, -1));
     }
 
     @Test
@@ -116,5 +117,4 @@ void testUnbalancedTree() {
         TreeMatching treeMatching = new TreeMatching(graph);
         assertEquals(100, treeMatching.getMaxMatching(0, -1));
     }
-
 }