dotmap | Dot access dictionary with dynamic hierarchy creation | Dictionary library

def add_branch(tree, vector, value):
    key = vector[0]
    if len(vector) == 1:
        tree[key] = value  
    else: 
        tree[key] = add_branch(tree[key] if key in tree else {}, vector[1:], value)
    return tree

dotmap_string = "

pywin32 >=220 ; sys_platform == 'win32'
lxml >=3.35 ; sys_platform == 'win32'
Scrapy>=1.1.0
PyMySQL>=0.7.9
hjson>=1.5.8
elasticsearch>=2.4
beautifulsoup4>=4.3.2
readability-lxml>=0.6.2
newspaper3k>=0.1.7 ; python

import copy
import heapq
#from dotmap import Map
from itertools import count

class Map(dict):
    def __getattr__(self, k):
        return self[k]
    def __setattr__(self, k, v):
        self[k] = v

graph = {
    'A': ['B', 'E'],
    'B