graph.h

#ifndef		GRAPH_H
#define		GRAPH_H

#include	<iostream>
#include	<cmath>
using namespace std;

const int UNVISITED = 0;
const int VISITED = 1;

class Edge {
public:
	int from; 	//edge start point
	int to; 	//edge end point
	int weight;	//edge weight
	
	Edge() {
		from = to = -1; 
		weight = 0;
	}

	Edge(int f, int t, int w) {
		from = f;
		to = t;
		weight = w;
	}

	void print() {
		cout<<"E"<<from<<"->"<<to<<"    weight: "<<weight<<endl;
	}	
};

class Graph {
public:
	int numVertex;	// vertexs of graph
	int numEdge;	// edges of graph
	int *Mark; 		// to sign vertex whether be visited
	int *Indegree;	// indegree of vertex
	
	Graph(int numVert) {
		numVertex = numVert;
		numEdge = 0;
		Indegree = new int[numVertex];
		Mark = new int[numVertex];
		
		for (int i = 0; i < numVertex; i++) {
			Mark[i] = UNVISITED;
			Indegree[i] = 0;
		}
	}

	~Graph() {
		delete []Mark;
		delete []Indegree;
	}

	bool isEdge(Edge oneEdge) {
		if (oneEdge.weight > 0 && oneEdge.weight < INFINITY && oneEdge.to >= 0) 
			return true;
		else
			return false;
	}
};

#endif	

