Python数据结构5

一、图
1.理解什么是图形
2.了解图形的类型及其组成
3.了解如何表示图形并遍历它
图是一组顶点和边，它们在顶点之间形成连接。在更形式化的方法中，图G是顶点集合V和边集合E的有序对，在形式化的数学符号中表示为G = (V, E)。
例子：

节点或顶点：一个点，通常用图上的点表示。顶点或节点是A、B、C、D和E。
边：这是两个顶点之间的连接。连接A和B的线就是边的一个例子。
循环：当一个节点的边与自身发生关联时，该边形成一个循环。
顶点的度：这是一个给定顶点上关联的顶点的数量。顶点B的度数是4。
邻接：指一个节点与其相邻节点之间的连接。节点C与节点A相邻，因为它们之间有一条边。
路径：顶点的序列
无向图：

有向图：

权重图：

图的表示方法;
邻接表

graph = dict()
graph['A'] = ['B', 'C']
graph['B'] = ['E','A']
graph['C'] = ['A', 'B', 'E','F']
graph['E'] = ['B', 'C']
graph['F'] = ['C']

邻接矩阵

graph = dict()
graph['A'] = ['B', 'C']
graph['B'] = ['E','A']
graph['C'] = ['A', 'B', 'E','F']
graph['E'] = ['B', 'C']
graph['F'] = ['C']
matrix_elements = sorted(graph.keys())
cols = rows = len(matrix_elements)
adjacency_matrix = [[0 for x in range(rows)] for y in range(cols)]
edges_list = []
for key in matrix_elements:
    for neighbor in graph[key]:
        edges_list.append((key,neighbor))

图的遍历：
广度优先

def bfsTravel(graph, source):
    # 传入的参数为邻接表存储的图和一个开始遍历的源节点
    frontiers = [source]     # 表示前驱节点
    travel = [source]       # 表示遍历过的节点
    # 当前驱节点为空时停止遍历
    while frontiers:
        nexts = []          # 当前层的节点（相比frontier是下一层）
        for frontier in frontiers:
            for current in graph[frontier]: # 遍历当前层的节点
                if current not in travel:   # 判断是否访问过
                    travel.append(current)  # 没有访问过则入队
                    nexts.append(current)   # 当前结点作为前驱节点
        frontiers = nexts   # 更改前驱节点列表
    return travel

if __name__ == "__main__":
    graph = {}
    graph['a'] = ['b']
    graph['b'] = ['c','d']
    graph['c'] = ['e']
    graph['d'] = []
    graph['e'] = ['a']

    # test of BFS
    print(bfsTravel(graph, 'b'))

深度优先

def dfsTravel(graph, source):
    # 传入的参数为邻接表存储的图和一个开始遍历的源节点
    travel = []     # 存放访问过的节点的列表
    stack = [source]      # 构造一个堆栈
    while stack:            # 堆栈空时结束
        current = stack.pop()       # 堆顶出队
        if current not in travel:   # 判断当前结点是否被访问过
            travel.append(current)  # 如果没有访问过，则将其加入访问列表
        for next_adj in graph[current]: # 遍历当前结点的下一级
            if next_adj not in travel:  # 没有访问过的全部入栈
                stack.append(next_adj)
    return travel


if __name__ == "__main__":
    graph = {}
    graph['a'] = ['b']
    graph['b'] = ['c','d']
    graph['c'] = ['e']
    graph['d'] = []
    graph['e'] = ['a']

    print(dfsTravel(graph, 'b'))