Class nodedict

pattern/graph/__init__.py:292–301

# Return value of Graph.shortest_paths().
# Dictionary values can be accessed by Node as well as by node id.
class nodedict(dict):
    def __init__(self, graph, *args, **kwargs):
        dict.__init__(self, *args, **kwargs)
        self.graph = graph
    def __contains__(self, node):
        return dict.__contains__(self, self.graph.get(node, node))
    def __getitem__(self, node):
        return dict.__getitem__(self, isinstance(node, Node) and node or self.graph[node])
    def get(self, node, default=None):
        return dict.get(self, self.graph.get(node, node), default)

def unique(iterable):
    """ Returns a list copy in which each item occurs only once (in-order).