Adding another comment to max weight bipartite matching code.

2 files changed, 1 insertions, 0 deletions

diff --git a/graph/maxWeightBipartiteMatching.cpp b/graph/maxWeightBipartiteMatching.cpp
index 2c1ad9d..f734fa4 100644
--- a/graph/maxWeightBipartiteMatching.cpp
+++ b/graph/maxWeightBipartiteMatching.cpp
@@ -1,6 +1,7 @@
 // Laufzeit: O(|V|^3)
 int costs[N_LEFT][N_RIGHT];
 
+// Es muss l<=r sein, ansonsten terminiert der Algorithmus nicht.
 int match(int l, int r) {
   vector<int> xy(l, -1), yx(r, -1), lx(l), ly(r, 0), augmenting(r);
   vector<bool> s(l);
diff --git a/tcr.pdf b/tcr.pdf
index b78eda4..725e698 100644
--- a/tcr.pdf
+++ b/tcr.pdf