Directed Acyclic Graphs (DAG) are well known in graph theory and it optimizing compilation. This file contains the API of our implementation of Directed Acyclic Graphs as used in optimizing compilation. The DAG model we implement here is described in DAG Model.
Definition in file DAG.h.
Go to the source code of this file.
Namespaces | |
| namespace | DDG |
| namespace | std |
| namespace | LEDA |
Data Structures | |
| class | DAG |
| This class represents a directed acyclic graph (DAG). More... | |
Defines | |
| #define | MAX_NODE 10001 |
Functions | |
| template<class T> | |
| LEDA::list< T > | set_to_list (const set< T > l) |
| template<class T> | |
| set< T > | list_to_set (const list< T > l) |
| bool | lt (node u, node v) |
| bool | le (node u, node v) |
| bool | gt (node u, node v) |
| bool | ge (node u, node v) |
| bool | parallel (node u, node v) |
| bool | comparable (node u, node v) |
| int | MAXIMAL_ANTI_CHAIN (const graph &G, set< node > &MA) |
| int | MINIMAL_CHAIN (const graph &G, node_array< int > &chain) |
| int | MINIMAL_CHAIN (const DAG &G, array< list< node > > &C) |
| int | REGISTER_SATURATION (const DAG &G, leda::list< node > &RS_values) |
| int | REGISTER_SATURATION (const DAG &G, leda::list< node > &RS_values, node_array< node > &k) |
| int | REGISTER_SATURATION (const DAG &G, int t, leda::list< node > &RS_values) |
| int | REGISTER_SATURATION (const DAG &G, int t, leda::list< node > &RS_values, node_array< node > &k) |
