shortest-path finding

基本解釋

• [測(cè)繪科學(xué)技術(shù)]最短路逕

英漢例句

雙語(yǔ)例句

• Finding obstacle-avoiding shortest path is an important problem in VLSI design, and connection graph is a fundamental tool to resolve the problem.
  在有障礙時(shí)求兩點(diǎn)間的最短路逕是VLSI設(shè)計(jì)、機(jī)器人設(shè)計(jì)等領(lǐng)域中的基本問(wèn)題，連接圖是研究此問(wèn)題的基本工具。
• The general automatic generation software of substation operation orders is presented based upon the principle of the shortest path-finding and OOP technology.
  根據(jù)最小路逕搜索理論和“麪曏對(duì)象”的程序設(shè)計(jì)技術(shù)，本文提出一種具有通用性的變電站操作票自動(dòng)生成系統(tǒng)的設(shè)計(jì)思想。

• shortest-path finding更多例句

詞組短語(yǔ)

短語(yǔ)

• shortest path -finding 最短通路搜索

• shortest-path finding更多詞組

專(zhuān)業(yè)釋義

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

• 最短路逕

  It is a powerful tool in people’s work and life. Shortest Path Finding is a key content in Network-Analysis of GIS.
  最短路逕問(wèn)題是地理信息系統(tǒng)網(wǎng)絡(luò)分析中的一個(gè)關(guān)鍵內(nèi)容,目前在GIS中,特別是在交通、電力等GIS應(yīng)用系統(tǒng)中,最短路逕算法的優(yōu)化和實(shí)現(xiàn)已經(jīng)成爲(wèi)整個(gè)系統(tǒng)的核心功能之一。