Improving Programming Education Based on Programming Contest Problems: The Algorithm Implementation for the Constructive Proof of Euler Graph

“Set and Graph Theory” is the theoretical foundation for computer science and technology. We construct joint experimental curriculums for set and graph theory and programming curriculums based on programming contest problems, to improve students’ skills solving problems by programming and comprehensively applying knowledge. The paper specifies a joint experimental curriculum for set and graph theory and data structure “the algorithm implementation for the constructive proof of Euler graph”. A programming contest problem solving Eulerian circuit and its analysis constitute the experiment. Students are required to finish the constructive proof of Euler graph based on DFS, and realize the proof is the algorithm finding the Eulerian circuit. Solving the problem by programming requires students to comprehensively apply DFS, Union-Find Set used to determine graph connectivity, graph modeling, and so on.