lemon-project-template-glpk
diff deps/glpk/src/glpnet.h @ 9:33de93886c88
Import GLPK 4.47
author | Alpar Juttner <alpar@cs.elte.hu> |
---|---|
date | Sun, 06 Nov 2011 20:59:10 +0100 |
parents | |
children |
line diff
1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/deps/glpk/src/glpnet.h Sun Nov 06 20:59:10 2011 +0100 1.3 @@ -0,0 +1,60 @@ 1.4 +/* glpnet.h (graph and network algorithms) */ 1.5 + 1.6 +/*********************************************************************** 1.7 +* This code is part of GLPK (GNU Linear Programming Kit). 1.8 +* 1.9 +* Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 1.10 +* 2009, 2010, 2011 Andrew Makhorin, Department for Applied Informatics, 1.11 +* Moscow Aviation Institute, Moscow, Russia. All rights reserved. 1.12 +* E-mail: <mao@gnu.org>. 1.13 +* 1.14 +* GLPK is free software: you can redistribute it and/or modify it 1.15 +* under the terms of the GNU General Public License as published by 1.16 +* the Free Software Foundation, either version 3 of the License, or 1.17 +* (at your option) any later version. 1.18 +* 1.19 +* GLPK is distributed in the hope that it will be useful, but WITHOUT 1.20 +* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 1.21 +* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public 1.22 +* License for more details. 1.23 +* 1.24 +* You should have received a copy of the GNU General Public License 1.25 +* along with GLPK. If not, see <http://www.gnu.org/licenses/>. 1.26 +***********************************************************************/ 1.27 + 1.28 +#ifndef GLPNET_H 1.29 +#define GLPNET_H 1.30 + 1.31 +#define mc21a _glp_mc21a 1.32 +int mc21a(int n, const int icn[], const int ip[], const int lenr[], 1.33 + int iperm[], int pr[], int arp[], int cv[], int out[]); 1.34 +/* permutations for zero-free diagonal */ 1.35 + 1.36 +#define mc13d _glp_mc13d 1.37 +int mc13d(int n, const int icn[], const int ip[], const int lenr[], 1.38 + int ior[], int ib[], int lowl[], int numb[], int prev[]); 1.39 +/* permutations to block triangular form */ 1.40 + 1.41 +#define okalg _glp_okalg 1.42 +int okalg(int nv, int na, const int tail[], const int head[], 1.43 + const int low[], const int cap[], const int cost[], int x[], 1.44 + int pi[]); 1.45 +/* out-of-kilter algorithm */ 1.46 + 1.47 +#define ffalg _glp_ffalg 1.48 +void ffalg(int nv, int na, const int tail[], const int head[], 1.49 + int s, int t, const int cap[], int x[], char cut[]); 1.50 +/* Ford-Fulkerson algorithm */ 1.51 + 1.52 +#define wclique _glp_wclique 1.53 +int wclique(int n, const int w[], const unsigned char a[], int ind[]); 1.54 +/* find maximum weight clique with Ostergard's algorithm */ 1.55 + 1.56 +#define kellerman _glp_kellerman 1.57 +int kellerman(int n, int (*func)(void *info, int i, int ind[]), 1.58 + void *info, void /* glp_graph */ *H); 1.59 +/* cover edges by cliques with Kellerman's heuristic */ 1.60 + 1.61 +#endif 1.62 + 1.63 +/* eof */