有向图
- 与 有向图 相关的网络解释 [注：此内容来源于网络，仅供参考]
-
digraph
有向图
对于一个图G,若边集E(G)为有向边的集合,则称此图为有向图(digraph),若边集E(G)为无向边的集合,则称此图为无向图(undigraph). 下图a和b分别为一个无向图G 1 和有向图G 2 ,图中每个顶点里的数字或字母为该顶点的符号、编号或关键字,每个图对应的顶点网络的例子(二)图的基本术语
-
signed digraph
信号有向图,符号有向图
signed digit number system 带符号数制 | signed digraph 信号有向图,符号有向图 | signed exponent 带符号指数
-
converse digraph
逆有向图
逆 converse | 逆有向图 converse digraph | 逆图 converse graph
-
directed circuit
有向图
克隆:site-directed mutagenesis | 有向图:directed circuit. | 有向图:Directed graph.
-
directed graph circuit algorithm
有向图电路算法
有向图 directed graph | 有向图电路算法 directed graph circuit algorithm | 有向逻辑关系 directed logical relation
-
digraph, directed graph
有向图
有向树|directed tree | 有向图|digraph, directed graph | 有效点|efficient point
-
Signed Directed Graph
符号有向图
符号定向图:signed directed graph | 符号有向图:Signed Directed Graph | 广义有向图:Generalized directed graph
-
Regular Directed Graph
正则有向图
图有向递归集:directed graph recursive set | 正则有向图:Regular Directed Graph | 无圈有向图:directed graph without a ring
-
directed graph undirected graph
有向图 无向图
Difference Manchester 差分曼彻斯特 | directed graph undirected graph 有向图 无向图 | distinguish 辩认区别
-
KKdirected graph undirected graph
有向图 无向图
KKDifference Manchester 差分曼彻斯特 | KKdirected graph undirected graph 有向图 无向图 | KKdistinguish 辩认区别
- 推荐网络解释
-
Apportioned Effort：分摊努力
Applied Direct Costs 实际直接成本 | Apportioned Effort 分摊努力 | Apportioned Task 分摊任务
-
tussah silk fabric：柞丝绸
tussah silk carpet 柞丝毯 | tussah silk fabric 柞丝绸 | tussah silk fancy yarn 柞粗纺丝
-
make sb. do sth.(be made sb.to do sth：使某人做某事
be made for each other 有利于,倾向于 | make sb. do sth.(be made sb.to do sth.)使某人做某事 | to make a speech 做报告.