(Official C/C development engineer (1090119), please enter your ID for verification. The key to the program is to determine whether the two pictures that the user clicks continuously can be eliminated. There are two conditions that two images can be eliminated: ①. The images are the same ②. The number of corners of the connection between the images must not exceed 2. There are two algorithms for judging whether a path less than two corners can be connected: ①. Classification and discrimination ②. Breadth-first search based on the number of corners This document includes the following attachments:
Lianliankan source code\Debug\BuildLog.htm
Lianliankan source code\Debug\findpath.obj
Lianliankan source code\Debug\StdAfx.obj
Lianliankan source code\Debug\vc80.idb
Lianliankan source code\Debug\vc80.pdb
Lianliankan source code\Debug\zg1.exe.embed.manifest
Lianliankan source code\Debug\zg1.obj
Lianliankan source code\Debug\zg1.pch
Lianliankan source code\res\icon1.ico
Lianliankan source code\res\zg1.ico
Lianliankan source code\res\zg1.rc2
Lianliankan source code\findpath.cpp
Lianliankan source code\findpath.h
Lianliankan source code\ReadMe.txt
Lianliankan source code\Resource.h
Lianliankan source code\StdAfx.cpp
Lianliankan source code\StdAfx.h
Lianliankan source code\zg1.aps
Lianliankan source code\zg1.cpp
Lianliankan source code\zg1.dsp
Lianliankan source code\zg1.dsw
Lianliankan source code\zg1.h
Lianliankan source code\zg1.ncb
Lianliankan source code\zg1.rc
Lianliankan source code\zg1.sln
Lianliankan source code\zg1.suo
Lianliankan source code\zg1.vcproj
Lianliankan source code\zg1.vcproj.SWPU-KEVINVIVI.Kevin.user
Lianliankan source code\zg1Dlg.cpp
Lianliankan source code\zg1Dlg.h
.....)
收藏
