|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectde.cau.cs.kieler.krep.compiler.dependencies.DepGraph
public class DepGraph
Dependency graph of the dataflow program.
Constructor Summary | |
---|---|
DepGraph(HashMap<String,LinkedList<String>> eqs)
generate dependency graph for the program. |
Method Summary | |
---|---|
void |
add(String s,
String t)
add a new dependency from s to t. |
void |
addSubGraph(String name,
DepGraph d)
|
int |
getMaxPrio()
|
int |
getPrio(String name)
|
List<String> |
sort()
|
void |
split(int n)
Cluster all nodes, cluster 0 are inputs, cluster n are outputs. |
String |
toDot(boolean printHeader)
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public DepGraph(HashMap<String,LinkedList<String>> eqs)
eqs
- equations of the programMethod Detail |
---|
public void add(String s, String t)
s
- source of the dependencyt
- target of the dependencypublic List<String> sort()
public void split(int n)
n
- number of clusterspublic String toDot(boolean printHeader)
printHeader
- print initialization code?
public int getPrio(String name)
name
- of a node
public int getMaxPrio()
public void addSubGraph(String name, DepGraph d)
name
- name of the subgraphd
- a dependency graph that is added
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |