1) undirected weighted graph
无向加权图
1.
Optimizing recurrent algorithm for k-vertex-connected augmentation on arbitrary undirected weighted graph;
任意无向加权图K点连通扩充的逐次改善算法
2.
This paper presents a refined app roach of genetic algorithm for k-vertex-connected augmentation of undirected weighted graphs.
作者提出一种改进遗传算法来解决无向加权图的k点连通扩充问题,通过改进遗传算法中的交叉和变异操作有效地改善了群体的效果,有助于搜索解空间中新的区域,能以较大概率搜索到全局最优。
3.
Distance indexing and object search on an undirected weighted graph are important work while using an undirected weighted graph,which is also a key process while solving an actual problem.
在无向加权图上进行距离检索和对象查询是使用无向加权图的重要工作,也是解决实际问题的重要步骤。
2) Weighted graph
加权无向图
3) Connected unweighted undirected graphs
无向非加权图
4) undirected weighted graph
无向赋权图
1.
The solution-based DPCNN to the minimum spanning tree of undirected weighted graph;
基于DPCNN的无向赋权图的最小生成树的求解
2.
Undirected Weighted Graph Hamilton Path Question Based on DNA Algorithm;
基于DNA计算的无向赋权图哈密顿路径问题
3.
The two algorithms for finding the minimal spanning tree of an undirected weighted graph are PRIM algorithm and KRUSKAL algorithm.
对求无向赋权图最小生成树两种算法分别是PRIM算法和KRUSKAL算法。
5) weighted-graph
带权无向图
6) undigraph with weight
无向有权图
1.
The undigraph with weight to present the construction constraints between graph elements, the weight to present the class of construction-constraints between graph elements.
较为详细地阐述了结构约束识别模块及尺寸约束的表示,并提出了用无向有权图来表示图素间的结构约束,用权来表示图素间结构约束的类型。
2.
The paper mainly focuses on the recognition and presentation of topologic relations between elements of scanned engineering drawings,sets up the model of "undigraph with weight" to present the relations,and gives the corresponding algorithms and the experimental results based on the model.
本文主要研究扫描工程图二维重建中图素间拓扑关系的识别和表达 ,建立了“无向有权图”的图素拓扑关系表达模型 ,并给出了相应的算法和基于该模型的实验结果。
补充资料：因侵害姓名权、肖像权、名誉权、荣誉权产生的索赔权
因侵害姓名权、肖像权、名誉权、荣誉权产生的索赔权：公民、法人的姓名权、名称权，名誉权、荣誉权、受到侵害的有权要求停止侵害，恢复名誉，消除影响，赔礼道歉，并可以要求赔偿损失。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条