|
关注：1
2013-05-23 12:21
求翻译：Dijkstra算法用于解决单源点的最短路径问题：给定带权有向图G和源点i，求从i到G中其余各项点的最短路经。是什么意思？ 待解决
 悬赏分：1
- 离问题结束还有
Dijkstra算法用于解决单源点的最短路径问题：给定带权有向图G和源点i，求从i到G中其余各项点的最短路经。
问题补充： |
|
2013-05-23 12:21:38
Dijkstra's algorithm used to solve the single source shortest path problem: given a weighted directed graph G and the source point i, find G from i to the rest of the points in the shortest path.
|
|
2013-05-23 12:23:18
single-source point Dijkstra algorithm for solving the shortest path problem is: Given a right to point to the map G and sources, and I pray that I G from the rest of the points in the most short-circuit.
|
|
2013-05-23 12:24:58
The Dijkstra algorithm uses in solving the simple source most short-path problem: Assigns belt power oriented graph G and the source i, asks from other each item of spot most short circuit to pass through i to G in.
|
|
2013-05-23 12:26:38
Dijkstra algorithm is used to resolve single-source shortest path problem: given a weighted directed graph g and the source point I, and from level I to g in the rest of the points of the shortest path.
|
|
2013-05-23 12:28:18
Dijkstra's algorithm used to solve the single source shortest path problem: given a weighted directed graph G and the source point i, find G from i to the rest of the points in the shortest path.
|
湖北省互联网违法和不良信息举报平台 | 网上有害信息举报专区 | 电信诈骗举报专区 | 涉历史虚无主义有害信息举报专区 | 涉企侵权举报专区