#include "graphics.h" #include "stdio.h" #include "dos.h" #include "conio.h" #include "bios.h" #include "stdlib.h" #include "math.h" #ifdef __cplusplus #define __CPPARGS ... #else #define __CPPARGS #endif #define VK_LEFT 0x4b00 #define VK_RIGHT 0x4d00 #define VK_DOWN 0x5000 #define VK_UP 0x4800 #define VK_HOME 0x4700 #define VK_END 0x4f00 #define VK_SPACE 0x3920 #define VK_ESC 0x011b #define VK_ENTER 0x1c0d #define VK_PGUP 0x4900 #define VK_PGDOWN 0x5100 #define TIMER 0x1c void drawblock(int,int,int); void nedr(void); void fk(int,int,int,int); void rewr(int,int,int,int); void rrwf(int,int); int is_bd(int,int,int); int is_line(void); void interrupt ( *oldhandler)(__CPPARGS); void KillTimer(void); void SetTimer(void interrupt (*IntProc)(__CPPARGS)); void rscore(int); int fkt[]={0,4,8,12,14,16,18}; int cj[]={0,100,300,900,1500}; long grc[]={0,3000,60000,90000,120000,150000,180000,210000,240000,270000}; int cjb[]={0,0,0,0,0,0,0,0,0,0}; char cjc[]="score: 0"; char grad[]="grade:0"; struct shape { short xy[8]; short color; short next; }; struct shape shapes[19]= { /* {x1,y1,x2,y3,x3,y3,x4,y4,color,next} */ {1,1,2,1,3,1,3,2,LIGHTBLUE,1}, /* □□□□ */ {2,2,3,0,3,1,3,2,LIGHTBLUE,1}, /* □■□□ */ {1,1,1,2,2,2,3,2,LIGHTBLUE,1}, /* □■□□ */ {2,0,2,1,2,2,3,0,LIGHTBLUE,-3}, /* □■■□ */ {1,1,1,2,2,1,3,1,LIGHTCYAN,1}, /* □□□□ */ {2,0,3,0,3,1,3,2,LIGHTCYAN,1}, /* □■■□ */ {1,2,2,2,3,1,3,2,LIGHTCYAN,1}, /* □■□□ */ {2,0,2,1,2,2,3,2,LIGHTCYAN,-3}, /* □■□□ */ {2,1,3,0,3,1,3,2,LIGHTRED,1}, /* □□□□ */ {1,2,2,1,2,2,3,2,LIGHTRED,1}, /* □□□□ */ {1,0,1,1,1,2,2,1,LIGHTRED,1}, /* □■□□ */ {1,0,2,0,2,1,3,0,LIGHTRED,-3}, /* ■■■□ */ {2,1,2,2,3,0,3,1,DARKGRAY,1}, /* □□□□ */ {1,0,2,0,2,1,3,1,DARKGRAY,-1}, /* □□□□ */ /* □■■□ */ /* ■■□□ */ {2,0,2,1,3,1,3,2,MAGENTA,1}, /* □□□□ */ {1,2,2,1,2,2,3,1,MAGENTA,-1}, /* □□□□ */ /* ■■□□ */ /* □■■□ */ {0,1,1,1,2,1,3,1,BROWN,1}, /* □■□□ */ {1,0,1,1,1,2,1,3,BROWN,-1}, /* □■□□ */ /* □■□□ */ /* □■□□ */ {2,1,2,2,3,1,3,2,YELLOW,0}, /* □□□□ */ /* □□□□ */ /* □■■□ */ /* □■■□ */ }; int stx=5,sty=8,sdx=24,sdy=18,shx=7,shy=22,adx=4,ady=1,nexti,TimerCounter=0,grade=0,end=0; unsigned long score=0; short board[25][12]= /* 方块空间表示,1表示有方块 */ { {1,1,1,1,1,1,1,1,1,1,1,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, /* 0 */ {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, /* 5 */ {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, /* 10 */ {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, 赞 0 2005-5-12 15:50 回复 218.85.57.* 2楼 {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, /* 15 */ {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, /* 20 */ }; short colable[25][12]= /* 方块空间颜色,1表示背景色蓝色*/ { {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, /* 0 */ {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, /* 5 */ {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, /* 10 */ {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, /* 15 */ {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,1,1,1,1,1,1,1,1}, /* 20 */ }; void interrupt newhandler(__CPPARGS) /* 新的时钟中断处理函数 */ { TimerCounter++; oldhandler(); } void SetTimer(void interrupt (*IntProc)(__CPPARGS)) /* 设置新的时钟中断 */ { oldhandler=getvect(TIMER); disable(); setvect(TIMER,IntProc); enable(); } void KillTimer() /* 恢复原有的时钟中断处理过程 */ { disable(); setvect(TIMER,oldhandler); enable(); } void rscore(int line) /* 成绩更新函数 */ { int i,j,k=1; unsigned long s,f; score+=cj[line]; setfillstyle(1,GREEN); bar(0,5,150,30); s=score; if(s>=grc[grade]) { grade++; grad[6]=grade+48; bar(180,5,300,30); moveto(200,20); outtext(grad); } for(i=9;i>0;i--) { f=pow(10,i); j=s/f;s=s%f; if((!j)&&k); else k=0,cjc[15-i]=j+48; } moveto(10,20); outtext(cjc); } int is_bd(int x1,int y1,int i) /* 判断是否有方块 */ { int j,x2,y2; for(j=0;j<4;j++) { x2=shapes[i].xy[2*j]; y2=shapes[i].xy[2*j+1]; if(board[x1+x2+adx][y1+y2+ady])return 0; } return 1; } void fk(int re,int x1,int y1,int i) /* 方块的擦除、重写,并判断是否结束 有问题 */ { int j,x2,y2,color; for(j=0;j<4;j++) { x2=shapes[i].xy[2*j]; y2=shapes[i].xy[2*j+1]; if(!re) color=getbkcolor(); else color=shapes[i].color; if(re==2) { if((x1+x2)<=-1) { printf("Game is OVER!"); getch(); end=1; } break; } else { if((x1+x2)<=-1) continue; } board[x1+x2+adx][y1+y2+ady]=re; colable[x1+x2+adx][y1+y2+ady]=color; drawblock(stx+x1+x2,sty+y1+y2,color); } /* getch(); */ } void drawblock(int x,int y,int color) /* 写1个相对单位点的函数 */ { int i,j; for(i=0;i<16;i++) for(j=0;j<16;j++) putpixel(y*16+j,x*16+i,color); } void nedr(void) /* 产生并写下一个方块的函数 */ { int j,x2,y2,i,color; setfillstyle(1,GREEN); nexti=i=random(19); bar(shy*16,shx*16,(shy+4)*16,(shx+4)*16); for(j=0;j4;i--) { for(j=1;j4;i--) for(j=1;j<12;j++) colable[i][j]=colable[i-k][j],board[i][j]=board[i-k][j]; setfillstyle(1,BLUE); bar(sty*16,stx*16,(sdy)*16-1,(sdx+1)*16-1); for(i=5;i<24;i++) for(j=1;j9)) { if(TimerCounter>9)TimerCounter=0; fk(0,x1,y1,i); if(is_bd((k=x1+1),y1,i)) fk(re,x1=k,y1,i); else { fk(re,x1,y1,i); is_line(); fk(2,x1,y1,i); if(end)break; i=nexti;x1=-4;y1=3; fk(re,x1,y1,i); nedr(); } } } KillTimer(); }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值