Mobile
Log In Sign Up
Home > english-chinese > "最短路径算法" in Chinese

Chinese translation for "最短路径算法"

shortest path algorithm

Related Translations:
短路传送:  short-circuiting transfer
短路故障:  short circuit faultshort trouble
热短路:  thermal short circuit
近似短路:  near short
解剖短路:  anatomic shunt
短路区:  shorting region
短路端:  short circuit end
虚短路:  imaginary shortvirtual short circuit
短路绕组:  short circuit windingshort circuited windingshort-circuit windingshort-circuited winding
使短路:  short outshortcircuitshort-circuit
Example Sentences:
1.The calculating method for the actual route length of facility layout
关于设备布局的最短路径算法模型
2.Dijkstra ' s shortest path first algorithm
最短路径算法
3.Shortest path algorithm with real time traffic information in dynamic vehicle routing problem
动态车辆路径问题中的实时最短路径算法研究
4.Shortest path algorithm based on limiting parallelogram and its application in traffic networks
平行四边形限制最短路径算法及其在交通网络中的应用
5.We adopt k shortest paths into routing and choose the best route in them considering link costs , links hops and the number of no - utilized wavelength in a link
路由选择采用k条最短路径算法进行,备选路由集中首选最佳路由时考虑链路的代价,跳数和每一条链路上不可用波长数。
6.The example of city traffic management system in our daily lives was analyzed , and applications of shortest - path algorithm in city traffic management system were expatiatecl as well
本文分析了城市交通管理系统在现实生活中的应用,并阐述了最短路径算法在城市交通管理系统中的应用。
7.We set focus on solutions which include the vector map representation of city road network , the abstraction and construction of the topological structure of network , and the efficient implementation of shortest path algorithm
其中,重点解决了城市道路网的矢量地图表达、网络拓扑结构的提取和构建、最短路径算法的高效实现等关键技术。
8.It importantly introduces the technology of analyzing the gis - network , and points out that analyzing the gis - network , is the basic function of the gis space analysis . the core of the gis space analysis is working out the short path - and the best path form the destination to the source
并重点介绍了gis网络分析技术,指出路径网络分析是gis空间分析最基本的功能,其核心是对最短路径、最佳路径的求解,并叙述了最短路径算法的相关知识。
9.Domain ontology can be modeled a simple directed acyclic network , subsumption relation between two concepts can be computed by the ( immediate ) ancestor or descendent algorithm in a ~ ( h ) , association degree between two concepts can be computed by the shortest path algorithm in a ~ ( h )
领域本体可以模型化为一个简单有向无环网络,概念之间的包含关系可以通过a ~ h中的(直接)前驱后继算法来求解,而概念之间的关联度可以通过a ~ h中的最短路径算法来求解。
Similar Words:
"最短路径分配" Chinese translation, "最短路径关键路径" Chinese translation, "最短路径路由选择" Chinese translation, "最短路径蔓" Chinese translation, "最短路径树" Chinese translation, "最短路径算则" Chinese translation, "最短路径推断" Chinese translation, "最短路径问题" Chinese translation, "最短路径选择" Chinese translation, "最短路径优先" Chinese translation