图遍历算法的名称 [英] Names of Graph Traversal Algorithms
本文介绍了图遍历算法的名称的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！
问题描述
我正在寻找的是图遍历算法的全面列表，并简要描述了它们的用途，作为研究它们的跳跃点。到目前为止，我知道：
- Dijkstra's - 单一来源最短路径
- Kruskal's - 找到最小生成树
还有哪些其他着名的？请为每个答案提供每种算法的简要说明。
解决方案
知道的是：
- 深度优先搜索 http：/ /en.wikipedia.org/wiki/Depth-first_search
- 广度优先搜寻 http://en.wikipedia.org/wiki/Breadth-first_search
- Prim的算法 http://en.wikipedia.org/wiki/Prim's_algorithm
- 克鲁斯卡尔算法< a href =http://en.wikipedia.org/wiki/Kruskal%27s_algorithm =noreferrer> http://en.wikipedia.org/wiki/Kruskal's_algorithm
- Bellman-Ford算法 http://en.wikipedia.org /维基/贝尔曼％E2％80％93Ford_al gorithm
- Floyd-Warshall算法 http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
- 反向删除算法 http://en.wikipedia.org/wiki/Reverse-Delete_algorithm
- Dijkstra's_algorithm < a href =http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm =noreferrer> http://en.wikipedia.org/wiki/Dijkstra's_algorithm
网络流量
- Ford-Fulkerson算法 http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm
- 最大流量 http://en.wikipedia.org/wiki/ Maximum_flow_problem
What I'm looking for is a comprehensive list of graph traversal algorithms, with brief descriptions of their purpose, as a jump off point for researching them. So far I'm aware of:
- Dijkstra's - single-source shortest path
- Kruskal's - finds a minimum spanning tree
What are some other well-known ones? Please provide a brief description of each algorithm to each of your answers.
解决方案the well knowns are :
- Depth-first search http://en.wikipedia.org/wiki/Depth-first_search
- Breadth-first search http://en.wikipedia.org/wiki/Breadth-first_search
- Prim's algorithm http://en.wikipedia.org/wiki/Prim's_algorithm
- Kruskal's algorithm http://en.wikipedia.org/wiki/Kruskal's_algorithm
- Bellman–Ford algorithm http://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm
- Floyd–Warshall algorithm http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
- Reverse-delete algorithm http://en.wikipedia.org/wiki/Reverse-Delete_algorithm
- Dijkstra's_algorithm http://en.wikipedia.org/wiki/Dijkstra's_algorithm
network flow
- Ford–Fulkerson algorithm http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm
- Maximum Flow http://en.wikipedia.org/wiki/Maximum_flow_problem
这篇关于图遍历算法的名称的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
查看全文
