2.15_graph_图

--- 图结构相关术语 ---
    1. 顶点 (Vertex) / 节点 (Node)：具有名称标识 key，也可以携带数据项 payload
    2. 边 (Edge) / 弧 (Arc)：连接两个顶点
        可以是无向或有向的："无向图 / 有向图"
    3. 权重 (weight)：表达从一个顶点到另一个顶点的"代价"，可以给边赋权
    4. 路径 (Path)：由边依次连接起来的顶点序列
        无权路径长度为变的数量，带权路径长度为所有边权重的和
    5. 圈 (Cycle)：收尾顶点相同的路径
        有向图中不存在任何圈："有向无圈图 (Directed Acyclic Graph: DAG)"

class Graph(object):

    def __init__(self, gdict=None):
        if gdict is None:
            gdict = {}
        self.gdict = gdict

    def edges(self):
        return self.get_edges()

    def get_vertices(self):
        """get the keys of gdict"""

        return list(self.gdict.keys())

    def get_edges(self):
        """get distinct list of edges"""

        edge_list = []

        for v in self.gdict:
            for nxt_v in self.gdict[v]:
                if {v, nxt_v} not in edge_list:
                    edge_list.append({v, nxt_v})

        return edge_list

    def add_vertex(self, vertex):

        if vertex not in self.gdict:
            self.gdict[vertex] = []

    def add_edge(self, edge):

        edge = set(edge)
        (v1, v2) = tuple(edge)
        if v1 in self.gdict:
            self.gdict[v1].append(v2)
        else:
            self.gdict[v1] = [v2]


g_element = {'a':['b','c'],'b':['a','d'],'c':['a','d'],'d':['e'],'e':['d']}
g = Graph(g_element)
g.add_edge({'a','e'})
g.add_edge({'a','c'})
print(g.edges())