非连通图

非连通图

简明

1
unconnected graph
非连通图，不连通图；

网络释义
专业释义

1
unconnected graph
...个名词—— 若 G 中任二个节点间至少有一条通路，则称G 为连通图（Connected Graph），否则G 为 非连通图（Unconnected Graph）。
2
disconnect graph
... disconnect from All 全部中断连接 disconnect graph 非连通图 disconnect 断开 ...

短语

1
否则为非连通图
discon-nected graph

双语例句

1
拓扑排序算法既可以用于连通图，也可以用于非连通图。
The topological sorting algorithm works on unconnected graphs as well as connected graphs.
2
其优点在于，算法统一、方法简单、容易实现、便于修改，并且易于并行化，可以直接用来画非连通图。
The advantages of the method are: unified algorithms, simplicity, easy modification and parallelism, and it can be used to draw non connected graphs directly.
3
利用组合理论和图的计数理论，讨论了只含有一个非平凡块的连通图的计数问题，给出了新的结论。
The enumeration problem for connective graphs with one nontrivial block was discussed by the theory of combinatorics, and the new conclusion is also given.

查看更多

点击反馈