def dfs(self, node): # Update node ka index node.index = len(node.children)
chalis.add_edge(node1, node2) chalis.add_edge(node1, node3)
def add_edge(self, parent, child): parent.children.append(child) child.parent = parent
chalis.add_edge(node1, node2) chalis.add_edge(node1, node3) index of ek chalis ki last local updated
def add_edge(self, parent, child): parent.children.append(child) child.parent = parent def dfs(self, node): # Update node ka index node
Hit enter to search or ESC to close
