英语词汇connected undirected graph怎么读，是什么意思，单词翻译、读音、固定搭配用法和短语词组及例句-英汉双解词典

单词

connected undirected graph

释义

connected undirected graph

简明释义

连通无向图

网络释义

1
?连接无向图
... connected undirected graph 连接无向图 unilaterally connected graph 单面连接图 weaked connected graph 弱连接图 ...
2
?连通无向图
... connect-undirected graph : 连通无向图 connected undirected graph : 连通无向图 undigraph(undirected graph) : 无向图 ...
3
?连通的无向图
... 的术语，但应该还是很直观。呱是如何选择旅行路径的？程序内建东、西、南、北四个区域，呱会选择一个地区旅行每个区域的设计都是一个连通的无向图 (connected undirected graph)，而呱的旅行路线就是在图上某两个点之间走出一条路径 (path)。

短语

1
a weighted connected undirected graph
无向连通带权图
2
undirected connected graph
无向连通图

双语例句

1
Broadcast networks can be expressed by a simple connected undirected graph.
将广播网络用简单连通的无向图表示。
2
Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.
最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。
3
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。

随便看

英汉双解词典包含3185865条英汉词条，基本涵盖了全部常用单词的翻译及用法，是英语学习的有利工具。

单词	connected undirected graph
释义	connected undirected graph 简明释义连通无向图网络释义 1 ?连接无向图 ... connected undirected graph 连接无向图 unilaterally connected graph 单面连接图 weaked connected graph 弱连接图 ... 2 ?连通无向图 ... connect-undirected graph : 连通无向图 connected undirected graph : 连通无向图 undigraph(undirected graph) : 无向图 ... 3 ?连通的无向图 ... 的术语，但应该还是很直观。呱是如何选择旅行路径的？程序内建东、西、南、北四个区域，呱会选择一个地区旅行每个区域的设计都是一个连通的无向图 (connected undirected graph)，而呱的旅行路线就是在图上某两个点之间走出一条路径 (path)。短语 1 a weighted connected undirected graph 无向连通带权图 2 undirected connected graph 无向连通图双语例句 1 Broadcast networks can be expressed by a simple connected undirected graph. 将广播网络用简单连通的无向图表示。 2 Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph. 最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。 3 In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g. 给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
随便看	not taken out not take one's eyes off not take something lying down not taking any Nottawasaga Bay Nottaway Notte not tear one's eyes off Nottebohm not tell Nottely River not tender Nottensdorf notter not test not that not (that)...but not that I know of not that there's anything wrong with that not that you know of not the best of not the case not the clean potato not the end of the world not the ghost of