...学研究生院硕十学位论文 设D=(矿,A)是有向图,如果存在H∈V,使得Vv,∈y,D中均存在M~H路, 则称D为有根图(rooted graph),并称M为D的根(root). 称不含回路的有根图D为树形图(arborescence). 设D=(矿,A,w)是一个赋权网络,D的所有v~1,,路...
基于2313个网页-相关网页
line rooted graph 有根线路图
line-rooted graph 线有根图
rooted directed graph [数] 有根有向图
r-rooted star graph r根点星图
single-rooted hierarchical graph 单根节点层次图
rooted connected directed graph 带根连通有向图
以上来源于: WordNet
应用推荐