1) Single-direction graph
![点击朗读](/dictall/images/read.gif)
单向图
2) unilaterally connected component
![点击朗读](/dictall/images/read.gif)
单向分图
1.
Avoiding considering the sequence of nodes,this paper proposes a new approach to work out both strongly connected and unilaterally connected components of a directed graph by using accesible matrix.
给出一种通过有向图可达矩阵求取强分图和单向分图的方法,此方法回避了结点的次序问题。
3) simple digraph
![点击朗读](/dictall/images/read.gif)
简单有向图
1.
",has been proved in the case of simple digraph.
![点击朗读](/dictall/images/read.gif)
就简单有向图情形下证明了Adám关于“若D是包含有向圈的有向图,则存在某弧,把它反向后将减少D中有向圈的数目”的猜想是正确
2.
An algorithm for finding all one-way sub-graph of simple digraph has been put forward in this paper.
文章提出了一种简单有向图所有单向分图的求解算法,该算法数据结构形式简单,求解方便且易于实现。
5) directed simple graph
![点击朗读](/dictall/images/read.gif)
有向简单图
6) simple undirected graph
![点击朗读](/dictall/images/read.gif)
简单无向图
1.
In this paper,the adjacency edge growth algorithm AEG for determining Hamilton cycle of a simple undirected graph is given,and then the algorithm s mathematical foundation?steps?specification?applied examples.
提出了一个判断给定简单无向图中有无Hamilton圈的邻接边增长算法,给出了该算法的理论基础、算法步骤、算法描述及算法分析。
补充资料:图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G,,GZ,…,则存在指标i
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条