[Lemon-commits] [lemon_svn] marci: r728 - in hugo/trunk/src/work: jacint klao marci

[Lemon SVN]

Author: marci
Date: Thu May  6 18:54:54 2004
New Revision: 728

Modified:
   hugo/trunk/src/work/jacint/max_flow.h
   hugo/trunk/src/work/klao/iter_map.h
   hugo/trunk/src/work/marci/bfsit_vs_byhand.cc
   hugo/trunk/src/work/marci/bipartite_graph_wrapper.h
   hugo/trunk/src/work/marci/bipartite_graph_wrapper_test.cc
   hugo/trunk/src/work/marci/bipartite_matching_try.cc
   hugo/trunk/src/work/marci/bipartite_matching_try_2.cc
   hugo/trunk/src/work/marci/bipartite_matching_try_3.cc
   hugo/trunk/src/work/marci/lg_vs_sg.cc
   hugo/trunk/src/work/marci/makefile
   hugo/trunk/src/work/marci/max_flow_demo.cc

Log:
#include <hugo/ > modifications


Modified: hugo/trunk/src/work/jacint/max_flow.h
==============================================================================
--- hugo/trunk/src/work/jacint/max_flow.h	(original)
+++ hugo/trunk/src/work/jacint/max_flow.h	Thu May  6 18:54:54 2004
@@ -45,8 +45,8 @@
 
 #include <graph_wrapper.h>
 #include <bfs_iterator.h>
-#include <invalid.h>
-#include <maps.h>
+#include <hugo/invalid.h>
+#include <hugo/maps.h>
 #include <for_each_macros.h>
 
 /// \file

Modified: hugo/trunk/src/work/klao/iter_map.h
==============================================================================
--- hugo/trunk/src/work/klao/iter_map.h	(original)
+++ hugo/trunk/src/work/klao/iter_map.h	Thu May  6 18:54:54 2004
@@ -10,7 +10,7 @@
 // for memset
 #include <cstring>
 
