Python - Generate a dictionary(tree) from a list o

Question

I've a following list:-

a = [(1, 1), (2, 1), (3, 1), (4, 3), (5, 3), (6, 3), (7, 7), (8, 7), (9, 7)]

which is a list of tuples. Elements inside a tuple are of the format (Id, ParentId) Its root node whenever Id == ParentId. The list can be in any order of tuples.

I want to generate the following dictionary using the above list of tuples,

output = [{
    'id': 1,
    'children': [{
        {
            'id': 3,
            'children': [{
                {
                    'id': 5
                },
                {
                    'id': 4
                },
                {
                    'id': 6
                }
            }]
        },
        {
            'id': 2
        }
    }]
}, {
    'id': 7,
    'children': [{
        {
            'id': 9
        },
        {
            'id': 8
        }
    }]
}]

ie (in terms of graphs- a forrest)

    1            7
   / \          / \
  2   3        8  9
     /|\
    4 5 6

My final output should be the dictionary given above.

I tried the following:-

The solution which I've tried is the following:-

# set the value of nested dictionary.
def set_nested(d, path, value):
    reduce(lambda d, k: d.setdefault(k, {}), path[:-1], d)[path[-1]] = value
    return d

# returns the path of any node in list format
def return_parent(list, child):
    for tuple in list:
        id, parent_id = tuple
        if parent_id == id == child:
            return [parent_id]
        elif id == child:
            return [child] + return_parent(list, parent_id)

paths = []
temp = {}
for i in a:
    id, parent_id = i
    temp[id] = {'id': id}
    path = return_parent(a, id)[::-1]
    paths.append(path) # List of path is created

d = {}
for path in paths:
    for n, id in enumerate(path):
        set_nested(d, path[:n + 1], temp[id]) # setting the value of nested dictionary.

print d

The output that I got is

{
    '1': {
        '3': {
            '6': {
                'id': '6'
            },
            '5': {
                'id': '5'
            },
            'id': '3',
            '4': {
                '10': {
                    'id': '10'
                },
                'id': '4'
            }
        },
        '2': {
            'id': '2'
        },
        'id': '1'
    },
    '7': {
        '9': {
            'id': '9'
        },
        '8': {
            'id': '8'
        },
        'id': '7'
    }
}

I'm close to it, but not able to get the exact output. Also, is there any better better solution?

Answer 1

Here is a simpler approach. (Edited as I realized from Thomas answer that the nodes can be given in any order): Pass 1 creates the nodes (that is, adds them to the nodes dictionary), while Pass 2 then creates the parent<->children structure.

The following assumptions are made: No cycles (it is not clear what the expected output would be in such a case, pointed out by Garret R), no missing edges, no missing tree roots.

a = [(1, 1), (2, 1), (3, 1), (4, 3), (5, 3), (6, 3), (7, 7), (8, 7), (9, 7)]

# pass 1: create nodes dictionary
nodes = {}
for i in a:
    id, parent_id = i
    nodes[id] = { 'id': id }

# pass 2: create trees and parent-child relations
forest = []
for i in a:
    id, parent_id = i
    node = nodes[id]

    # either make the node a new tree or link it to its parent
    if id == parent_id:
        # start a new tree in the forest
        forest.append(node)
    else:
        # add new_node as child to parent
        parent = nodes[parent_id]
        if not 'children' in parent:
            # ensure parent has a 'children' field
            parent['children'] = []
        children = parent['children']
        children.append(node)

print forest

EDIT: Why does your solution not work as you expected?

Here's a hint regarding the top-level: The output you want to obtain is a list of trees. The variable you are dealing with (d), however, needs to be a dictionary, because in function set_nested you apply the setdefaults method to it.

Answer 2

To make this easier, let's define a simple relational object:

class Node(dict):

    def __init__(self, uid):
        self._parent = None  # pointer to parent Node
        self['id'] = uid  # keep reference to id #            
        self['children'] = [] # collection of pointers to child Nodes

    @property
    def parent(self):
        return self._parent  # simply return the object at the _parent pointer

    @parent.setter
    def parent(self, node):
        self._parent = node
        # add this node to parent's list of children
        node['children'].append(self)  

Next define how to relate a collection of Nodes with each other. We will use a dict to hold pointers to each individual Node:

def build(idPairs):
    lookup = {}
    for uid, pUID in idPairs:
        # check if was node already added, else add now:
        this = lookup.get(uid)
        if this is None:
            this = Node(uid)  # create new Node
            lookup[uid] = this  # add this to the lookup, using id as key

        if uid != pUID:
            # set this.parent pointer to where the parent is
            parent = lookup[pUID]
            if not parent:
                # create parent, if missing
                parent = Node(pUID)  
                lookup[pUID] = parent
            this.parent = parent

    return lookup

Now, take your input data and relate it:

a = [(1, 1), (2, 1), (3, 1), (4, 3), (5, 3), (6, 3), (7, 7), (8, 7), (9, 7)]
lookup = build(a)  # can look at any node from here.

for uid in [1, 3, 4]:
    parent = lookup[uid].parent
    if parent:
        parent = parent['id']
    print "%s's parent is: %s" % (uid, parent)

Finally, getting the output: there's a good chance you want to have the data rooted as a a list of unique trees, rather than as a dictionary -- but you can choose what you like.

roots = [x for x in lookup.values() if x.parent is None]

# and for nice visualization:
import json
print json.dumps(roots, indent=4)

yielding:

[
    {
        "id": 1, 
        "children": [
            {
                "id": 2, 
                "children": []
            }, 
            {
                "id": 3, 
                "children": [
                    {
                        "id": 4, 
                        "children": []
                    }, 
                    {
                        "id": 5, 
                        "children": []
                    }, 
                    {
                        "id": 6, 
                        "children": []
                    }
                ]
            }
        ]
    }, 
    {
        "id": 7, 
        "children": [
            {
                "id": 8, 
                "children": []
            }, 
            {
                "id": 9, 
                "children": []
            }
        ]
    } ]

Answer 3

As required, this solution works regardless of the order of the nodes.

a = [(1, 1), (2, 1), (3, 1), (4, 3), (5, 3), (6, 3), (7, 7), (8, 7), (9, 7)]
b = [(8, 7), (5, 3), (2, 1), (1, 1), (3, 1), (7, 7), (4, 3), (6, 3), (9, 7)]

def build_forest( nodelist ):
    forest = [] 
    nodes = {}  

    id = 'id'
    children = 'children'

    for node_id, parent_id in nodelist:
        #create current node if necessary
        if not node_id in nodes:
            node = { id : node_id }
            nodes[node_id] = node
        else:
            node = nodes[node_id]

        if node_id == parent_id:
            #add node to forrest
            forest.append( node )
        else:
            #create parent node if necessary
            if not parent_id in nodes:
                parent = { id : parent_id }
                nodes[parent_id] = parent
            else:
                parent = nodes[parent_id]
            #create children if necessary
            if not children in parent:
                parent[children] = []
            #add node to children of parent
            parent[children].append( node )

    return forest    

print( build_forest( a ) )
print( build_forest( b ) )