1.1 --- a/src/work/jacint/max_flow.h Thu Apr 29 16:29:43 2004 +0000
1.2 +++ b/src/work/jacint/max_flow.h Thu Apr 29 16:30:39 2004 +0000
1.3 @@ -33,8 +33,8 @@
1.4
1.5 */
1.6
1.7 -#ifndef HUGO_PREFLOW_H
1.8 -#define HUGO_PREFLOW_H
1.9 +#ifndef HUGO_MAX_FLOW_H
1.10 +#define HUGO_MAX_FLOW_H
1.11
1.12 #define H0 20
1.13 #define H1 1
1.14 @@ -1009,7 +1009,7 @@
1.15
1.16 } //namespace hugo
1.17
1.18 -#endif //HUGO_PREFLOW_H
1.19 +#endif //HUGO_MAX_FLOW_H
1.20
1.21
1.22
2.1 --- a/src/work/marci/bipartite_graph_wrapper_test.cc Thu Apr 29 16:29:43 2004 +0000
2.2 +++ b/src/work/marci/bipartite_graph_wrapper_test.cc Thu Apr 29 16:30:39 2004 +0000
2.3 @@ -11,7 +11,7 @@
2.4 #include <bfs_iterator.h>
2.5 #include <graph_wrapper.h>
2.6 #include <maps.h>
2.7 -#include <preflow.h>
2.8 +#include <max_flow.h>
2.9
2.10 using namespace hugo;
2.11
3.1 --- a/src/work/marci/bipartite_matching_try.cc Thu Apr 29 16:29:43 2004 +0000
3.2 +++ b/src/work/marci/bipartite_matching_try.cc Thu Apr 29 16:30:39 2004 +0000
3.3 @@ -12,7 +12,7 @@
3.4 #include <bfs_iterator.h>
3.5 #include <graph_wrapper.h>
3.6 #include <maps.h>
3.7 -#include <preflow.h>
3.8 +#include <max_flow.h>
3.9
3.10 /**
3.11 * Inicializalja a veletlenszamgeneratort.
4.1 --- a/src/work/marci/lg_vs_sg.cc Thu Apr 29 16:29:43 2004 +0000
4.2 +++ b/src/work/marci/lg_vs_sg.cc Thu Apr 29 16:30:39 2004 +0000
4.3 @@ -6,7 +6,7 @@
4.4 #include <list_graph.h>
4.5 #include <smart_graph.h>
4.6 #include <dimacs.h>
4.7 -#include <preflow.h>
4.8 +#include <max_flow.h>
4.9 #include <time_measure.h>
4.10 #include <for_each_macros.h>
4.11
5.1 --- a/src/work/marci/max_flow_demo.cc Thu Apr 29 16:29:43 2004 +0000
5.2 +++ b/src/work/marci/max_flow_demo.cc Thu Apr 29 16:30:39 2004 +0000
5.3 @@ -7,7 +7,7 @@
5.4 #include <dimacs.h>
5.5 #include <time_measure.h>
5.6 //#include <graph_wrapper.h>
5.7 -#include <preflow.h>
5.8 +#include <max_flow.h>
5.9 //#include <preflow_res.h>
5.10 #include <for_each_macros.h>
5.11