Which of these graph traversal algorithms are most often used in practice?

Question

Algorithms

Good afternoon.
I was puzzled by the topic of graphs. I sort through and deal with different bypass algorithms. I did a little research and collected, as it seems to me, not yet a complete list of bypass algorithms. It is clear that not all of them are used in wide practice. It is clear that in specific cases, specific algorithms are also used.
Tell me, who is in the subject, which of these algorithms are most common?
- Depth-first search [DFS] ( https://en.wikipedia.org/wiki/Depth-search)
- Depth-first search with timestamps ( https://goo.gl/d06ZIv)
- Depth-limited search [DLS] ( https ://goo.gl/skcOuD)
- Depth-first search with iterative deepening [IDDFS, DFID] ( https://goo.gl/KTQF8q)
- Breadth first search [BFS] ( https://ru.wikipedia.org/wiki/Search_in_width)
- Cost search [UCS] ( https://goo.gl/pwKw3Z)
- Dijkstra's algorithm ( https://ru .wikipedia.org/wiki/Dijkstra's Algorithm)
- Lee's Algorithm/Wave Trace Algorithm ( https://ru.wikipedia.org/wiki/Lee_Algorithm)
- Bidirectional Search ( https://ru.wikipedia.org/wiki/Bidirectional_Search)
- Bellman-Ford algorithm ( https://ru.wikipedia.org/wiki/Bellman_algorithm_—_...
- Levit's algorithm ( https://ru.wikipedia.org/wiki/Levit's_algorithm)
- Floyd-Warshall algorithm ( https:/ /en.wikipedia.org/wiki/Algorithm_Floyd_—_Wo...
- Algorithm Johnson (https://ru.wikipedia.org/wiki/Johnson_Algorithm)
- Search by the first best match ( https://ru.wikipedia.org/wiki/Search_by_first_best...
- Search A*( https://ru.wikipedia. org/wiki/Search_Algorithm_A*)
- Algorithm A* with iterative deepening [IDA*] ( https://ru.wikipedia.org/wiki/Informed_method...

Answer 1

Bypass is done either in depth or in width, equally often. When traversing in depth, you can use or not use the stack to save and restore the path.
The rest of the references given are search algorithms that use one of these two bypass methods.