-#include <invalid.h>
+#include <hugo/invalid.h>
 
 namespace hugo {
 

Modified: hugo/trunk/src/work/marci/bfsit_vs_byhand.cc
==============================================================================
--- hugo/trunk/src/work/marci/bfsit_vs_byhand.cc	(original)
+++ hugo/trunk/src/work/marci/bfsit_vs_byhand.cc	Thu May  6 18:54:54 2004
@@ -4,8 +4,8 @@
 
 #include <list_graph.h>
 //#include <smart_graph.h>
-#include <dimacs.h>
-#include <time_measure.h>
+#include <hugo/dimacs.h>
+#include <hugo/time_measure.h>
 #include <for_each_macros.h>
 #include <bfs_iterator.h>
 

Modified: hugo/trunk/src/work/marci/bipartite_graph_wrapper.h
==============================================================================
--- hugo/trunk/src/work/marci/bipartite_graph_wrapper.h	(original)
+++ hugo/trunk/src/work/marci/bipartite_graph_wrapper.h	Thu May  6 18:54:54 2004
@@ -10,7 +10,7 @@
 ///
 ///\author Marton Makai
 
-#include <invalid.h>
+#include <hugo/invalid.h>
 #include <iter_map.h>
 #include <graph_wrapper.h>
 

Modified: hugo/trunk/src/work/marci/bipartite_graph_wrapper_test.cc
==============================================================================
--- hugo/trunk/src/work/marci/bipartite_graph_wrapper_test.cc	(original)
+++ hugo/trunk/src/work/marci/bipartite_graph_wrapper_test.cc	Thu May  6 18:54:54 2004
@@ -6,12 +6,12 @@
 #include <list_graph.h>
 //#include <smart_graph.h>
 //#include <dimacs.h>
-#include <time_measure.h>
+#include <hugo/time_measure.h>
 #include <for_each_macros.h>
 #include <bfs_iterator.h>
 #include <graph_wrapper.h>
 #include <bipartite_graph_wrapper.h>
-#include <maps.h>
+#include <hugo/maps.h>
 #include <max_flow.h>
 
 using namespace hugo;

Modified: hugo/trunk/src/work/marci/bipartite_matching_try.cc
==============================================================================
--- hugo/trunk/src/work/marci/bipartite_matching_try.cc	(original)
+++ hugo/trunk/src/work/marci/bipartite_matching_try.cc	Thu May  6 18:54:54 2004
@@ -7,12 +7,12 @@
 #include <list_graph.h>
 //#include <smart_graph.h>
 //#include <dimacs.h>
-#include <time_measure.h>
+#include <hugo/time_measure.h>
 #include <for_each_macros.h>
 #include <bfs_iterator.h>
 #include <graph_wrapper.h>
 #include <bipartite_graph_wrapper.h>
-#include <maps.h>
+#include <hugo/maps.h>
 #include <max_flow.h>
 
 /**

Modified: hugo/trunk/src/work/marci/bipartite_matching_try_2.cc
==============================================================================
--- hugo/trunk/src/work/marci/bipartite_matching_try_2.cc	(original)
+++ hugo/trunk/src/work/marci/bipartite_matching_try_2.cc	Thu May  6 18:54:54 2004
@@ -7,11 +7,11 @@
 #include <list_graph.h>
 //#include <smart_graph.h>
 //#include <dimacs.h>
-#include <time_measure.h>
+#include <hugo/time_measure.h>
 #include <for_each_macros.h>
 #include <bfs_iterator.h>
 #include <bipartite_graph_wrapper.h>
-#include <maps.h>
+#include <hugo/maps.h>
 #include <max_flow.h>
 
 /**

Modified: hugo/trunk/src/work/marci/bipartite_matching_try_3.cc
==============================================================================
--- hugo/trunk/src/work/marci/bipartite_matching_try_3.cc	(original)
+++ hugo/trunk/src/work/marci/bipartite_matching_try_3.cc	Thu May  6 18:54:54 2004
@@ -7,11 +7,11 @@
 #include <list_graph.h>
 //#include <smart_graph.h>
 //#include <dimacs.h>
-#include <time_measure.h>
+#include <hugo/time_measure.h>
 #include <for_each_macros.h>
 #include <bfs_iterator.h>
 #include <bipartite_graph_wrapper.h>
-#include <maps.h>
+#include <hugo/maps.h>
 #include <max_flow.h>
 
 using namespace hugo;

Modified: hugo/trunk/src/work/marci/lg_vs_sg.cc
==============================================================================
--- hugo/trunk/src/work/marci/lg_vs_sg.cc	(original)
+++ hugo/trunk/src/work/marci/lg_vs_sg.cc	Thu May  6 18:54:54 2004
@@ -4,10 +4,10 @@
 #include <string>
 
 #include <list_graph.h>
-#include <smart_graph.h>
-#include <dimacs.h>
+#include <hugo/smart_graph.h>
+#include <hugo/dimacs.h>
 #include <max_flow.h>
-#include <time_measure.h>
+#include <hugo/time_measure.h>
 #include <for_each_macros.h>
 
 using namespace hugo;

Modified: hugo/trunk/src/work/marci/makefile
==============================================================================
--- hugo/trunk/src/work/marci/makefile	(original)
+++ hugo/trunk/src/work/marci/makefile	Thu May  6 18:54:54 2004
@@ -1,7 +1,7 @@
 CXX2 = g++-2.95
 CXX3=$(CXX)
 BOOSTROOT ?= /home/marci/boost
-INCLUDEDIRS ?= -I../.. -I../../hugo -I.. -I../{marci,jacint,alpar,klao,akos,athos} -I$(BOOSTROOT)
+INCLUDEDIRS ?= -I../.. -I.. -I../{marci,jacint,alpar,klao,akos,athos} -I$(BOOSTROOT)
 
 LEDABINARIES = leda_graph_demo leda_bfs_dfs max_bipartite_matching_demo
 BINARIES = max_flow_demo iterator_bfs_demo macro_test lg_vs_sg bfsit_vs_byhand bipartite_graph_wrapper_test bipartite_matching_try bipartite_matching_try_2 bipartite_matching_try_3 top_sort_test

Modified: hugo/trunk/src/work/marci/max_flow_demo.cc
==============================================================================
--- hugo/trunk/src/work/marci/max_flow_demo.cc	(original)
+++ hugo/trunk/src/work/marci/max_flow_demo.cc	Thu May  6 18:54:54 2004
@@ -3,9 +3,9 @@
 #include <fstream>
 
 #include <list_graph.h>
-#include <smart_graph.h>
-#include <dimacs.h>
-#include <time_measure.h>
+#include <hugo/smart_graph.h>
+#include <hugo/dimacs.h>
+#include <hugo/time_measure.h>
 //#include <graph_wrapper.h>
 #include <max_flow.h>
 //#include <preflow_res.h>