We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 8e21b25 commit 345da9eCopy full SHA for 345da9e
src/main/java/com/thealgorithms/datastructures/graphs/EdmondsAlgorithm.java
@@ -24,7 +24,7 @@ static class Edge {
24
public static int maxWeightMatching(List<Edge> edges, int n) {
25
// The number of nodes in the graph
26
int[] match = new int[n];
27
- Arrays.fill(match, -1); // no match
+ Arrays.fill(match, -1); // no match
28
29
// Perform the algorithm
30
int result = 0;
@@ -67,7 +67,7 @@ public static void main(String[] args) {
67
edges.add(new Edge(2, 3, 25));
68
edges.add(new Edge(3, 4, 30));
69
70
- int n = 5; // Number of vertices
+ int n = 5; // Number of vertices
71
72
System.out.println("Maximum weight matching: " + maxWeightMatching(edges, n));
73
}
0 commit comments