Function children of the node at backwards index index of tree tree in graph graph

get node childrengraph

Format:

children of the node at backwards index index of tree tree in graph graph

Input:

Output:

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:

  • children of the node at backwards index i of tree tree in graph graph = children
  • result of adding children to tree tree as children of the node at backwards index i = new_tree

  then output of the spanning_tree function where the input graph is graph, backwards index is i, and the spanning tree is tree = output of the spanning_tree function where the input graph is graph, backwards index is (i + 1), and the spanning tree is new_tree

  (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:

  • children of the node at backwards index i of tree tree in graph graph = children
  • result of adding or updating children children of the node at backwards index i in tree tree = new_tree

  then output of the shortest_path function where the input graph is graph, backwards index is i, and tree is tree = output of the shortest_path function where the input graph is graph, backwards index is (i + 1), and tree is new_tree

  (link)

Comments

Please log in to add comments