shortest path

基本解釋

• [數(shù)] 最短路徑

英漢例句

雙語例句

• Traffic relies on those announcements to find the shortest path to a Web site.
  依靠這些幫助網(wǎng)絡(luò)可以找到到達(dá)網(wǎng)站的最短路徑。
• These simulations could enhance the analysis on the critical path, shortest path, cycle time, and cost/time measures about the process model.
  這些分析增強(qiáng)了對(duì)于關(guān)鍵路徑、最短路徑、周轉(zhuǎn)時(shí)間及對(duì)于流程模型的耗費(fèi)/時(shí)間的測(cè)量的分析。
• Routing tables are continuously built and rebuilt by intelligent discovery protocols, such as Routing Information Protocol or Open Shortest Path First（OSPF）.
  路由表由智能發(fā)現(xiàn)協(xié)議，如路由信息協(xié)議或者開放最短路徑優(yōu)先協(xié)議，不斷地被建立和再建立。

原聲例句

• So if you think about the way something like, say, Mapquest works, and last week in recitation you looked at the fact that shortest path is exponential.
  所以如果你想想電子地圖，還有上周學(xué)的列舉法,你就會(huì)發(fā)現(xiàn)一般最簡(jiǎn)單的方法,都是指數(shù)遞增的。
  麻省理工公開課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選
• End up where you started. It's not quite the same as the shortest path, and figure out the way to do that that involves spending the least money. Or the least time, or something else.
  最后回到最初的地方,這和最短路徑問題有些不同,需要找出一條花費(fèi)最少,或者費(fèi)時(shí)最少或者滿足其它條件的路徑。
  麻省理工公開課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選
• And tomorrow it's recitation, we'll spend quite a bit of time on shortest path problems.
  也就是說我們會(huì)在最短路徑問題上,花上很多時(shí)間。
  麻省理工公開課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選

權(quán)威例句

• Implement BFS, DFS, Shortest Path, topological sort and Minimum Spanning Tree (bonus for union-find version).
  FORBES: What Are Some Useful Technical Skills I Can Learn Within A Day?

• shortest path更多例句

詞組短語

短語

• shortest time path 時(shí)間最短路
• shortest Manhattan path 最短的曼哈頓路徑
• The Shortest -Path 最短路徑
• Shortest Augmenting Path 算法
• shortest -path finding 最小路徑搜索

• shortest path更多詞組

專業(yè)釋義

計(jì)算機(jī)科學(xué)技術(shù)

• 最短路徑

  Theory and practice indicate that this algorithm is availability method obtaining shortest path.
  理論和實(shí)踐都表明該算法是求最短路徑的有效方法。

  交通運(yùn)輸工程

• 最優(yōu)路徑

  Being one of the core techs of RGS, Shortest Path Algorithm (SPA) is the basis of a correct and effective route guidance function.
  最優(yōu)路徑規(guī)劃技術(shù)是車輛導(dǎo)航系統(tǒng)中的核心技術(shù)之一,是準(zhǔn)確有效的導(dǎo)航功能得以實(shí)現(xiàn)的基礎(chǔ)。

• 路徑最短

  Compared with the traditional static induction system on a simple physical meaning or time static shortest path, dynamic path optimization has important theoretical and engineering application value.
  相比于傳統(tǒng)靜態(tài)誘導(dǎo)系統(tǒng)中簡(jiǎn)單的物理意義上的路徑最短或靜態(tài)時(shí)間最短,具有重要的理論意義和工程應(yīng)用價(jià)值。

  電子、通信與自動(dòng)控制技術(shù)

• 最短路徑

  The shortest path problem is a core model that lies at the heart of network optimization.
  最短路徑問題是網(wǎng)絡(luò)優(yōu)化的核心技術(shù)。

  測(cè)繪科學(xué)技術(shù)

• 最優(yōu)路徑

  The Dijkstra algorithm is improved for meeting the need of the optimal path in the traffic induced by the theory of Dijkstra shortest path and the road network model builded of the paper.
  結(jié)合本文構(gòu)建的路網(wǎng)模型,改進(jìn)的Dijikstra算法滿足了交通誘導(dǎo)中搜索最優(yōu)路徑的需求。

  數(shù)學(xué)

• 最短道路