Mention N <= M requirement in WeightedMatching.h (kth-competitive-pro…

…gramming#211)
hockyy · Apr 19, 2022 · 7cb79c4 · 7cb79c4
1 parent ff048ec
commit 7cb79c4
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/content/graph/WeightedMatching.h b/content/graph/WeightedMatching.h
@@ -8,7 +8,7 @@
  * nodes are in two matchings and the sum of the edge weights is minimal. Takes
  * cost[N][M], where cost[i][j] = cost for L[i] to be matched with R[j] and
  * returns (min cost, match), where L[i] is matched with
- * R[match[i]]. Negate costs for max cost.
+ * R[match[i]]. Negate costs for max cost. Requires $N \le M$.
  * Time: O(N^2M)
  * Status: Tested on kattis:cordonbleu, stress-tested
  */