赋权图，每条边都有一个非负实数对应的图。这个实数称为这条边的权。
...个以上的边 z v5 孤立点(isolated)：不与任一条边关联的点 环 v3 z z v4 权(weight)：每个边上赋予值ω(e) 赋权图(weight graph)：具有权的图，记为G=[V，E，W]。
基于50个网页-相关网页
This DNA encoding method can be generalized to other optimization problems on weighted graph.
这种DNA编码方法可推广到其它赋权图上优化问题的DNA计算模型中。
参考来源 - 赋权图上优化问题的DNA计算方法研究The paper then discusses the case in the weighted graph.
然后讨论的是赋权图上的情形。
参考来源 - Steiner树问题中正则点分布与Steiner点性质·2,447,543篇论文数据，部分数据来源于NoteExpress
本文将网格分区问题转化为无向赋权图的分区，在图上研究分区算法。
In this thesis, grid partitioning is converted to an unoriented and weighted graph, on which partitioning algorithm is studied.
随着信息可视化技术应用范围的扩大，赋权树形图的绘制过程中常常需要对边的长度进行限定。
With the expansion of information visualization applications, requirement of the control over the length of edges appears in the drawing of weighted arborescence.
本文对一种目标函数为非线性函数的0—1规划问题提出了一种运用赋权偶图及完美对集的求解方法。
This article gives a solution to the programming 0-1 problem whose objective function is a nonlinear function, by applying weighted bipartite graph and perfect matching.
应用推荐