shortest-path finding

常見(jiàn)例句

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ù)最小路徑搜索理論和“面向?qū)ο蟆钡某绦蛟O(shè)計(jì)技術(shù)，本文提出一種具有通用性的變電站操作票自動(dòng)生成系統(tǒng)的設(shè)計(jì)思想。