Skip to content

A little signal. Less noise.

DISCOVER

Catalog Categories

CATEGORIES

Categories will appear when the source is connected.

More possibility. Less searching.

A considered collection of AI tools, trials, and opportunities.

RADAR / PostgreSQLConnection pending

ExploreCatalog

A little signal. Less noise.

Loading the catalog…

RADARGood tools open new possibilities.Explore thoughtfully. Create freely.

Skip to content

A little signal. Less noise.

DISCOVER

Catalog Categories

CATEGORIES

Categories will appear when the source is connected.

More possibility. Less searching.

A considered collection of AI tools, trials, and opportunities.

RADAR / PostgreSQLStorage available

ExploreOffer details

A little signal. Less noise.

Back to catalog

同

同样是遍历图,为什么BFS能保证找到最短路径,DFS却不行

掘金

About this offer

写在前面图的遍历只有两种基本套路:广度优先(BFS)和深度优先(DFS)。两者要完成的任务是一样的——从起点出发,不重不漏地访问所有能到达的节点,代码结构也几乎是镜像对称的,一个用队列,一个用栈(或

Offer details

Provider: 掘金
Source: juejin-rss
Score: 57.37
Confidence: 54%

Source evidence

What RADAR observed and classified to build this opportunity. It is what the source published, not a verification that the offer is still active.

JuejinObserved: Sep 28, 2026Source reliability: 60%
同样是遍历图,为什么BFS能保证找到最短路径,DFS却不行. 写在前面图的遍历只有两种基本套路:广度优先(BFS)和深度优先(DFS)。两者要完成的任务是一样的——从起点出发,不重不漏地访问所有能到达的节点,代码结构也几乎是镜像对称的,一个用队列,一个用栈(或
Open source

同样是遍历图,为什么BFS能保证找到最短路径,DFS却不行

Opens an external website. Availability and terms may change.

Real offers. Useful details.

The catalog shows persisted RADAR opportunities. Storage availability does not mean sources are verified or offers are active.

RADARGood tools open new possibilities.Explore thoughtfully. Create freely.