您要查找的是不是：
- Finally, Chapter eleven covers the special topics of the maximal flow problem, the shortest path problem, and the multicommodity minimal cost flow problem. 最后，第十一章覆盖了特殊主题：最大化流问题、最短路径问题和多物最小消费流问题。
- Successive two days all the time is have loose bowels alvine path problem? 连续两天一直拉肚子是肠道问题么？
- This paper deals with TSP by transform TSP to a special Shortest Path Problem. 本文将解决TSP问题转化为一种特殊的最短路问题。
- Biomolecular computing has been successfully applied in computing NP complete problems such as Hamiltonion path problem, maximal clique problem and SAT problems in Boolean calculation, etc. 生物分子计算已成功地应用于计算哈密顿路径、最大集合以及逻辑运算中的SAT类问题等 NP完全问题。
- There are two major types of class path problems. 主要有两种类型的类路径问题。
- Based on this analysis, we propose approximate algorithms on BCP and RSP(restricted shortest path problem) and make performance analysis on them. 基于以上分析,我们给出了BCP和单约束最短路径问题(RSP,restricted shortest path problem)的近似算法,并对算法性能进行了分析;
- Let G be a digraph.The two-objective optimal path problem is to find a path which has the maximum weight and minimum cost in G. 双目标最优路问题是指在一个图中找这样的路，使其权最大，费用最少。
- Concept and implement of graph, basic operations of graph, minimum cost spanning tree, shortest path problem, AOV and AOE network. 图的概念和实现；图的基本操作；最小价值生成树；最短路径；活动网络。
- By pre-computing and storing viewshed information, the optimal visual coverage path problem is resolved using simulated annealing algorithm based on viewshed amalgamation. 通过预先计算并存储视域信息，采用基于视域融合的模拟退火算法实现了该问题的求解。
- This paper addresses sensitivity analysis questions concerning the shortest path problem and the maximum capacity path problem in an undirected network. 本论文旨在评估分散型电源在常闭环路配电馈线上之最大可并网量。
- They cleaved a path through the wilderness. 他们在荒原中开辟出一条路。
- A virus evolutionary genetic algorithm is designed and the corresponding coding scheme and the calculation method of adaptability are proposed to solve the optimal dynamic path problem in vehicle navigation. 针对车辆导航的动态最优路径问题,设计一种病毒进化遗传算法,提出相应的编码方案和适应度的计算。
- This paper aims at the most vital node of the shortest path problem under uncertainty (MVN-U).Firstly, this paper states the concept of the most vital node of the shortest path under uncertainty. 对该问题，以前的文献都是从确定情形（事先具有节点中断的完全信息）下进行研究的，本文从不确定情形（只有数据包行进到中断节点的邻接点时才获得该节点中断的信息）的角度重新考虑这个问题。
- She will be a maximal help to here. 她到这儿将是个极大的帮助。
- She obtained maximal benefit from the course. 她从该课程中获益极大。
- She squelched along the muddy path. 她沿着泥泞小径格吱格吱地走。
- "Waste not, want not" is her favorite maxim. “不浪费则不匮乏”是她特别喜爱的格言。
- He was destined to plod the path of toil. 他注定要在艰辛的道路上跋涉。
- Algorithm DIMCRA can solve link disjoint paths problem with multiple additive constraints well. DIMCRA算法能很好地解决多个加性约束下的链路分离路径问题的算法。
