finesse.graph.operator_graph.OperatorGraph.find_forkless_paths¶

OperatorGraph.find_forkless_paths(self)¶

Finds all paths between nodes which do not have any forks in. Forks are defined here as a node with an input or output degree == 1 - except for the first and last node. Only paths with more than one edge are returned.

Returns