Neo4j Graph Database Fundamentals · 课时

寻路算法（BFS、DFS）

探索广度优先搜索和深度优先搜索等算法，以查找图中的路径和连接

寻路算法（BFS、DFS） 是 CoddyKit 上的免费 Neo4j Graph Database Fundamentals 课时。这是第 1 节课，共 4 节。你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。这是 Neo4j Graph Database Fundamentals 学习路径的一部分，你的进度在网页和 CoddyKit 应用中同步。 Neo4j Graph Database Fundamentals 课程共包含 4 节课。

本课时的部分内容尚未翻译，以英文显示。

Finding Your Way in Graphs

Graphs are all about connections! Imagine a map where cities are points and roads are lines. Finding the best route from one city to another is a classic "pathfinding" problem.

In this lesson, we'll explore two fundamental algorithms for finding paths in graphs: Breadth-First Search (BFS) and Depth-First Search (DFS).

What's a Graph? Quick Review

Before we dive into algorithms, let's quickly review what a graph is:

Nodes: These are the entities or points in your graph (e.g., people, cities, products).
Relationships: These are the connections between nodes (e.g., "FRIENDS_WITH", "LOCATED_IN").
Path: A sequence of connected nodes and relationships from one node to another.

BFS: Exploring Layer by Layer

Breadth-First Search (BFS) is like exploring a maze by checking all immediate exits from your current room, then all exits from those rooms, and so on.

It systematically explores a graph level by level, ensuring it finds the shortest path in terms of the number of relationships between two nodes (in an unweighted graph).

How BFS Works

BFS uses a "queue" (like a line at a store: first-in, first-out) to keep track of which nodes to visit next.

It starts at a given node.
It visits all its direct neighbors first.
Then, it visits all the unvisited neighbors of those neighbors.
It keeps track of visited nodes to avoid loops and redundant work.

BFS Code Example

Let's see a simple Python example of BFS on a small graph. We represent the graph using a dictionary where keys are nodes and values are lists of their neighbors.

def bfs_path(graph, start_node):
    visited = []
    queue = [start_node]
    visited.append(start_node)
    path = []

    while queue:
        current_node = queue.pop(0) # Get first node
        path.append(current_node)

        for neighbor in graph[current_node]:
            if neighbor not in visited:
                visited.append(neighbor)
                queue.append(neighbor)
    return path

if __name__ == "__main__":
    # A simple graph:
    # A -- B
    # |    |
    # C -- D
    graph_data = {
        'A': ['B', 'C'],
        'B': ['A', 'D'],
        'C': ['A', 'D'],
        'D': ['B', 'C']
    }
    print("BFS path from 'A':")
    print(bfs_path(graph_data, 'A'))

DFS: Diving Deep

Depth-First Search (DFS) takes a different approach. Instead of exploring layer by layer, it goes as deep as possible along each branch before backtracking.

Think of it as navigating a maze by always picking one path and following it to its end. If it's a dead end, you backtrack and try another path.

How DFS Works

DFS typically uses a "stack" (last-in, first-out) or recursion to manage its exploration.

It starts at a given node.
It picks one unvisited neighbor and moves to it.
It repeats this process, going deeper into the graph.
If it hits a dead end or a visited node, it backtracks to the last node with unvisited neighbors.

DFS Code Example

Here's a Python example for DFS. We'll use a recursive approach, which naturally uses the call stack to achieve depth-first traversal.

def dfs_path(graph, start_node, visited=None, path=None):
    if visited is None:
        visited = set()
    if path is None:
        path = []

    visited.add(start_node)
    path.append(start_node)

    for neighbor in graph[start_node]:
        if neighbor not in visited:
            dfs_path(graph, neighbor, visited, path)
    return path

if __name__ == "__main__":
    # A simple graph:
    # A -- B
    # |    |
    # C -- D
    graph_data = {
        'A': ['B', 'C'],
        'B': ['A', 'D'],
        'C': ['A', 'D'],
        'D': ['B', 'C']
    }
    print("DFS path from 'A':")
    # Note: DFS path can vary based on neighbor order
    print(dfs_path(graph_data, 'A'))

BFS vs. DFS: Key Differences

BFS and DFS are both powerful, but they suit different problems:

BFS: Guarantees the shortest path (in terms of relationships). Great for finding the closest friends, nearest locations.
DFS: Useful for checking connectivity, finding all paths, or topological sorting. Can be more memory efficient for very deep graphs.
Memory: BFS can use more memory for wide graphs (many neighbors). DFS can use more stack space for deep graphs.

Quick Check: Pathfinding Choice

You're building a social network feature that needs to find the shortest connection (fewest friends) between two users. Which algorithm would be most suitable for this task in an unweighted graph?

Recap & Next Steps

Great job! In this lesson, you've learned about the two fundamental graph traversal algorithms:

Breadth-First Search (BFS): Explores layer by layer, good for shortest paths.
Depth-First Search (DFS): Dives deep, useful for checking connectivity or finding all paths.

Understanding these algorithms is key to solving many graph problems and will help you appreciate how graph databases efficiently find connections.

常见问题解答

「寻路算法（BFS、DFS）」课时是免费的吗？

是的 — 「寻路算法（BFS、DFS）」的完整文本可在网页上免费阅读。要进行交互式练习（内置代码编辑器和全天候 AI 导师）并解锁 Neo4j Graph Database Fundamentals 课程的其余内容，请升级到 CoddyKit PRO。 Neo4j Graph Database Fundamentals 课程共包含 4 节课。

「寻路算法（BFS、DFS）」这节课中我会学到什么？

探索广度优先搜索和深度优先搜索等算法，以查找图中的路径和连接你通过在浏览器中直接运行的动手代码来练习 Neo4j Graph Database Fundamentals，全天候 AI 导师会在你学习这节课的过程中回答你的问题。

学习 Neo4j Graph Database Fundamentals 需要有经验吗？

无需任何先前经验。CoddyKit 上的 Neo4j Graph Database Fundamentals 课程适合初学者到高级学习者，你可以从这里开始或从头开始，按照自己的节奏学习。这是第 1 节课，共 4 节。

「寻路算法（BFS、DFS）」课时需要多长时间？

大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动，所以你能稳步进步，并在网页和应用中从离开的地方继续。

我能在这节 Neo4j Graph Database Fundamentals 课中编写并运行代码吗？

能。每节 Neo4j Graph Database Fundamentals 课都包含内置代码编辑器，你可以在浏览器中直接编写并运行真实代码，并获得即时 AI 反馈 — 无需本地设置。

此课程中的所有课时

← 返回 Neo4j Graph Database Fundamentals