ytOtoPK.h

/*
  math/ytOtoPK.{h,c} : Online Topological Ordering by PK Algorithm
  Copyright (C) 2018, Yoshinori Tamada <tamada  A T  ytlab.jp>
  All rights reserved.
 
  Redistribution and use in source and binary forms, with or without
  modification, are permitted provided that the following conditions
  are met:
 
  * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
 
  * Redistributions in binary form must reproduce the above copyright 
    notice, this list of conditions and the following disclaimer in 
    the documentation and/or other materials provided with the 
    distribution.
 
  * Neither the name of Kyoto University nor the names of its 
    contributors may be used to endorse or promote products derived 
    from this software without specific prior written permission.
 
  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
  FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
  COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  POSSIBILITY OF SUCH DAMAGE.
*/
 
#ifndef __YTLIB_OTO_PK_H
#define __YTLIB_OTO_PK_H
 
#include "ytPCGraph.h"
 
typedef struct {
  int id;
  int ord;
} ytOtoPK_sort_t;
 
typedef struct {
  int size;
  int * ord;
  int * visited;
  ytOtoPK_sort_t * Rf;
  int Rfp;
  ytOtoPK_sort_t * Rb;
  int Rbp;
} ytOtoPK;
 
ytOtoPK * ytOtoPK_new(int size);
ytOtoPK * ytOtoPK_newPCGraph(const ytPCGraph * g);
int       ytOtoPK_init(ytOtoPK * this, const ytPCGraph * g);
void      ytOtoPK_delete(void * this);
void      ytOtoPK_copy(const ytOtoPK * this, ytOtoPK * oto);
int       ytOtoPK_addEdge(ytOtoPK * this, int x, int y, ytPCGraph * g);
int       ytOtoPK_checkCyclic(ytOtoPK * this, int x, int y, const ytPCGraph * g);
int       ytOtoPK_checkCyclicReorder(ytOtoPK * this, int x, int y, const ytPCGraph * g);
void      ytOtoPK_setOrder(const ytOtoPK * this, int * ord);
void      ytOtoPK_printOrder(const ytOtoPK * this, FILE * fp);
 
#endif /* __YTLIB_OTO_PK_H */