![]() |
lingua-franca 0.10.1
Lingua Franca code generator
|
Note annotations used in Tarjan's algorithm for finding strongly connected components. More...
Public Attributes | |
| boolean | hasPermMark = false |
| Temporary mark do be used in topological sort algorithm. | |
| boolean | hasTempMark = false |
| Temporary mark do be used in topological sort algorithm. | |
| int | index = -1 |
| Sequence number that is assigned when this node is discovered. | |
| int | lowLink = -1 |
| The smallest index of any node known to be reachable from this node. | |
| boolean | onStack = false |
| Whether or not this node is currently on the stack that keeps track of visited nodes that potentially form a cycle. | |
| boolean | selfLoop = false |
| Whether or not this node has a dependency on itself. | |
Note annotations used in Tarjan's algorithm for finding strongly connected components.
| boolean org.lflang.graph.NodeAnnotation.hasPermMark = false |
Temporary mark do be used in topological sort algorithm.
| boolean org.lflang.graph.NodeAnnotation.hasTempMark = false |
Temporary mark do be used in topological sort algorithm.
| int org.lflang.graph.NodeAnnotation.index = -1 |
Sequence number that is assigned when this node is discovered.
A node with a lower index was discovered later than this one; a node with a higher index was discovered later than this one.
| int org.lflang.graph.NodeAnnotation.lowLink = -1 |
The smallest index of any node known to be reachable from this node.
| boolean org.lflang.graph.NodeAnnotation.onStack = false |
Whether or not this node is currently on the stack that keeps track of visited nodes that potentially form a cycle.
| boolean org.lflang.graph.NodeAnnotation.selfLoop = false |
Whether or not this node has a dependency on itself.