X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fbipartite.c;h=cc627286012b04a7fe1097bebb7e7712ecb603ca;hb=dbce362ff915753bf77eb5a923e35d3f81fd190d;hp=9a1bb816887e09429801d90c4a8eb6b4147ff637;hpb=8f01466dbeba2981299bbd983b901dccc44c1a31;p=libfirm

diff --git a/ir/adt/bipartite.c b/ir/adt/bipartite.c
index 9a1bb8168..cc6272860 100644
--- a/ir/adt/bipartite.c
+++ b/ir/adt/bipartite.c
@@ -1,3 +1,31 @@
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief  Specialized implementation for perfect bipartite matching.
+ * @author Sebastian Hack
+ * @cvs-id $Id$
+ */
+#ifdef HAVE_CONFIG_H
+# include "config.h"
+#endif
 
 #include <stdio.h>
 #include <assert.h>
@@ -110,7 +138,7 @@ static int apply_alternating_path(const bipartite_t *gr, int *matching,
 			if(bitset_popcnt(tmp) == 0)
 				continue;
 
-			right = bitset_min(tmp);
+			right = bitset_next_set(tmp, 0);
 			assert(!bitset_is_set(matched_right, right));
 			matching[left] = right;
 			bitset_set(matched_left, left);
@@ -136,6 +164,7 @@ void bipartite_dump_f(FILE *f, const bipartite_t *gr)
 	int i;
 
 	for(i = 0; i < gr->n_left; ++i) {
+		fprintf(f, "%d: ", i);
 		bitset_fprint(f, gr->adj[i]);
 		fprintf(f, "\n");
 	}