关于算法(Algorithm)，下列叙述正确的是()。

A.算法是问题求解方法及求解过程的描述。

B.算法可以用自然语言、流程图或伪代码描述，各有其优点。

C.在算法描述中，自然语言、流程图和伪代码不能混合使用。

D.在算法设计中，用户和分析师常采用伪代码描述算法，沟通思想。

E.在算法设计中，设计师和程序员之间采用流程图工具。

F.自然语言描述常用于细节的描述。

A.算法是问题求解方法及求解过程的描述。

B.算法可以用自然语言、流程图或伪代码描述，各有其优点。

C.在算法描述中，自然语言、流程图和伪代码不能混合使用。

D.在算法设计中，用户和分析师常采用伪代码描述算法，沟通思想。

E.在算法设计中，设计师和程序员之间采用流程图工具。

F.自然语言描述常用于细节的描述。

A.当图中不存在负权回路但是存在负权边时，Dijkstra算法不一定能求出源点到所有点的最短路。 When the graph doesn't contain circuit of negative weight, but contains the edge of negative weight. Dijkstra algorithm can't guarantee the correctness of the algorithm.#B.当图中不存在负权边时，Dijkstra算法能求出每对顶点间最短路径。 When the graph doesn't contain edge of negative weight, Dijkstra algorithm can calculate the shortest path of each pair of vertices.#C.当图中存在负权回路时，Dijkstra算法也一定能求出源点到所有点的最短路。When

A.当图中不存在负权回路但是存在负权边时，Dijkstra算法不一定能求出源点到所有点的最短路。 When the graph doesn't contain circuit of negative weight, but contains the edge of negative weight. Dijkstra algorithm can't guarantee the correctness of the algorithm.#B.当图中不存在负权边时，Dijkstra算法能求出每对顶点间最短路径。 When the graph doesn't contain edge of negative weight, Dijkstra algorithm can calculate the shortest path of each pair of vertices.#C.当图中存在负权回路时，Dijkstra算法也一定能求出源点到所有点的最短路。When

A.当图中不存在负权回路但是存在负权边时，Dijkstra算法不一定能求出源点到所有点的最短路。 When the graph doesn't contain circuit of negative weight, but contains the edge of negative weight. Dijkstra algorithm can't guarantee the correctness of the algorithm.#B.当图中不存在负权边时，Dijkstra算法能求出每对顶点间最短路径。 When the graph doesn't contain edge of negative weight, Dijkstra algorithm can calculate the shortest path of each pair of vertices.#C.当图中存在负权回路时，Dijkstra算法也一定能求出源点到所有点的最短路。When

A.当图中不存在负权回路但是存在负权边时，Dijkstra算法不一定能求出源点到所有点的最短路。 When the graph doesn't contain circuit of negative weight, but contains the edge of negative weight. Dijkstra algorithm can't guarantee the correctness of the algorithm.#B.当图中不存在负权边时，Dijkstra算法能求出每对顶点间最短路径。 When the graph doesn't contain edge of negative weight, Dijkstra algorithm can calculate the shortest path of each pair of vertices.#C.当图中存在负权回路时，Dijkstra算法也一定能求出源点到所有点的最短路。When

A.算法保证计算结果的正确性。Algorithm will ensure the correctness of the calculation results.

B.组成算法的指令可以有限也可能无限。 Instructions which composite algorithms can be infinite or finite

C.算法描述中下一步执行的步骤不确定。 The next step in the implementation of the algorithm described is uncertain.

D.算法的有穷性指算法必须在有限步骤内结束。The finite nature of algorithms means algorithm must be completed within a limited step.

A.算法保证计算结果的正确性。Algorithm will ensure the correctness of the calculation results.

B.组成算法的指令可以有限也可能无限。 Instructions which composite algorithms can be infinite or finite

C.算法描述中下一步执行的步骤不确定。 The next step in the implementation of the algorithm described is uncertain.

D.算法的有穷性指算法必须在有限步骤内结束。The finite nature of algorithms means algorithm must be completed within a limited step.

A.算法保证计算结果的正确性。Algorithm will ensure the correctness of the calculation results.

B.组成算法的指令可以有限也可能无限。 Instructions which composite algorithms can be infinite or finite

C.算法描述中下一步执行的步骤不确定。 The next step in the implementation of the algorithm described is uncertain.

D.算法的有穷性指算法必须在有限步骤内结束。The finite nature of algorithms means algorithm must be completed within a limited step.

A.算法保证计算结果的正确性。Algorithm will ensure the correctness of the calculation results.

B.组成算法的指令可以有限也可能无限。 Instructions which composite algorithms can be infinite or finite

C.算法描述中下一步执行的步骤不确定。 The next step in the implementation of the algorithm described is uncertain.

D.算法的有穷性指算法必须在有限步骤内结束。The finite nature of algorithms means algorithm must be completed within a limited step.