![]() |
lingua-franca 0.10.1
Lingua Franca code generator
|
This implements a special graph that I call a ConnectionGraph. More...
Public Member Functions | |
| void | addEdge (V source, V destination, E edge) |
| void | addEdges (V source, V destination, Set< E > edges) |
| ConnectionGraph () | |
| Map< V, Set< E > > | getDownstreamOf (V node) |
| List< V > | getNodes () |
| Map< V, Set< E > > | getUpstreamOf (V node) |
This implements a special graph that I call a ConnectionGraph.
It differs from the other graphs in that both nodes and edges are parameterizable. So we can annotate nodes and edges. This is needed for the connection graphs because we need to annotate an edge with the delay and whether it is physical or not.
| org.lflang.graph.ConnectionGraph< V extends Object, E extends Object >.ConnectionGraph | ( | ) |
| void org.lflang.graph.ConnectionGraph< V extends Object, E extends Object >.addEdge | ( | V | source, |
| V | destination, | ||
| E | edge ) |
| void org.lflang.graph.ConnectionGraph< V extends Object, E extends Object >.addEdges | ( | V | source, |
| V | destination, | ||
| Set< E > | edges ) |
| Map< V, Set< E > > org.lflang.graph.ConnectionGraph< V extends Object, E extends Object >.getDownstreamOf | ( | V | node | ) |
| List< V > org.lflang.graph.ConnectionGraph< V extends Object, E extends Object >.getNodes | ( | ) |
| Map< V, Set< E > > org.lflang.graph.ConnectionGraph< V extends Object, E extends Object >.getUpstreamOf | ( | V | node | ) |