-[743. Network Delay Time](en/1-1000/743-network-delay-time.md) was solved in_Python_ and 2 ways.

-[787. Cheapest Flights Within K Stops](en/1-1000/787-cheapest-flights-within-k-stops.md) was solved in_Python_.

-[1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance](en/1001-2000/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.md) was solved in_Python_.

-[752. Open the Lock](en/1-1000/752-open-the-lock.md) was solved in_Python_ and 2 ways.

-[433. Minimum Genetic Mutation](en/1-1000/433-minimum-genetic-mutation.md) was solved in_Python_.

* As shown in the figure above,**breadth-first search** can be thought of as visiting vertices in rounds and rounds. Actually, whenever you see a question is about

getting`shortest` or`least` of something of a graph,`breadth-first search` would probably help.

* As shown in the figure above,**Breadth-First Search** can be thought of as visiting vertices in rounds and rounds. Actually, whenever you see a question is about

getting`minimum number` of something of a graph,`Breadth-First Search` would probably help.

*`breadth-first search` emphasizes first-in-first-out, so a**queue** is needed.

*`Breadth-First Search` emphasizes first-in-first-out, so a**queue** is needed.

1.`Breadth-First Search` a graph means traversing**from near to far**, from`circle 1` to`circle N`. Each`circle` is a round of iteration, but we can simplify it by using just 1 round.

As shown in the figure above,**breadth-first search** can be thought of as visiting vertices in rounds and rounds.

As shown in the figure above,**Breadth-First Search** can be thought of as visiting vertices in rounds and rounds.

It emphasizes first-in-first-out, so a**queue** is needed.

`Breadth-First Search` emphasizes first-in-first-out, so a**queue** is needed.

* Time:`O(n * m)`.

|Dijkstra's algorithm|Vertices||

|Bellman-Ford algorithm|Edges(Vertices+Edges for SPFA)||

Add a table to show the differences between A-Start and breadth-first search

* Find all the prime numbers within 1000000.

- 417https://leetcode.com/problems/pacific-atlantic-water-flow/

- 399https://leetcode.com/problems/evaluate-division/ union-find

- 1976https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/ both use Dijkstra or Bellman-Ford can solve it.

- 1263https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location/ A-star

- 222https://leetcode.cn/problems/count-complete-tree-nodes/

- 1514-path-with-maximum-probability.md

- 1334https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance

2005-02-09 day 2