data_migration/services/graph.py
def revert_graph(self, node, complete: bool = False) -> None:
        """
        Reverts graph based on nodes recursive.

        :param node: current node to revert
        :param complete: indicator to revert whole graph
        """
        # walk down the tree
        latest_node = node
        while latest_node.next and latest_node.next.node.is_applied:
            latest_node = latest_node.next

        # revert until given point
        while latest_node:
            latest_node.revert()
            if not complete and latest_node == node:
                break
            latest_node = latest_node.previous

        Reverts graph based on nodes recursive.

        :param node: current node to revert
        :param complete: indicator to revert whole graph
        
Reverts graph based on nodes recursive.
Reverts graph based on nodes recursive .
def revert_graph(self, node, complete: bool = False) -> None:
        latest_node = node
        while latest_node.next and latest_node.next.node.is_applied:
            latest_node = latest_node.next
        while latest_node:
            latest_node.revert()
            if not complete and latest_node == node:
                break
            latest_node = latest_node.previous
def revert_graph ( self , node , complete : bool = False ) -> None : latest_node = node while latest_node . next and latest_node . next . node . is_applied : latest_node = latest_node . next while latest_node : latest_node . revert ( ) if not complete and latest_node == node : break latest_node = latest_node . previous
Reverts graph based on nodes recursive.
Reverts graph based on nodes recursive .
"""
        Reverts graph based on nodes recursive.

        :param node: current node to revert
        :param complete: indicator to revert whole graph
        """ # walk down the tree # revert until given point
self
node
current node to revert
current node to revert
complete
bool
indicator to revert whole graph
indicator to revert whole graph