Function spanning DFT tree of graph graph starting from value

graph

Format:

spanning DFT tree of graph graph starting from value

Input:

list graph -

any value -

Output:

list - None

Properties that reference this function:

spanning DFT tree of graph graph starting from v = output of the build_dft_tree function where input graph is graph, tree is [ ], and neighbor stack is [ node (v, None), [ ] ] (construct depth first search tree begin)

Comments

Please log in to add comments