Replaced Tarjan's algorithm with a simpler depth-first traversal cycle detection algorithm. By doing so, one gets rid off a possible linear time check whether a node is contained in the stack.
Streamlined job graph algorithms to get rid off linear contains operations.
Standardized creation of input and output channels in InputGate and OutputGate. Removed linear contains check in InputGate for channels.
Merge branch 'netstack_rework_graph_algorithms' into netstack_rework