使用搜索算法(python)搜索到给定点的路径的最近坐标

# 定义图的数据结构
graph = {
    'A': ['B', 'C'],
    'B': ['A', 'D', 'E'],
    'C': ['A', 'F'],
    'D': ['B'],
    'E': ['B', 'F'],
    'F': ['C', 'E']
}

# 深度优先搜索
def dfs(graph, start, end, path=[]):
    path = path + [start]
    if start == end:
        return path
    if start not in graph:
        return None
    for node in graph[start]:
        if node not in path:
            new_path = dfs(graph, node, end, path)
            if new_path:
                return new_path
    return None

# 广度优先搜索
def bfs(graph, start, end):
    queue = [(start, [start])]
    while queue:
        node, path = queue.pop(0)
        if node == end:
            return path
        if node not in graph:
            continue
        for neighbor in graph[node]:
            if neighbor not in path:
                queue.append((neighbor, path + [neighbor]))
    return None

# 测试
start = 'A'
end = 'F'
dfs_path = dfs(graph, start, end)
bfs_path = bfs(graph, start, end)
print("DFS最近坐标路径:", dfs_path)
print("BFS最近坐标路径:", bfs_path)