equal
deleted
inserted
replaced
11 |
11 |
12 #include <leda_graph_wrapper.h> |
12 #include <leda_graph_wrapper.h> |
13 #include <sage_graph.h> |
13 #include <sage_graph.h> |
14 //#include <smart_graph.h> |
14 //#include <smart_graph.h> |
15 //#include <dimacs.h> |
15 //#include <dimacs.h> |
16 #include <hugo/time_measure.h> |
16 #include <lemon/time_measure.h> |
17 #include <for_each_macros.h> |
17 #include <for_each_macros.h> |
18 #include <hugo/graph_wrapper.h> |
18 #include <lemon/graph_wrapper.h> |
19 #include <bipartite_graph_wrapper.h> |
19 #include <bipartite_graph_wrapper.h> |
20 #include <hugo/maps.h> |
20 #include <lemon/maps.h> |
21 #include <hugo/max_flow.h> |
21 #include <lemon/max_flow.h> |
22 |
22 |
23 /** |
23 /** |
24 * Inicializalja a veletlenszamgeneratort. |
24 * Inicializalja a veletlenszamgeneratort. |
25 * Figyelem, ez nem jo igazi random szamokhoz, |
25 * Figyelem, ez nem jo igazi random szamokhoz, |
26 * erre ne bizzad a titkaidat! |
26 * erre ne bizzad a titkaidat! |
40 int random(int m) |
40 int random(int m) |
41 { |
41 { |
42 return int( double(m) * rand() / (RAND_MAX + 1.0) ); |
42 return int( double(m) * rand() / (RAND_MAX + 1.0) ); |
43 } |
43 } |
44 |
44 |
45 using namespace hugo; |
45 using namespace lemon; |
46 |
46 |
47 int main() { |
47 int main() { |
48 //for leda graph |
48 //for leda graph |
49 leda::graph lg; |
49 leda::graph lg; |
50 //lg.make_undirected(); |
50 //lg.make_undirected(); |