Function children of the node value in graph graph

get node childrengraph

Format:

children of the node value in graph graph

Input:

list graph -
any value -

Output:

list - None

Properties that reference this function:

children of the node value in graph graph = output of the find_neighbors function where the input graph is graph, node is value, and children are [ ] (Depth First Search Node Children)

Conditional properties that reference this function:

  • if the following are true:

    • children of the node top in graph graph = children
    • elements of children that are not in tree tree = new_elements
    • nodes with values new_elements and parent top = final_elems
    • result of dumping final_elems to rest = new_stack

    then output of the build_dft_tree function where input graph is graph, tree is tree, and neighbor stack is [ node (top, parent), rest ] = output of the build_dft_tree function where input graph is graph, tree is [ node (top, parent), tree ], and neighbor stack is new_stack

    (link)


Comments

Please log in to add comments