非主割边与次连通性在寻求欧拉路中的应用

The Application of Non-principal Cut-edge and Secondary Connectivity is Seeking Euler's Paths

运用图论中无向图的割边与连通性的理论 ,阐述无向图的主割边与次连通性的概念 ,推导出若干有关性质 ,并给出一种在无向图中寻求一条欧拉路的有效方法取非主割边法 .

Applying the theory of the cut edge and connectivity concerning non directed graph in the graph theory,this paper deals with the concept of the principal cut edge and secondary connectivity,derives several related properties,and puts forward an effective method to seek systematically a Eulers path from the non directed praph the method of non principal cut edge.