摘要
文章就图的连通性的判断、欧拉回路的判断及求解的C语言编程实现进行深入细致的探讨,以期通过该算法来进一步了解图论的基础知识和C语言算法编译的基本技巧,从而使离散数学能尽早地与计算机算法统一起来。
The paper intensively approaches the estimation of algorithm of the Graphic connectivity,Eulerian Circuit and C-program, in the hope .through the algorithm, to have a further understanding of the basic knowledge of graph theory and of the basic compiling skills of C - program , thereby to integrate the Discrete Mathematics with the computer algorithm at the earliest opportunity.
