查询词典 labeled graph
- 与 labeled graph 相关的网络解释 [注:此内容来源于网络,仅供参考]
-
circulant flow:回圈流
circuit graph 回路图 | circulant flow 回圈流 | circulant graph 回圈图
-
journal citing half life+graph:期刊引用半衰期与图解
journal cited half life+graph 期刊被引半衰期与图解 | journal citing half life+graph 期刊引用半衰期与图解 | journal immediacy index 期刊立即指数
-
closed graph theorem:闭图定理
closed graph 闭图 | closed graph theorem 闭图定理 | closed group 闭群
-
closed graph:闭图
closed geodesic 闭测地线 | closed graph 闭图 | closed graph theorem 闭图定理
-
the complementary graph of forest:森林的补图
树的补图:the complementary graph of tree | 森林的补图:the complementary graph of forest | 长链互补引物:Long complementary primers
-
the complementary graph of tree:树的补图
显性互补基因:Complementary Dominant Genes | 树的补图:the complementary graph of tree | 森林的补图:the complementary graph of forest
-
complete graph:完全图
所谓完全图(complete graph)就是任意2个结点之间都有边的图,见图(a);所谓偶图(bipartite graph)就是可以把全部结点分成两个不相交的集合,所有边的两个端点分属于这两个集合的图,见图(b).
-
Complete 5-partite graph:完全5分图
完全多部图:The complete n-partite graph | 完全5分图:Complete 5-partite graph | 人的全面发展:human"s complete development
-
connected component:连通分量
连通分量(connected component): 无向图(undirected graph)中的最大连通子图叫做一个连通分量,例如下图中的连通分量为3强连通分量(strongly connected component): 如果有向图(derected graph)中任意一个节点都存在到达其它每个节点的路径,
-
connected graph:连通图
节点不重复出现的链称为路径(path);在有向图中,节点不重复出现且链中所有弧的方向一致,则称为有向路径(directed path)无向图中,若任意两点间至少存在一条路径,则称为连通图(connected graph),否则为非连通图( discon-nected graph);
- 相关中文对照歌词
- Flashback
- Only Human
- Walking On A Thin Line
- All American
- Overland, West Of Suez
- House Of Boxes
- Space Case
- The Box
- Deify
- Stuck
- 推荐网络解释
-
air ventilator:通风管
air purifier 空气滤清剂 | air ventilator 通风管 | air-bleed 空气分泄器
-
sound motion picture, talkie:有声电影
silent cinema, silent films 无声电影 | sound motion picture, talkie 有声电影 | cinemascope, CinemaScope 西涅玛斯科普型立体声宽银幕电影,变 形镜头式宽银幕电影
-
carbonizing paper:复写纸原纸
复写纸原纸 carbon raw paper | 复写纸原纸 carbonizing paper | 打光用纸,研磨纸 carborundum paper