Function output of the find_neighbors function where the input graph is graph, node is value, and children are children

get children help graph

Format:

output of the find_neighbors function where the input graph is graph, node is value, and children are children

Input:

list graph -
any value -
list children -

Output:

list - None

Properties that reference this function:

output of the find_neighbors function where the input graph is [ ], node is value, and children are result = result (get node children finished)
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:

    • ((length of stack tree) - 1) - index = back_i
    • the element at index back_i of stack tree = node (value, cs)

    then children of the node at backwards index index of tree tree in graph graph = output of the find_neighbors function where the input graph is graph, node is value, and children are [ ]

    (link)

  • if the following are true:

    • not (left = value)
    • not (right = value)

    then output of the find_neighbors function where the input graph is [ pair (left, right), rest ], node is value, and children are result = output of the find_neighbors function where the input graph is rest, node is value, and children are result

    (link)

  • if left = value, then output of the find_neighbors function where the input graph is [ pair (left, right), rest ], node is value, and children are result = output of the find_neighbors function where the input graph is rest, node is value, and children are [ right, result ]

    (link)

  • if right = value, then output of the find_neighbors function where the input graph is [ pair (left, right), rest ], node is value, and children are result = output of the find_neighbors function where the input graph is rest, node is value, and children are [ left, result ]

    (link)

  • if the following are true:

    • ((length of stack tree) - 1) - index = back_i
    • the element at index back_i of stack tree = node (value, distance, previous)

    then children of the node at backwards index index of tree tree in graph graph = output of the find_neighbors function where the input graph is graph, node is value, and children are [ ]

    (link)

  • if the following are true:

    • not (left = value)
    • not (right = value)

    then output of the find_neighbors function where the input graph is [ edge (left, right, weight), rest ], node is value, and children are result = output of the find_neighbors function where the input graph is rest, node is value, and children are result

    (link)

  • if left = value, then output of the find_neighbors function where the input graph is [ edge (left, right, weight), rest ], node is value, and children are result = output of the find_neighbors function where the input graph is rest, node is value, and children are [ pair (right, weight), result ]

    (link)

  • if right = value, then output of the find_neighbors function where the input graph is [ edge (left, right, weight), rest ], node is value, and children are result = output of the find_neighbors function where the input graph is rest, node is value, and children are [ pair (left, weight), result ]

    (link)


Comments

Please log in to add comments