alpar@1: /* glpnet.h (graph and network algorithms) */
alpar@1: 
alpar@1: /***********************************************************************
alpar@1: *  This code is part of GLPK (GNU Linear Programming Kit).
alpar@1: *
alpar@1: *  Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008,
alpar@1: *  2009, 2010 Andrew Makhorin, Department for Applied Informatics,
alpar@1: *  Moscow Aviation Institute, Moscow, Russia. All rights reserved.
alpar@1: *  E-mail: <mao@gnu.org>.
alpar@1: *
alpar@1: *  GLPK is free software: you can redistribute it and/or modify it
alpar@1: *  under the terms of the GNU General Public License as published by
alpar@1: *  the Free Software Foundation, either version 3 of the License, or
alpar@1: *  (at your option) any later version.
alpar@1: *
alpar@1: *  GLPK is distributed in the hope that it will be useful, but WITHOUT
alpar@1: *  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
alpar@1: *  or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
alpar@1: *  License for more details.
alpar@1: *
alpar@1: *  You should have received a copy of the GNU General Public License
alpar@1: *  along with GLPK. If not, see <http://www.gnu.org/licenses/>.
alpar@1: ***********************************************************************/
alpar@1: 
alpar@1: #ifndef GLPNET_H
alpar@1: #define GLPNET_H
alpar@1: 
alpar@1: #define mc21a _glp_mc21a
alpar@1: int mc21a(int n, const int icn[], const int ip[], const int lenr[],
alpar@1:       int iperm[], int pr[], int arp[], int cv[], int out[]);
alpar@1: /* permutations for zero-free diagonal */
alpar@1: 
alpar@1: #define mc13d _glp_mc13d
alpar@1: int mc13d(int n, const int icn[], const int ip[], const int lenr[],
alpar@1:       int ior[], int ib[], int lowl[], int numb[], int prev[]);
alpar@1: /* permutations to block triangular form */
alpar@1: 
alpar@1: #define okalg _glp_okalg
alpar@1: int okalg(int nv, int na, const int tail[], const int head[],
alpar@1:       const int low[], const int cap[], const int cost[], int x[],
alpar@1:       int pi[]);
alpar@1: /* out-of-kilter algorithm */
alpar@1: 
alpar@1: #define ffalg _glp_ffalg
alpar@1: void ffalg(int nv, int na, const int tail[], const int head[],
alpar@1:       int s, int t, const int cap[], int x[], char cut[]);
alpar@1: /* Ford-Fulkerson algorithm */
alpar@1: 
alpar@1: #define wclique _glp_wclique
alpar@1: int wclique(int n, const int w[], const unsigned char a[], int ind[]);
alpar@1: /* find maximum weight clique with Ostergard's algorithm */
alpar@1: 
alpar@1: #define kellerman _glp_kellerman
alpar@1: int kellerman(int n, int (*func)(void *info, int i, int ind[]),
alpar@1:       void *info, void /* glp_graph */ *H);
alpar@1: /* cover edges by cliques with Kellerman's heuristic */
alpar@1: 
alpar@1: #endif
alpar@1: 
alpar@1: /* eof */