'Graph.shortest_paths() and Graph.eigenvector_centrality() return a nodedict,
where dictionary values can be accessed by Node as well as by node id.'

def __init__(self, graph, *args, **kwargs):

    dict.__init__(self, *args, **kwargs)
    self.graph = graph
