text: /* Copyright 2007-2010 ENSEIRB, INRIA & CNRS
  **
  ** This file is part of the Scotch software package for static mapping,
  ** graph partitioning and sparse matrix ordering.
  **
  ** This software is governed by the CeCILL-C license under French law
  ** and abiding by the rules of distribution of free software. You can
  ** use, modify and/or redistribute the software under the terms of the
  ** CeCILL-C license as circulated by CEA, CNRS and INRIA at the following
  ** URL: "http://www.cecill.info".
  ** 
  ** As a counterpart to the access to the source code and rights to copy,
  ** modify and redistribute granted by the license, users are provided
  ** only with a limited warranty and the software's author, the holder of
  ** the economic rights, and the successive licensors have only limited
  ** liability.
  ** 
  ** In this respect, the user's attention is drawn to the risks associated
  ** with loading, using, modifying and/or developing or reproducing the
  ** software by the user in light of its specific status of free software,
  ** that may mean that it is complicated to manipulate, and that also
  ** therefore means that it is reserved for developers and experienced
  ** professionals having in-depth computer knowledge. Users are therefore
  ** encouraged to load and test the software's suitability as regards
  ** their requirements in conditions enabling the security of their
  ** systems and/or data to be ensured and, more generally, to use and
  ** operate it in the same conditions as regards security.
  ** 
  ** The fact that you are presently reading this means that you have had
  ** knowledge of the CeCILL-C license and that you accept its terms.
  */
  /************************************************************/
  /**                                                        **/
  /**   NAME       : wgraph_part_gg.h                        **/
  /**                                                        **/
  /**   AUTHOR     : Jun-Ho HER (v6.0)                       **/
  /**                Charles-Edmond BICHOT (v5.1b)           **/
  /**                                                        **/
  /**   FUNCTION   : These lines are the data declarations   **/
  /**                for the graph partitioning rountine     **/
  /**                based on a vertex-oriented version of   **/
  /**                the Greedy Graph Growing algorithm.     **/
  /**                                                        **/
  /**   DATES      : # Version 5.1  : from : 01 dec 2007     **/
  /**                                 to   : 01 jul 2008     **/
  /**                # Version 6.0  : from : 05 nov 2009     **/
  /**                                 to   : 04 nov 2010     **/
  /**                                                        **/
  /************************************************************/
  
  /*
  **  The defines.
  */
  
  /*+ System-defined constants. +*/
  
  #define WGRAPHSEPAGGSUBBITS         4
  
  #define WGRAPHGGCHOOSELASTPART
  
  /*
  **  The type and structure definitions.
  */
  
  /*+ Method parameters. +*/
  
  typedef struct WgraphPartGgParam_ {
    INT                       passnbr;              /*+ Number of passes to do +*/
  } WgraphPartGgParam;
  
  /*+ The complementary vertex structure. For
    trick reasons, the gain table data structure
    must be the first field of the structure.    +*/
  
  typedef struct WgraphPartGgVertex_ {
    GainLink                      gainlink;         /*+ Gain link: FIRST +*/
    Gnum                          partlvl;
    struct WgraphPartGgVertex_ *  prev;
    struct WgraphPartGgVertex_ *  next;
  } WgraphPartGgVertex;
  
  /*
  **  The function prototypes.
  */
  
  #ifndef WGRAPH_PART_GG
  #define static
  #endif
  
  int                         wgraphPartGg        (Wgraph * restrict const, const WgraphPartGgParam * restrict const);
  
  #undef static
  