resource.h

演示一个寻找最短路径的算法。

//{{NO_DEPENDENCIES}}
// Microsoft Developer Studio generated include file.
// Used by Test6.rc
//
#define IDD_ABOUTBOX                    100
#define ID_INFORMATION                  101
#define IDR_MAINFRAME                   128
#define IDR_TEST6TYPE                   129
#define IDR_MAINFRAME1                  129
#define IDD_CHANGEMAP_DLG               131
#define IDC_MAP_WIDTH                   1000
#define IDC_MAP_HEIGHT                  1001
#define ID_BLACK                        32771
#define ID_REFRESH                      32772
#define ID_CHANGEMAP                    32773
#define ID_START_POINT                  32774
#define ID_END_POINT                    32775
#define ID_GO                           32776
#define ID_NEW_MAP                      32777
#define ID_OPEN_MAP                     32778
#define ID_SAVE_MAP                     32779
#define ID_SAVE_MAP_AS                  32780

// Next default values for new objects
// 
#ifdef APSTUDIO_INVOKED
#ifndef APSTUDIO_READONLY_SYMBOLS
#define _APS_3D_CONTROLS                     1
#define _APS_NEXT_RESOURCE_VALUE        132
#define _APS_NEXT_COMMAND_VALUE         32781
#define _APS_NEXT_CONTROL_VALUE         1001
#define _APS_NEXT_SYMED_VALUE           102
#endif
#endif