interpretor/faust-0.9.47mr3/compiler/parallelize/graphSorting.hh

   1 #ifndef __GRAPHSORTING__
   2 #define __GRAPHSORTING__
   3
   4
   5 #include <set>
   6 #include "loop.hh"
   7
   8
   9
  10 typedef set<Loop*>      lset;
  11 typedef vector<Loop*>   lvec;
  12 typedef vector<lset>    lgraph;
  13
  14 /**
  15  * Topological sort of an acyclic graph of loops starting
  16  * from its root. The loops are collect in an lgraph : a
  17  * vector of sets of loops
  18  */
  19 void sortGraph(Loop* root,lgraph& V);
  20
  21 #endif