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 [ ]