window.cpp

校园导游图算法--数据结构中有关图的算法 按v求最短路径 按s求信息； 按q退出； 地图在map图像文件里

#include<conio.h>
#include<stdio.h>
#define LEFT 2
#define TOP 2
#define RIGHT 78
#define BOTTOM 25
void DRAW_WIN(int LEFT_X,int LEDT_Y,int RIGHT_X,int RIGHT_Y);
void main()
{
	int NUM;
	clrscr();
	DRAW_WIN(LEFT-1,TOP-1,RIGHT-1,BOTTOM-1);
	window(LEFT,TOP,RIGHT,BOTTOM);
	gotoxy(5,3);
	textcolor(YELLOW);
	cprintf("**************** WELCOM TO THE GRAPHIC TEST PROGRA ****************");
	gotoxy(5,4);
	cprintf("*    Scenic Information-s       Visited Path-v         Quit-q     *");
	gotoxy(5,5);
	cprintf("*******************************************************************");
	gotoxy(5,20);
	cprintf("*******************************************************************");
	gotoxy(5,21);
	cprintf("*    Enter a operation code: s/S,v/V or q/Q    Help/H             *");
	gotoxy(5,22);
	textcolor(YELLOW);
	//textbackground(LIGHTGRAY);
	cprintf("**************THANK YOU USING FOR USING THIS SYSTEM****************");
	gotoxy(10,15);
	cprintf("Operation:");
	gotoxy(20,15);
	getch();

}
void DRAW_WIN(int LEFT_X,int LEFT_Y,int RIGHT_X,int RIGHT_Y)
{
	int NUM;
	gotoxy(LEFT,TOP);
	printf("\xda");
	for(NUM=LEFT+1;NUM<RIGHT;NUM++)
		printf("\xc4");
	printf("\xbf");
	gotoxy(RIGHT,TOP+1);
	for(NUM=TOP+1;NUM<BOTTOM;NUM++)
	{
		printf("\xd8");
		gotoxy(RIGHT,NUM+1);
	}
	gotoxy(RIGHT,BOTTOM);
	printf("\xd9");
	gotoxy(LEFT+1,BOTTOM);
	for(NUM=LEFT+1;NUM<RIGHT;NUM++)
		printf("\xc4");
	gotoxy(LEFT,BOTTOM);
	printf("\xc0");
	gotoxy(LEFT,TOP+1);
	for(NUM=TOP+1;NUM<BOTTOM;NUM++)
	{
		printf("\xd8");
		gotoxy(LEFT,NUM+1);
	}
}