Function interface.Gate.backward() on all the elements in a reverse
topologically ordered list of the gates present in this circuit.FunctionGate.forward() on all the elements in a topologically
ordered list of the gates present in this circuit.Gate is the basic building block for the computational directed acyclic graph (DAG).Set of Gates in this circuit.GateAddConstantIdentityMultiplyNegationReciprocalSet of Operators in this circuit.Placeholder is essentially a non-trainable Gate for storing labels.Set of Placeholders in this circuit.GateGates as
a List as a result of the sorting.TopologicalSorter
from a CircuitGate is essentially non-trainable.Set of Variables in this circuit.Gates and its adjacent gates recursively, in order to
order them in a topologically sorted manner.