org.lflang.graph.PrecedenceGraph< T extends Object > Member List

This is the complete list of members for org.lflang.graph.PrecedenceGraph< T extends Object >, including all inherited members.

addEdge(T sink, T source)	org.lflang.graph.DirectedGraph< T >
addEdges(T sink, List< T > sources)	org.lflang.graph.DirectedGraph< T >
addNode(T node)	org.lflang.graph.DirectedGraph< T >
clear()	org.lflang.graph.DirectedGraph< T >
copy()	org.lflang.graph.DirectedGraph< T >
cycles	org.lflang.graph.PrecedenceGraph< T extends Object >	protected
detectCycles()	org.lflang.graph.PrecedenceGraph< T extends Object >
edgeCount()	org.lflang.graph.DirectedGraph< T >
getCycles()	org.lflang.graph.PrecedenceGraph< T extends Object >
getDownstreamAdjacentNodes(T node)	org.lflang.graph.DirectedGraph< T >
getUpstreamAdjacentNodes(T node)	org.lflang.graph.DirectedGraph< T >
graphChanged()	org.lflang.graph.PrecedenceGraph< T extends Object >
hasCycles()	org.lflang.graph.PrecedenceGraph< T extends Object >
hasNode(T node)	org.lflang.graph.DirectedGraph< T >
leafNodes()	org.lflang.graph.DirectedGraph< T >
merge(DirectedGraph< T > another)	org.lflang.graph.DirectedGraph< T >
nodeCount()	org.lflang.graph.DirectedGraph< T >
nodes()	org.lflang.graph.DirectedGraph< T >
nodesInReverseTopologicalOrder()	org.lflang.graph.PrecedenceGraph< T extends Object >
nodesInTopologicalOrder()	org.lflang.graph.PrecedenceGraph< T extends Object >
PrecedenceGraph()	org.lflang.graph.PrecedenceGraph< T extends Object >
removeEdge(T sink, T source)	org.lflang.graph.DirectedGraph< T >
removeNode(T node)	org.lflang.graph.DirectedGraph< T >
rootNodes()	org.lflang.graph.DirectedGraph< T >
strongConnect(T node)	org.lflang.graph.PrecedenceGraph< T extends Object >
toDOT()	org.lflang.graph.DirectedGraph< T >
toString()	org.lflang.graph.DirectedGraph< T >