在无向图中,关联一对顶点的无向边如果多于1条,则称这些边为平行边,平行边的条数称为重数。在有向图中,关联一对顶点的有向边如果多于1条,并且这些边的始点与终点相同(也就是它们的的方向相同),称这些边为平行边。含平行边的图称为多重图,既不含平行边也不包含自环的图称为简单图。
Let Kv be the complete graph with v vertices and G be a finite simple graph.
设K_v是一个v点完全图。 G是一个有限简单图。
参考来源 - 完备图K·2,447,543篇论文数据,部分数据来源于NoteExpress
凡是不包含环和多重边的图被称为简单图。
Graphs containing no loops or multiple edges will be referred to as simple graphs.
综述无向简单图零度问题近年来所取得的研究进展。
This paper gave a review of recent developments in the study of nullities of undirected simple graphs.
简单图遍历算法已经非常成熟,但是还没有完善的冗余拓扑图遍历算法。
The traversing algorithm for the simple graph has been researched for many years and lots of mature algorithms are developed.
Let me draw a quick picture in chalk here.
我用粉笔画一个简单的图。
Let's draw a little picture on the side here.
我们在边上简单地画个图来看看吧
Easier picture than the one we constructed last time.
这比上一讲的图要简单
应用推荐