无向图

directed acyclic graph

有向无环图

[总结]计算机图论中的"有向无环图"(DAG) 加载中,请稍后...一个图(Graph)是由一个点集 (其中有n个节点),以及一个有向无环图 (Directed Acyclic Graph)指的就是一个不存在环

Directed Acyclic Graph, DAG

有向无回图

有向图 directed graph | 有向无回图 Directed Acyclic Graph, DAG | 右链 right link

directed complete graph

无向完全图

有向完全图 Undirected Complete Graph | 无向完全图 directed complete graph | 稀疏图 Sparse graph

connected graph

连通图

节点不重复出现的链称为路径(path);在有向图中,节点不重复出现且链中所有弧的方向一致,则称为有向路径(directed path)无向图中,若任意两点间至少存在一条路径,则称为连通图(connected graph),否则为非连通图( discon-nected graph);

Regular Directed Graph

正则有向图

图有向递归集:directed graph recursive set | 正则有向图:Regular Directed Graph | 无圈有向图:directed graph without a ring

directed path

有向路(径)

次数为 1 的点称为悬挂点(pendant vertex)在无向图中,节点不重复出现的链称为路径(path);在有向图中,节点不重复出现且链中所有弧的方向一致,则称为有向路径(directed path)无向图中,若任意两点间至少存在一条路径,

non-informative prior distribution

无信息先验分布

无向图|undirected graph | 无信息先验分布|non-informative prior distribution | 无序分拆|unordered partition

simple graph

简单图

具有共同端点的边称为相邻边一条边的两个端点相同,称为自环(self-loop);具有两个共同端点的两条边称为平行边(parallel edges)既没有自环也没有平行边的图称为简单图(simple graph)在无向图中,与节点相关联边的数目,

undignified

不庄重的/无威严的

undigested /未被市场吸收的/ | undignified /不庄重的/无威严的/ | undigraph /无向图/

undirected

无方向性

方向性:边可以分为有方向性(directed)和无方向性(undirected)两种,有方向性的边称为有向边,无方向性的边称为无向边;同理有方向性的图形称为有向图,无方向性的图称为无向图.

photoperiodic response：光周期响应

photoperiodic induction 光周期诱导 | photoperiodic response 光周期响应 | photoperiodism 光期性

Multi-Variate Statistical Analysis：多元统计剖析

311. 多项距阵 Multi-Nominal Matrix | 312. 多元统计剖析 Multi-Variate Statistical Analysis | 313. 发电厂 Power Plant