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