...为无向边（Edge），用无序偶对(vi,vj)来表示。如果图中任意两个顶点之间的边都是无向边，则称该图为无向图（Undirected graphs）。 有向边：若从顶点vi到vj的边有方向，则称这条边为有向边，也称为弧（Arc）。
基于8个网页-相关网页
first search in undirected graphs 无向图中的深度优先搜索
Depth-first search in undirected graphs 无向图中的深度优先搜索
Undirected Graphs Model 基于无向图模型
Kautz undirected graphs Kautz无向图
de Bruijn undirected graphs 无向de
Connected unweighted undirected graphs 无向非加权图
undirected simple graphs 无向简单图
To enumerate all spanning trees in undirected graphs is an important problem that people frequently encounter in the analysis of network and cycle.
求无向图的生成树是在网络和回路分析中经常遇到的重要问题。
The paper presents the method of seeking spanning trees of undirected graphs by adopting calculating trees which is realized by enumerating the difference among spanning trees.
文章描述采用计算树的方法求解无向图的生成树，这种方法是通过列举生成树之间的差别来实现的。
This paper gave a review of recent developments in the study of nullities of undirected simple graphs.
综述无向简单图零度问题近年来所取得的研究进展。
应用推荐