00001 // ---------------------------------------------------------------------------- 00002 // 00003 // $Id$ 00004 // 00005 // Copyright 2008, 2009, 2010, 2011, 2012 Antonio Franchi and Paolo Stegagno 00006 // 00007 // This file is part of MIP. 00008 // 00009 // MIP is free software: you can redistribute it and/or modify 00010 // it under the terms of the GNU General Public License as published by 00011 // the Free Software Foundation, either version 3 of the License, or 00012 // (at your option) any later version. 00013 // 00014 // MIP is distributed in the hope that it will be useful, 00015 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00016 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00017 // GNU General Public License for more details. 00018 // 00019 // You should have received a copy of the GNU General Public License 00020 // along with MIP. If not, see <http://www.gnu.org/licenses/>. 00021 // 00022 // Contact info: antonio.franchi@tuebingen.mpg.de stegagno@diag.uniroma1.it 00023 // 00024 // ---------------------------------------------------------------------------- 00025 00026 00030 00034 00036 /* @{ */ 00037 00038 #ifndef __GRAPH_H_ 00039 #define __GRAPH_H_ 00040 00041 #ifdef MIP_HOST_APPLE 00042 #include <applePatch.h> 00043 #endif 00044 00045 #include <stdio.h> 00046 #include <fcntl.h> 00047 #include <unistd.h> 00048 #include <string.h> 00049 #include <stdlib.h> 00050 #include <signal.h> 00051 #include <assert.h> 00052 00053 #include <iostream> // std::cout 00054 #include <utility> // std::pair 00055 // #include <boost/graph/graph_traits.hpp> 00056 // #include <boost/graph/adjacency_list.hpp> 00057 // #include <boost/graph/topological_sort.hpp> 00058 00059 00060 00061 00062 00063 #endif 00064 00065 /* @} */ 00066
1.5.6