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