org.lflang.graph.InstantiationGraph Member List

This is the complete list of members for org.lflang.graph.InstantiationGraph, including all inherited members.

addEdge(T sink, T source)	org.lflang.graph.PrecedenceGraph< Reactor >
addEdges(T sink, List< T > sources)	org.lflang.graph.PrecedenceGraph< Reactor >
addNode(T node)	org.lflang.graph.PrecedenceGraph< Reactor >
clear()	org.lflang.graph.PrecedenceGraph< Reactor >
copy()	org.lflang.graph.PrecedenceGraph< Reactor >
cycles	org.lflang.graph.PrecedenceGraph< Reactor >	protected
detectCycles()	org.lflang.graph.PrecedenceGraph< Reactor >
edgeCount()	org.lflang.graph.PrecedenceGraph< Reactor >
getCycles()	org.lflang.graph.PrecedenceGraph< Reactor >
getDeclarations(final Reactor definition)	org.lflang.graph.InstantiationGraph
getDownstreamAdjacentNodes(T node)	org.lflang.graph.PrecedenceGraph< Reactor >
getInstantiations(final Reactor definition)	org.lflang.graph.InstantiationGraph
getReactors()	org.lflang.graph.InstantiationGraph
getUpstreamAdjacentNodes(T node)	org.lflang.graph.PrecedenceGraph< Reactor >
graphChanged()	org.lflang.graph.PrecedenceGraph< Reactor >
hasCycles()	org.lflang.graph.PrecedenceGraph< Reactor >
hasNode(T node)	org.lflang.graph.PrecedenceGraph< Reactor >
InstantiationGraph(final Resource resource, final boolean detectCycles)	org.lflang.graph.InstantiationGraph
InstantiationGraph(final Model model, final boolean detectCycles)	org.lflang.graph.InstantiationGraph
leafNodes()	org.lflang.graph.PrecedenceGraph< Reactor >
merge(DirectedGraph< T > another)	org.lflang.graph.PrecedenceGraph< Reactor >
nodeCount()	org.lflang.graph.PrecedenceGraph< Reactor >
nodes()	org.lflang.graph.PrecedenceGraph< Reactor >
nodesInReverseTopologicalOrder()	org.lflang.graph.PrecedenceGraph< Reactor >
nodesInTopologicalOrder()	org.lflang.graph.PrecedenceGraph< Reactor >
PrecedenceGraph()	org.lflang.graph.PrecedenceGraph< Reactor >
reactorToDecl	org.lflang.graph.InstantiationGraph	protected
reactorToInstantiation	org.lflang.graph.InstantiationGraph	protected
removeEdge(T sink, T source)	org.lflang.graph.PrecedenceGraph< Reactor >
removeNode(T node)	org.lflang.graph.PrecedenceGraph< Reactor >
rootNodes()	org.lflang.graph.PrecedenceGraph< Reactor >
strongConnect(T node)	org.lflang.graph.PrecedenceGraph< Reactor >
toDOT()	org.lflang.graph.PrecedenceGraph< Reactor >
toString()	org.lflang.graph.PrecedenceGraph< Reactor >