|
1 /* glpnet.h (graph and network algorithms) */ |
|
2 |
|
3 /*********************************************************************** |
|
4 * This code is part of GLPK (GNU Linear Programming Kit). |
|
5 * |
|
6 * Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, |
|
7 * 2009, 2010 Andrew Makhorin, Department for Applied Informatics, |
|
8 * Moscow Aviation Institute, Moscow, Russia. All rights reserved. |
|
9 * E-mail: <mao@gnu.org>. |
|
10 * |
|
11 * GLPK is free software: you can redistribute it and/or modify it |
|
12 * under the terms of the GNU General Public License as published by |
|
13 * the Free Software Foundation, either version 3 of the License, or |
|
14 * (at your option) any later version. |
|
15 * |
|
16 * GLPK is distributed in the hope that it will be useful, but WITHOUT |
|
17 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
|
18 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public |
|
19 * License for more details. |
|
20 * |
|
21 * You should have received a copy of the GNU General Public License |
|
22 * along with GLPK. If not, see <http://www.gnu.org/licenses/>. |
|
23 ***********************************************************************/ |
|
24 |
|
25 #ifndef GLPNET_H |
|
26 #define GLPNET_H |
|
27 |
|
28 #define mc21a _glp_mc21a |
|
29 int mc21a(int n, const int icn[], const int ip[], const int lenr[], |
|
30 int iperm[], int pr[], int arp[], int cv[], int out[]); |
|
31 /* permutations for zero-free diagonal */ |
|
32 |
|
33 #define mc13d _glp_mc13d |
|
34 int mc13d(int n, const int icn[], const int ip[], const int lenr[], |
|
35 int ior[], int ib[], int lowl[], int numb[], int prev[]); |
|
36 /* permutations to block triangular form */ |
|
37 |
|
38 #define okalg _glp_okalg |
|
39 int okalg(int nv, int na, const int tail[], const int head[], |
|
40 const int low[], const int cap[], const int cost[], int x[], |
|
41 int pi[]); |
|
42 /* out-of-kilter algorithm */ |
|
43 |
|
44 #define ffalg _glp_ffalg |
|
45 void ffalg(int nv, int na, const int tail[], const int head[], |
|
46 int s, int t, const int cap[], int x[], char cut[]); |
|
47 /* Ford-Fulkerson algorithm */ |
|
48 |
|
49 #define wclique _glp_wclique |
|
50 int wclique(int n, const int w[], const unsigned char a[], int ind[]); |
|
51 /* find maximum weight clique with Ostergard's algorithm */ |
|
52 |
|
53 #define kellerman _glp_kellerman |
|
54 int kellerman(int n, int (*func)(void *info, int i, int ind[]), |
|
55 void *info, void /* glp_graph */ *H); |
|
56 /* cover edges by cliques with Kellerman's heuristic */ |
|
57 |
|
58 #endif |
|
59 |
|
60 /* eof */ |