返回卡包市场

Unit 8 - Algorithms

暂无描述。系统推荐的高质量记忆内容,适合每天坚持背诵学习。

卡片总数: 3内容版本: v4公开卡包更新时间: 8/1/2026

卡片预览 (3 张)

#1
正面 (问题)

Give 2 methods of traversing a graph.

背面 (解答)

• Depth first - Breadth first

#2
正面 (问题)

Describe the depth-first method of traversing a graph.

背面 (解答)

The depth-first traversal consists of moving down the nodes from the starting node, and backtracking to get to the next node.

#3
正面 (问题)

Describe breadth-first traversal.

背面 (解答)

Breadth-first traversal method consists of exploring a vertex and its unvisited vertices, and then exploring each of these vertices are the vertices tied to each of them.