src/msys/nodes/module.py
def form_tree(self) -> bool:
        """
        Checks if connections between Nodes are definitly solveable in linear time.
        (Only one time to update all)

        Returns:
            bool: true if connections form linear tree like shape
        """
        for i in range(len(self.nodes)):
            run = []

            def move_from(node) -> bool:
                run.append(node)
                outputs = node.get_outputs()
                for out in outputs:
                    for input in out.get_inputs():
                        parent = input.get_parent()
                        # prevent from going outside
                        if parent not in self.nodes:
                            continue

                        # preventing double findings
                        if parent in run:
                            # if circle
                            if parent is self.nodes[i]:
                                return False
                            continue

                        if not move_from(parent):
                            return False
                return True

            if not move_from(self.nodes[i]):
                return False
        return True

        Checks if connections between Nodes are definitly solveable in linear time.
        (Only one time to update all)

        Returns:
            bool: true if connections form linear tree like shape
        
Checks if connections between Nodes are definitly solveable in linear time.
(Only one time to update all)
Checks if connections between Nodes are definitly solveable in linear time . ( Only one time to update all )
def form_tree(self) -> bool:
        for i in range(len(self.nodes)):
            run = []
            def move_from(node) -> bool:
                run.append(node)
                outputs = node.get_outputs()
                for out in outputs:
                    for input in out.get_inputs():
                        parent = input.get_parent()
                        if parent not in self.nodes:
                            continue
                        if parent in run:
                            if parent is self.nodes[i]:
                                return False
                            continue
                        if not move_from(parent):
                            return False
                return True
            if not move_from(self.nodes[i]):
                return False
        return True
def form_tree ( self ) -> bool : for i in range ( len ( self . nodes ) ) : run = [ ] def move_from ( node ) -> bool : run . append ( node ) outputs = node . get_outputs ( ) for out in outputs : for input in out . get_inputs ( ) : parent = input . get_parent ( ) if parent not in self . nodes : continue if parent in run : if parent is self . nodes [ i ] : return False continue if not move_from ( parent ) : return False return True if not move_from ( self . nodes [ i ] ) : return False return True
Checks if connections between Nodes are definitly solveable in linear time.
Checks if connections between Nodes are definitly solveable in linear time .
"""
        Checks if connections between Nodes are definitly solveable in linear time.
        (Only one time to update all)

        Returns:
            bool: true if connections form linear tree like shape
        """ # prevent from going outside # preventing double findings # if circle
true if connections form linear tree like shape
true if connections form linear tree like shape
bool
self