'Build a CFGraph class from a dict of adjacency lists.'

def from_adj_list(self, d, entry_point=0):

    g = CFGraph()
    for node in d:
        g.add_node(node)
    for (node, dests) in d.items():
        for dest in dests:
            g.add_edge(node, dest)
    return g
