# HG changeset patch
# User marci
# Date 1082975736 0
# Node ID 3c8801529a1fe295887fa450b70e7354b0532780
# Parent d137525538dccc431eec74e382124b0bb5af0942
misc
diff -r d137525538dc -r 3c8801529a1f src/work/marci/bipartite_matching_leda.cc
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/src/work/marci/bipartite_matching_leda.cc Mon Apr 26 10:35:36 2004 +0000
@@ -0,0 +1,219 @@
+// -*- c++ -*-
+#include <iostream>
+#include <fstream>
+#include <vector>
+#include <cstdlib>
+
+#include <LEDA/graph.h>
+#include <LEDA/mcb_matching.h>
+#include <LEDA/list.h>
+
+#include <leda_graph_wrapper.h>
+#include <list_graph.h>
+//#include <smart_graph.h>
+//#include <dimacs.h>
+#include <time_measure.h>
+#include <for_each_macros.h>
+#include <bfs_iterator.h>
+#include <graph_wrapper.h>
+#include <maps.h>
+#include <edmonds_karp.h>
+#include <preflow.h>
+
+/**
+ * Inicializalja a veletlenszamgeneratort.
+ * Figyelem, ez nem jo igazi random szamokhoz,
+ * erre ne bizzad a titkaidat!
+ */
+void random_init()
+{
+ unsigned int seed = getpid();
+ seed |= seed << 15;
+ seed ^= time(0);
+
+ srand(seed);
+}
+
+/**
+ * Egy veletlen int-et ad vissza 0 es m-1 kozott.
+ */
+int random(int m)
+{
+ return int( double(m) * rand() / (RAND_MAX + 1.0) );
+}
+
+using namespace hugo;
+
+int main() {
+ //for leda graph
+ leda::graph lg;
+ lg.make_undirected();
+ typedef LedaGraphWrapper<leda::graph> Graph;
+ Graph g(lg);
+
+ //for UndirListGraph
+ //typedef UndirListGraph Graph;
+ //Graph g;
+
+ typedef Graph::Node Node;
+ typedef Graph::NodeIt NodeIt;
+ typedef Graph::Edge Edge;
+ typedef Graph::EdgeIt EdgeIt;
+ typedef Graph::OutEdgeIt OutEdgeIt;
+
+ std::vector<Graph::Node> s_nodes;
+ std::vector<Graph::Node> t_nodes;
+
+ int a;
+ std::cout << "number of nodes in the first color class=";
+ std::cin >> a;
+ int b;
+ std::cout << "number of nodes in the second color class=";
+ std::cin >> b;
+ int m;
+ std::cout << "number of edges=";
+ std::cin >> m;
+
+
+ for (int i=0; i<a; ++i) s_nodes.push_back(g.addNode());
+ for (int i=0; i<b; ++i) t_nodes.push_back(g.addNode());
+
+ random_init();
+ for(int i=0; i<m; ++i) {
+ g.addEdge(s_nodes[random(a)], t_nodes[random(b)]);
+ }
+
+ Graph::NodeMap<int> ref_map(g, -1);
+
+ IterableBoolMap< Graph::NodeMap<int> > bipartite_map(ref_map);
+ for (int i=0; i<a; ++i) bipartite_map.insert(s_nodes[i], false);
+ for (int i=0; i<b; ++i) bipartite_map.insert(t_nodes[i], true);
+
+// Graph::Node u;
+// std::cout << "These nodes will be in S:\n";
+// //FIXME azert kellene ++, es invalid vizsgalat u-bol, hogy ezt le lehessen
+// //irni 1etlen FOR_EACH-csel.
+// for (bipartite_map.first(u, false); g.valid(u); bipartite_map.next(u))
+// std::cout << u << " ";
+// std::cout << "\n";
+// std::cout << "These nodes will be in T:\n";
+// for (bipartite_map.first(u, true); g.valid(u); bipartite_map.next(u))
+// std::cout << u << " ";
+// std::cout << "\n";
+
+ typedef BipartiteGraphWrapper<Graph> BGW;
+ BGW bgw(g, bipartite_map);
+
+// std::cout << "Nodes by NodeIt:\n";
+// FOR_EACH_LOC(BGW::NodeIt, n, bgw) {
+// std::cout << n << " ";
+// }
+// std::cout << "\n";
+// std::cout << "Nodes in S by ClassNodeIt:\n";
+// FOR_EACH_INC_LOC(BGW::ClassNodeIt, n, bgw, bgw.S_CLASS) {
+// std::cout << n << " ";
+// }
+// std::cout << "\n";
+// std::cout << "Nodes in T by ClassNodeIt:\n";
+// FOR_EACH_INC_LOC(BGW::ClassNodeIt, n, bgw, bgw.T_CLASS) {
+// std::cout << n << " ";
+// }
+// std::cout << "\n";
+// std::cout << "Edges of the bipartite graph:\n";
+// FOR_EACH_LOC(BGW::EdgeIt, e, bgw) {
+// std::cout << bgw.tail(e) << "->" << bgw.head(e) << std::endl;
+// }
+
+ BGW::NodeMap<int> dbyj(bgw);
+ BGW::EdgeMap<int> dbyxcj(bgw);
+
+ typedef stGraphWrapper<BGW> stGW;
+ stGW stgw(bgw);
+ ConstMap<stGW::Edge, int> const1map(1);
+// stGW::NodeMap<int> ize(stgw);
+
+// BfsIterator< BGW, BGW::NodeMap<bool> > bfs(bgw);
+// Graph::NodeIt si;
+// Graph::Node s;
+// s=g.first(si);
+// bfs.pushAndSetReached(BGW::Node(s));
+// while (!bfs.finished()) { ++bfs; }
+
+// FOR_EACH_LOC(stGW::NodeIt, n, stgw) {
+// std::cout << "out-edges of " << n << ":\n";
+// FOR_EACH_INC_LOC(stGW::OutEdgeIt, e, stgw, n) {
+// std::cout << " " << e << "\n";
+// std::cout << " aNode: " << stgw.aNode(e) << "\n";
+// std::cout << " bNode: " << stgw.bNode(e) << "\n";
+// }
+// std::cout << "in-edges of " << n << ":\n";
+// FOR_EACH_INC_LOC(stGW::InEdgeIt, e, stgw, n) {
+// std::cout << " " << e << "\n";
+// std::cout << " aNode: " << stgw.aNode(e) << "\n";
+// std::cout << " bNode: " << stgw.bNode(e) << "\n";
+// }
+// }
+// std::cout << "Edges of the stGraphWrapper:\n";
+// FOR_EACH_LOC(stGW::EdgeIt, n, stgw) {
+// std::cout << " " << n << "\n";
+// }
+
+// stGW::NodeMap<bool> b(stgw);
+// FOR_EACH_LOC(stGW::NodeIt, n, stgw) {
+// std::cout << n << ": " << b[n] <<"\n";
+// }
+
+// std::cout << "Bfs from s: \n";
+// BfsIterator< stGW, stGW::NodeMap<bool> > bfs_stgw(stgw);
+// bfs_stgw.pushAndSetReached(stgw.S_NODE);
+// while (!bfs_stgw.finished()) {
+// std::cout << " " << stGW::OutEdgeIt(bfs_stgw) << "\n";
+// ++bfs_stgw;
+// }
+
+
+ Timer ts;
+ ts.reset();
+ stGW::EdgeMap<int> max_flow(stgw);
+ MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
+ max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, max_flow);
+// while (max_flow_test.augmentOnShortestPath()) { }
+ typedef ListGraph MutableGraph;
+// while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) {
+ while (max_flow_test.augmentOnBlockingFlow2()) {
+ std::cout << max_flow_test.flowValue() << std::endl;
+ }
+ std::cout << "max flow value: " << max_flow_test.flowValue() << std::endl;
+ std::cout << "elapsed time: " << ts << std::endl;
+// FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {
+// std::cout << e << ": " << max_flow[e] << "\n";
+// }
+// std::cout << "\n";
+
+ ts.reset();
+ stGW::EdgeMap<int> pre_flow(stgw);
+ Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
+ pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow, true);
+ pre_flow_test.run();
+ std::cout << "pre flow value: " << max_flow_test.flowValue() << std::endl;
+ std::cout << "elapsed time: " << ts << std::endl;
+// FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {
+// std::cout << e << ": " << pre_flow[e] << "\n";
+// }
+// std::cout << "\n";
+
+ ts.reset();
+ MAX_CARD_BIPARTITE_MATCHING(lg);
+ // stGW::EdgeMap<int> pre_flow(stgw);
+ //Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
+ // pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow, true);
+ //pre_flow_test.run();
+ //std::cout << "pre flow value: " << max_flow_test.flowValue() << std::endl;
+ std::cout << "elapsed time: " << ts << std::endl;
+// FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {
+// std::cout << e << ": " << pre_flow[e] << "\n";
+// }
+// std::cout << "\n";
+
+ return 0;
+}
diff -r d137525538dc -r 3c8801529a1f src/work/marci/makefile
--- a/src/work/marci/makefile Mon Apr 26 09:55:31 2004 +0000
+++ b/src/work/marci/makefile Mon Apr 26 10:35:36 2004 +0000
@@ -1,12 +1,13 @@
CXX2 = g++-2.95
#CXX3 := $(shell type -p g++-3.3 || type -p g++-3.2 || type -p g++-3.0 || type -p g++-3 || echo g++)
+CXX3=$(CXX)
#CXX=$(CXX3)
#CC=$(CXX)
#LEDAROOT ?= /ledasrc/LEDA-4.1
BOOSTROOT ?= /home/marci/boost
INCLUDEDIRS ?= -I../../include -I.. -I../{marci,jacint,alpar,klao,akos,athos} -I$(BOOSTROOT)
-LEDAINCLUDE ?= -I$(LEDAROOT)/incl
-CXXFLAGS = -g -O3 -W -Wall $(INCLUDEDIRS) -ansi -pedantic -ftemplate-depth-30
+#LEDAINCLUDE ?= -I$(LEDAROOT)/incl
+#CXXFLAGS = -g -O3 -W -Wall $(INCLUDEDIRS) -ansi -pedantic -ftemplate-depth-30
LEDABINARIES = leda_graph_demo leda_bfs_dfs max_bipartite_matching_demo
BINARIES = edmonds_karp_demo iterator_bfs_demo macro_test lg_vs_sg bfsit_vs_byhand bipartite_graph_wrapper_test bipartite_matching_try
@@ -30,11 +31,17 @@
leda_graph_demo: leda_graph_demo.o
$(CXX3) -Wall -O -L$(LEDAROOT) -o leda_graph_demo leda_graph_demo.o -lG -lL -lm
+bipartite_matching_leda.o:
+ $(CXX3) $(CXXFLAGS) -I$(LEDAROOT)/incl -c bipartite_matching_leda.cc
+
+bipartite_matching_leda: bipartite_matching_leda.o
+ $(CXX3) $(CXXFLAGS) -L$(LEDAROOT) -o bipartite_matching_leda bipartite_matching_leda.o -lG -lL -lm
+
max_bipartite_matching_demo.o:
- $(CXX3) -Wall -O -I.. -I../alpar -I$(LEDAROOT)/incl -I. -c max_bipartite_matching_demo.cc
+ $(CXX3) $(CXXFLAGS) -I$(LEDAROOT)/incl -c max_bipartite_matching_demo.cc
max_bipartite_matching_demo: max_bipartite_matching_demo.o
- $(CXX3) -Wall -O -L$(LEDAROOT) -o max_bipartite_matching_demo max_bipartite_matching_demo.o -lG -lL -lm
+ $(CXX3) $(CXXFLAGS) -L$(LEDAROOT) -o max_bipartite_matching_demo max_bipartite_matching_demo.o -lG -lL -lm
leda_bfs_dfs.o:
$(CXX3) -Wall -O -I.. -I../alpar -I$(LEDAROOT)/incl -I. -c leda_bfs_dfs.cc