网站首页  英汉词典

请输入您要查询的英文单词:

 

单词 Shortest path
释义

Shortest path

原声例句
Vox 观点

The person in starting position 1 has the shortest path to the first turn.

在起始位置1的人有到第一个转弯的最短路径。

CNN 10 学生英语 2022年12月合集

While a few others tiptoe across a short path through the Rio Grande.

而另一些人则蹑手蹑脚地穿过格兰德河的一条小路。

两分钟论文

In computer science, we encounter many interesting problems, like finding the shortest path between two given streets in a city, or measuring the stability of a bridge.

在计算机科学中,我们会遇到很多有趣的问题,比如在一个城市给定的两条街道间找出最短路线,或者计算桥梁的稳固程度。

VOA Special 2018年11月合集

Cordoba is 286 kilometers from the capital by the shortest path.

科尔多瓦距首都 286 公里,距离最短。

TED演讲(音频版) 2019年12月合集

The shortest path may be a curve rather than a straight line.

最短路径可能是曲线而不是直线。

BBC Ideas

So this simple process of positive feedback is surprisingly effective at finding the shortest path.

因此,这个简单的正反馈过程在寻找最短路径方面出奇地有效。

泰山之子(下)

The shortest path led straight through the center of the village, and this Meriem took.

最短的路径直接穿过村子的中心, 而梅瑞姆选择了这条路径。

奇思妙想物语

That's because the quickest and shortest paths to pleasure are often found in cheap, shallow, and unhealthy vices, such as junk food, drugs, porn, mindless entertainment, and so on.

这是因为通往快乐的捷径往往是在廉价、肤浅和不健康的恶习中找到的,比如垃圾食品、毒品、色情、盲目的娱乐等等。

自然杂志:人体健康

They're attracted to a chemical at the other end and by sensing the chemical gradient they can pick the shortest path.

它们被另一端的化学物质吸引,通过感知化学梯度,它们可以选择最短路径。

科技 Crash Course

Last episode, we discussed a few example classic algorithms, like sorting a list of numbers and finding the shortest path in a graph.

上一集,我们讨论了一些经典算法示例,例如对数字列表进行排序和查找图中的最短路径。

TED-Ed(视频版)

A single ant can't do much on its own, but an ant colony can solve complex problems, like building a nest and finding the shortest path to a food source.

一只蚂蚁独自做不了太多事情,但一个蚁群可以解决复杂的问题,比如筑巢和寻找到达食物来源的最短路径。

中文百科

最短路问题 Shortest path problem

(重定向自Shortest path)
一个有6个节点和7条边的图
Ejemplo de Grafo Ponderado
Shortest path (A, C, E, D, F) between vertices A and F in the weighted directed graph
Beispielgraph

最短路径问题是图论研究中的一个经典算法问题,旨在寻找图(由结点和路径组成的)中两结点之间的最短路径。算法具体的形式包括:

用于解决最短路径问题的算法被称做“最短路径算法”,有时被简称作“路径算法”。最常用的路径算法有:

英语百科

Shortest path problem 最短路问题

(重定向自Shortest path)
(6, 4, 5, 1) and (6, 4, 3, 2, 1) are both paths between vertices 6 and 1
Shortest path (A, C, E, D, F) between vertices A and F in the weighted directed graph
Ejemplo de Grafo Ponderado
Beispielgraph

In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.

The problem of finding the shortest path between two intersections on a road map (the graph's vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of its road segment) may be modeled by a special case of the shortest path problem in graphs.

随便看

 

英汉网英语在线翻译词典收录了3779314条英语词汇在线翻译词条,基本涵盖了全部常用英语词汇的中英文双语翻译及用法,是英语学习的有利工具。

 

Copyright © 2004-2024 encnc.com All Rights Reserved
更新时间:2025/6/18 16:46:50