Depth First Search Path Traversal

Target

For the tree structure in the figure below, traverse and output the path from all leaf nodes to the root node.

Given one example, starts from node e

:param start:
        eg: 'e'
:param child_father_dict:
        eg: {'e': {'b'}, 'b': {'a'}}
:return: all_path:
        eg: ['e', 'b', 'a']

[[['h', 'd', 'a']], [['f', 'c', 'a'], ['f', 'b', 'a']], [['e', 'b', 'a']], [['g', 'c', 'a'], ['g', 'd', 'a']]]

深度搜索算法（python实现）获取所有叶子节点到根节点的路径