COIN-OR::LEMON - Graph Library

source: glpk-cmake/src/glpnet.h @ 1:c445c931472f

Last change on this file since 1:c445c931472f was 1:c445c931472f, checked in by Alpar Juttner <alpar@…>, 10 years ago

Import glpk-4.45

  • Generated files and doc/notes are removed
File size: 2.2 KB
1/* glpnet.h (graph and network algorithms) */
4*  This code is part of GLPK (GNU Linear Programming Kit).
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: <>.
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.
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.
21*  You should have received a copy of the GNU General Public License
22*  along with GLPK. If not, see <>.
25#ifndef GLPNET_H
26#define GLPNET_H
28#define mc21a _glp_mc21a
29int 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 */
33#define mc13d _glp_mc13d
34int 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 */
38#define okalg _glp_okalg
39int 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 */
44#define ffalg _glp_ffalg
45void 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 */
49#define wclique _glp_wclique
50int wclique(int n, const int w[], const unsigned char a[], int ind[]);
51/* find maximum weight clique with Ostergard's algorithm */
53#define kellerman _glp_kellerman
54int 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 */
60/* eof */
Note: See TracBrowser for help on using the repository browser.