您要查找的是不是：
- edge connectivity algorithm 边连通度算法
- The cyclic edge connectivity of a graph is the size of a minimum cyclic edge cutset of a graph. 一个图的圈边连通度是指最小圈边割的边数。
- The 2-extra edge connectivity of the hypercubes and the 1-extra edge connectivity and restricted edge connectivity of the folded hypercubes are determined. 摘要确定了立方体的2-超边连通度和折叠立方体的1-超边连通度和限制边连通度。
- Every edge connects a vetex labeled 3 with a vertex labeled 4. 每一条线都联结一个标上3和一个标上4的顶点。
- Every edge connects a vertex labeled 3 with a vertex labeled 4. 每一条线都联结一个标上3和一个标上4的顶点。
- Every edge connects a vetex labeled 3 with a vertex labeled 4 . 每一条线都联结一个标上3和一个标上4的顶点。
- In the meantime, restore and connect broken vacuole nucleuses with approximately nearest connection algorithm. 并用近似最短连接法对破碎的空泡核进行修补连接。
- Restricted Edge Connectivity and Regular Factor 限制边连通度与正则因子
- Linker_Algorithm.rar, the connector algorithm, the programming would like to deepen understanding of the guiding role of the comrades are. 连接器算法，对于想加深编程认识的同志很有指导作用。
- k - restricted edge connectivity k阶限制边连通度
- 1 - restricted edge connectivity 1-限制边连通度
- Method in which each conductive lead on the contact edge connects to one segment or annunciator. 每一个在接触上导电领头的方法边缘连接一部分或者预报信号。
- 3 - restricted edge connectivity 3阶限制边连通度
- Comment: A graph is called BIPARTITE if its vertex can be parted into two parts such that every edge connects one vertex in one part and another vertex in another part. 说明：如果能够把一个图的顶点分成两部分，使得每个边连接的两个点，都必然分别在两个部分中，那么称这个图为“二部图”。
- The factory is situated on the edge of the town. 这座工厂坐落在该城的边上。
- The hotel is situated at the edge of the town. 该饭店坐落于市区的边缘。
- The plates and bowls have a gilt edge. 这些盘子和碗镀有金边。
- He is all on edge to have a look at it. 他急于想看一看那个东西。
- She was a bit on edge till she heard he was safe. 她听到他安然无恙才放下心来。
- John ran to the edge of the lake and plunged in. 约翰跑到湖边，跑进了水里。
