https://hal.archives-ouvertes.fr/hal-03445891
README
/***************************************************************************
* Copyright (C) 2007 by Sid Touati *
* Sid-nospamDOTTouati-nospam@inria.fr *
* Copyright INRIA and University of Versailles (France) *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
* Exception : this software requires a licence of the LEDA libary. *
* You can buy a LEDA licence from algorithmic-solutions *
* http://www.algorithmic-solutions.com *
* LEDA source codes are excluded from this GPL. *
* Obtaining a LEDA licence is not mandatory to use our GPL software *
* If the user wants, he can create a free source-compatible replacement*
* for LEDA. *
***************************************************************************/
Title: Dilworth Decomposition in C++ using the LEDA Graph library
This is a C++ implementation of Dilworth Decomposition using LEDA Graph Library.
Before build, you need
----------------------
- A LEDA licence
- the LEDAROOT variable should be set to the toplevel directory of LEDA
- the LEDA include file are assumed in $LEDAROOT/incl
- the LEDA libraries are assumed in $LEDAROOT
Build
-----
If $LEDAROOT is correctly set, then you have to just type
./configure
./make
DO not compile the software with -02 option (or higher). Please let it to compile with -O1 or -O2 options.
g++ produces bizarre results when using -02 or higher.
There is an executable software generated as example. It is called "dilworthdecomposition".
In order to use it, just type
./dilworthdecomposition graph.gw
graph.gw is a sample of acyclic graph.
Our software is aimed to be used as a C++ library. There is a user manual.
Please do not hesitate to contact me for further issues...
S.T.