有向图
- 与 有向图 相关的网络解释 [注：此内容来源于网络，仅供参考]
-
directed circuit
有向图
克隆:site-directed mutagenesis | 有向图:directed circuit. | 有向图:Directed graph.
-
digraph, directed graph
有向图
有向树|directed tree | 有向图|digraph, directed graph | 有效点|efficient point
-
directed graph undirected graph
有向图 无向图
Difference Manchester 差分曼彻斯特 | directed graph undirected graph 有向图 无向图 | distinguish 辩认区别
-
KKdirected graph undirected graph
有向图 无向图
KKDifference Manchester 差分曼彻斯特 | KKdirected graph undirected graph 有向图 无向图 | KKdistinguish 辩认区别
-
Directed Acyclic Graph, DAG
有向无回图
有向图 directed graph | 有向无回图 Directed Acyclic Graph, DAG | 右链 right link
-
digraph
有向图
对于一个图G,若边集E(G)为有向边的集合,则称此图为有向图(digraph),若边集E(G)为无向边的集合,则称此图为无向图(undigraph). 下图a和b分别为一个无向图G 1 和有向图G 2 ,图中每个顶点里的数字或字母为该顶点的符号、编号或关键字,每个图对应的顶点网络的例子(二)图的基本术语
-
digraph
两字一音
diglossia 双语 | digraph 两字一音 | digraph 有向图
-
directed graph circuit algorithm
有向图电路算法
有向图 directed graph | 有向图电路算法 directed graph circuit algorithm | 有向逻辑关系 directed logical relation
-
directed edge sequence
有向棱序列
directed distance 有向距离 | directed edge sequence 有向棱序列 | directed graph 有向图
-
directed graph
有向图
这样的外观相当於数学所讲的有向图(directed graph). 成员中的资源可以用来代表全球网上的某资源或没有实质资源的物件,字面数据是用来提供事实资料. 一个资源和另一资源、或字面数据和把它们连在一起的连线可用来陈述一项事实,
- 推荐网络解释
-
emblazonry：纹章描画法
emblazonment 纹章装饰 | emblazonry 纹章描画法 | emblem 象征
-
UltraNav Wizard：(随机指点设备设置)
?ThinkPad Software installer (查看或更改软件安装情况) | ?UltraNav Wizard (随机指点设备设置) | ?IBM Rapid Restore Ultra (快速备份恢复软件)
-
entry：条目
每一个分支称为"条目"(entry),当然这种分支结构可以进行嵌套,即允许分支再拥有自己的子分支结构. 条目本身只是一个名称,用来识别当前分支的名字. 所有的信息通过该条目下的属性名(atrribute name)与属性值(attribute value)对的形式存在.