tools/SDAGUtils.h Source File

00001 /* #start# ***********************************************************
00002 
00003                              Scheduling Simulator
00004                     Lehrstuhl f"ur Effiziente Algorithmen
00005                        Technische Universit"at M"unchen
00006 
00007  File    : $Id: SDAGUtils.h,v 1.2 2003/01/15 15:51:51 hall Exp $
00008 
00009  Purpose : serveral DAG-Utils (e.g. topSort)
00010 
00011  RCS-Log:
00012  $Log: SDAGUtils.h,v $
00013  Revision 1.2  2003/01/15 15:51:51  hall
00014  *** empty log message ***
00015 
00016  Revision 1.1  2002/08/29 12:59:59  taeubig
00017  Added the sources
00018 
00019  Revision 1.5  2000/11/20 11:38:52  taeubig
00020  wrong description corrected
00021 
00022  Revision 1.4  2000/05/24 12:53:40  taeubig
00023  New compiler (gcc-2.95) and new Qt (2.1)
00024  Replaced "list" by "leda_list" etc.
00025 
00026  Revision 1.3  2000/05/04 16:08:37  schickin
00027  added layout for trees
00028 
00029  Revision 1.2  1999/10/29 10:47:00  schickin
00030  line topology (between mesh and single-top.) added
00031 
00032  Revision 1.1  1999/06/17 16:37:02  hall
00033  nc
00034 
00035 
00036  * #end# ************************************************************* */
00037 
00038 #ifndef SDAGUTILS_H
00039 #define SDAGUTILS_H
00040 
00041 #include <LEDA/graph.h>
00042 
00043 // ----------------------------------------------------------------------
00044 // for top sort use LEDA-TOPSORT!
00045 void inverseTopSort(const leda_graph &g, leda_node_array<int> &ret);
00046 // ----------------------------------------------------------------------
00050 leda_node isInTree(const leda_graph& g);
00051 // ----------------------------------------------------------------------
00055 leda_node isOutTree(const leda_graph& g);
00056 // ----------------------------------------------------------------------
00057 
00058 #endif