查询词典 directed graph
- 与 directed graph 相关的网络解释 [注:此内容来源于网络,仅供参考]
-
directed acyclic graph:abbr. dag; 有向无环图
-1
-
directed acyclic graph:abbr. dag; 非成圈有向图
-1
-
strongly connected complex:强连通复体
强性变分 strong variation | 强连通复体 strongly connected complex | 强连通矢图 strongly connected directed graph
-
connected graph:连通图
节点不重复出现的链称为路径(path);在有向图中,节点不重复出现且链中所有弧的方向一致,则称为有向路径(directed path)无向图中,若任意两点间至少存在一条路径,则称为连通图(connected graph),否则为非连通图( discon-nected graph);
-
compact convex set:紧密凸集
紧密编译器 compact compiler | 紧密凸集 compact convex set | 压紧有向非循环字图 compact directed acyclic word graph
-
Signed Directed Graph:abbr. sdg; 网与
-1
-
root:树根
则称为有向路径(directed path)无向图中,若任意两点间至少存在一条路径,则称为连通图(connected graph),否则为非连通图( discon-nected graph);非连通图中的每个连通子图称为成分 (component)树图:倒置的树,根(root)在上,树叶(lea
-
spares graph:稀疏图
有向无环图 directed acyclic graph | 稀疏图 spares graph | 稠密图 dense graph
-
directable increment sign:方向可変増分符号相関
direct-writing recorder 直接記録計器 | directable increment sign 方向可変増分符号相関 | directed graph 有向グラフ
-
block head:部分程式首部
1112,"block directed graph","区块有向图解" | 1113,"block head","部分程式首部" | 1114,"block iteration method","分块迭代法"
- 推荐网络解释
-
The Shop Around the Corner:街角商店
上错天堂投错胎Heaven Can Wait (1943) | 街角商店The Shop Around the Corner (1940) | 妮诺奇嘉Ninotchka (1939)
-
neigher nor gate:既非又不闸
"邻区最佳控制","neighboring optimal control" | "既非又不闸","neigher nor gate" | "内利亚克编译程式","NELIAC; naval electronics laboratory international algebraic complier"
-
fight fought:打架
buy bought 买 | fight fought 打架 | think thought 想