【图】用python实现有向图

通过临界表的方式实现了图结构

class Vertex(object):
    """
    节点对象
    """
    def __init__(self, key):
        self.key = key
        self.connectedTo = {}    # 存放指向的其它节点，以Vertex：连接边weight的

    def addNeighbor(self, nbr, weight):
        self.connectedTo.update({nbr: weight})

    def __str__(self):
        return str(self.key) + '-->' + str([nbr.key for nbr in self.connectedTo])

    def getConnections(self):
        return self.connectedTo.keys()

    def getId(self):
        return self.key

    def getWeight(self, nbr):
        weight = self.connectedTo.get(nbr)
        if weight is not None:
            return weight
        else:
            raise KeyError("No such nbr exist!")


class Graph(object):
    """
    图对象
    """
    def __init__(self):
        self.vertexList = {}         # 字典保存节点信息，以{key: Vertex}的方式
        self.vertexNum = 0           # 统计图节点数

    def addVertex(self, key):
        self.vertexList.update({key: Vertex(key)})
        self.vertexNum += 1

    def getVertex(self, key):
        vertex = self.vertexList.get(key)
        return vertex

    def __contains__(self, key):
        return key in self.vertexList.values()

    def addEdge(self, f, t, weight=0):
        f, t = self.getVertex(f), self.getVertex(t)
        if not f:
            self.addVertex(f)
        if not t:
            self.addVertex(t)
        f.addNeighbor(t, weight)

    def getVertices(self):
        return self.vertexList.keys()

    def __iter__(self):
        return iter(self.vertexList.values())