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