00001 /* EGlib "Efficient General Library" provides some basic structures and 00002 * algorithms commons in many optimization algorithms. 00003 * 00004 * Copyright (C) 2005 Daniel Espinoza and Marcos Goycoolea. 00005 * 00006 * This library is free software; you can redistribute it and/or modify it 00007 * under the terms of the GNU Lesser General Public License as published by the 00008 * Free Software Foundation; either version 2.1 of the License, or (at your 00009 * option) any later version. 00010 * 00011 * This library is distributed in the hope that it will be useful, but 00012 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 00013 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public 00014 * License for more details. 00015 * 00016 * You should have received a copy of the GNU Lesser General Public License 00017 * along with this library; if not, write to the Free Software Foundation, 00018 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 00019 * */ 00020 #ifndef _EGBELLFORD 00021 #define _EGBELLFORD 00022 00023 #include<stdio.h> 00024 #include<stdlib.h> 00025 00026 #include "eg_dgraph.h" 00027 #include "eg_dijkstra.h" 00028 #include "eg_macros.h" 00029 00030 int EGbellFord (EGdGraphNode_t * s, 00031 size_t * os, 00032 EGdGraph_t * G); 00033 00034 void EGbellFordInitialize (EGdGraphNode_t * s, 00035 EGdGraph_t * G, 00036 size_t * os); 00037 void EGbellFordRelax (EGdGraphEdge_t * e, 00038 size_t * os); 00039 int EGbellFordIsNegativeCycle (EGdGraph_t * G, 00040 size_t * os); 00041 00042 #endif
1.4.5