1) connected weight unordered graph
连通赋权无向图
2) A weighted connected graph
赋权连通图
3) 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算法。
4) undirected weighed graph
赋权无向图
5) weighted undirected graph
无向赋权图
1.
Spectral-based weighted undirected graph partitioning algorithm
基于谱方法的无向赋权图剖分算法
2.
Furthermore,we propose the algorithm for converting VLSI netlist to weighted undirected graph in VGC.
基于VLSI剖分问题的需要,设计并实现了VLSI设计到无向赋权图的转换系统(VLSI/Graph Converter,VGC)。
6) connected and weighted simple graph
连通赋权简单图
补充资料：因侵害姓名权、肖像权、名誉权、荣誉权产生的索赔权
因侵害姓名权、肖像权、名誉权、荣誉权产生的索赔权：公民、法人的姓名权、名称权，名誉权、荣誉权、受到侵害的有权要求停止侵害，恢复名誉，消除影响，赔礼道歉，并可以要求赔偿损失。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条