从表的父子对创建jstree层次结构

Question

I have a parent child pair from table, example:

links=(("Tom","Dick"),
       ("Dick","Harry"),
       ("Tom","Larry"),
       ("Bob","Leroy"),
       ("Bob","Earl"),
       ("Earl","Joy"), 
       ("Joy","Joy child"), 
       ("Joy","Joy child2"),
       ("Joy child2", "Maria"))

and I am trying to create jstree from this pairs. I went through various links but cant get this tuple to work. Can anyone please provide a recursive function in python which takes the tuple as mentioned above or any combination of parent-child-grand-child pairs as input and creates a hierarchy by creating a json similar to this format

{
     "name": "Tom",
     "children": [
         {
             "name": "Dick"
         }
     ] 
}

Thank you in Advance:) I really appreciate your help!

Answer 1

import json

links = (("Tom","Dick"),("Dick","Harry"),("Tom","Larry"),("Tom","Hurbert"),("Tom","Neil"),("Bob","Leroy"),("Bob","Earl"),("Tom","Reginald"))

name_to_node = {}
root = {'name': 'Root', 'children': []}
for parent, child in links:
    parent_node = name_to_node.get(parent)
    if not parent_node:
        name_to_node[parent] = parent_node = {'name': parent}
        root['children'].append(parent_node)
    name_to_node[child] = child_node = {'name': child}
    parent_node.setdefault('children', []).append(child_node)

print json.dumps(root, indent=4)