File: graphSorting.hh

package info (click to toggle)
faust 0.9.95~repack1-2
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 164,732 kB
  • ctags: 18,777
  • sloc: cpp: 90,427; sh: 6,116; java: 4,501; objc: 4,428; ansic: 3,301; makefile: 1,298; ruby: 950; yacc: 511; xml: 398; lex: 218; python: 136
file content (21 lines) | stat: -rw-r--r-- 385 bytes parent folder | download | duplicates (3) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 
#ifndef __GRAPHSORTING__
#define __GRAPHSORTING__


#include <set>
#include "loop.hh"

 

typedef set<Loop*>      lset;
typedef vector<Loop*>   lvec;
typedef vector<lset>    lgraph;    

/**
 * Topological sort of an acyclic graph of loops starting 
 * from its root. The loops are collect in an lgraph : a 
 * vector of sets of loops
 */
void sortGraph(Loop* root,lgraph& V);

#endif