Baseclasses
Definition
The module LEDAMakeAcyclic is a front end for LEDA's Make_Acyclic() function. It computes an acyclic subgraph of an input graph G.
General Information
| Algorithm | |
| name | Make Acyclic |
| long name | LEDA's Make Acyclic |
| author | |
| Implementation | |
| author | S. Näher |
| date | |
| version | |
Pre- and Postcondition
| precondition | = | {directed} |
| postcondition(PRE) | = | {maximalacyclic, directed} |
#include < AGD/LEDAMakeAcyclic.h >
Creation
| LEDAMakeAcyclic | S | creates an instance S of type LEDAMakeAcyclic. |
Operations
Standard Interface (Inherited Methods) The detailed description of these methods can be found in the manual entries of the base class (SubgraphModule).
| bool | S.check(const graph& G, AgdKey& p) | |
| bool | S.call(const graph& G, list<edge>& L) | |
| bool | S.call(graph& G) | |
| bool | S.call(GraphCopy& G, list<edge>& L) | |
| int | S.num_del_edges() |
© Copyright 1998-2001, Algorithmic Solutions Software GmbH. All rights reserved.
2001-08-13