《量化交易入门（十一）Python开发－数据结构》配套源码

#数据结构 #图(Graph) def dfs(graph, start, visited=None): if visited is None: visited = set() visited.add(start) print(start, end=' ') for neighbor in graph[start]: if neighbor not in visited: dfs(graph, neighbor, visited) # 创建无向图 graph = { 'A': ['B', 'C'], 'B': ['A', 'D', 'E'], 'C': ['A', 'F'], 'D': ['B'], 'E': ['B', 'F'], 'F': ['C', 'E'] } # 深度优先搜索遍历 print("DFS traversal:") dfs(graph, 'A') # 输出: A B D E F C print("\n") def bfs(graph, start): visited = set() queue = [start] visited.add(start) while queue: vertex = queue.pop(0) print(vertex, end=' ') for neighbor in graph[vertex]: if neighbor not in visited: queue.append(neighbor) visited.add(neighbor) # 广度优先搜索遍历 print("BFS traversal:") bfs(graph, 'A') # 输出: A B C D E F