typedef int type;

typedef struct GRAPH{
	int vertices;	
	int** matrix;
	int* visited;
}GRAPH;

GRAPH* createGraph(int vertices, int** nmatrix){
	GRAPH* newGraph = (GRAPH*) malloc(sizeof(GRAPH));
	newGraph->vertices = vertices;
	newGraph->matrix = nmatrix;
	newGraph->visited = (int*) malloc(sizeof(int)*vertices);
	for(int i=0; i<vertices; i++){
		newGraph->visited[i] = 0;
	}
	return newGraph;

}

void resetVisited(GRAPH* g){
	for(int i=0; i<g->vertices; i++){
		g->visited[i]=0;
	}
}

void DFS(GRAPH* g, int vertex){

}

typedef struct NODE{
	int data;
	NODE* next;
};

typedef struct QUEUE{
	int size;
	NODE* head;
};

void MakeEmptyQueue(QUEUE* q){
	q->size = 0;
	q->head = NULL;
}

bool IsEmptyQueue(QUEUE* q){
	return q->size==0;
}

void Enqueue(QUEUE* q, int x){
	NODE* tmp = q->head;
	NODE* newNode = (NODE*) malloc(sizeof(NODE));
	newNode->data = x;
	newNode->next = NULL;
	if(IsEmptyQueue(q)) 
		q->head = newNode;
	else {
		while(tmp->next!=NULL){
			tmp = tmp->next;
		}
		tmp->next = newNode;
	}
	q->size++;
}

int Dequeue(QUEUE* q){
	NODE* tmp = q->head;
	int result=-1;
	if(!IsEmptyQueue(q)){
		result = tmp->data;
		q->head = q->head->next;
		free(tmp);
		q->size--;
	}
	return result;
}

void PrintQueue(QUEUE* q){
	NODE* tmp = q->head;
	for(int i=0; i<q->size; i++){
		printf("%d ", tmp->data);
		tmp = tmp->next;
	}
	printf("\n");
}

void BFS(GRAPH* g, int vertex){

}

int main(int argc, char* argv[]) {
	int vertices = 8;
	int** neighbors = (int**) malloc(sizeof(int)*vertices);
	for(int i=0; i<vertices; i++){
		neighbors[i] = (int*) malloc(sizeof(int)*vertices);
	}

	neighbors[0][0] = 0; //A-A
	neighbors[0][1] = 0; //A-B
	neighbors[0][2] = 0; //A-C
	neighbors[0][3] = 1; //A-D
	neighbors[0][4] = 0; //A-E
	neighbors[0][5] = 0; //A-F
	neighbors[0][6] = 0; //A-G
	neighbors[0][7] = 0; //A-H

	neighbors[1][0] = 0; //B-A
	neighbors[1][1] = 0; //B-B
	neighbors[1][2] = 1; //B-C
	neighbors[1][3] = 0; //B-D
	neighbors[1][4] = 0; //B-E
	neighbors[1][5] = 0; //B-F
	neighbors[1][6] = 0; //B-G
	neighbors[1][7] = 0; //B-H

	neighbors[2][0] = 0; //C-A
	neighbors[2][1] = 1; //C-B
	neighbors[2][2] = 0; //C-C
	neighbors[2][3] = 1; //C-D
	neighbors[2][4] = 0; //C-E
	neighbors[2][5] = 0; //C-F
	neighbors[2][6] = 0; //C-G
	neighbors[2][7] = 0; //C-H

	neighbors[3][0] = 1; //D-A
	neighbors[3][1] = 0; //D-B
	neighbors[3][2] = 1; //D-C
	neighbors[3][3] = 0; //D-D
	neighbors[3][4] = 1; //D-E
	neighbors[3][5] = 1; //D-F
	neighbors[3][6] = 1; //D-G
	neighbors[3][7] = 0; //D-H

	neighbors[4][0] = 0; //E-A
	neighbors[4][1] = 0; //E-B
	neighbors[4][2] = 0; //E-C
	neighbors[4][3] = 1; //E-D
	neighbors[4][4] = 0; //E-E
	neighbors[4][5] = 1; //E-F
	neighbors[4][6] = 0; //E-G
	neighbors[4][7] = 0; //E-H

	neighbors[5][0] = 0; //F-A
	neighbors[5][1] = 0; //F-B
	neighbors[5][2] = 0; //F-C
	neighbors[5][3] = 1; //F-D
	neighbors[5][4] = 1; //F-E
	neighbors[5][5] = 0; //F-F
	neighbors[5][6] = 0; //F-G
	neighbors[5][7] = 0; //F-H

	neighbors[6][0] = 0; //G-A
	neighbors[6][1] = 0; //G-B
	neighbors[6][2] = 0; //G-C
	neighbors[6][3] = 1; //G-D
	neighbors[6][4] = 0; //G-E
	neighbors[6][5] = 0; //G-F
	neighbors[6][6] = 0; //G-G
	neighbors[6][7] = 1; //G-H

	neighbors[7][0] = 0; //H-A
	neighbors[7][1] = 0; //H-B
	neighbors[7][2] = 0; //H-C
	neighbors[7][3] = 0; //H-D
	neighbors[7][4] = 0; //H-E
	neighbors[7][5] = 0; //H-F
	neighbors[7][6] = 1; //H-G
	neighbors[7][7] = 0; //H-H

	GRAPH* graph = createGraph(8, neighbors);

	//DFS(graph, 3);

	resetVisited(graph);

	//BFS(graph, 3);

	return 0;
}