|
MAZE 확장[자료구조/자료구조및실험/c언어/c#/ Maze problem/Maze/Maze problem/미로/미로찾기]
|
|
|
|
mazeeasy.c
#include <stdio.h>
#include <stdlib.h>
#define Last_ver 12
#define Last_hor 15
#define Max_SIZE 180
typedef struct{
int ver;
int hor;
int num;} sect;
int maze[14][17] = {
{1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{1,0,1,0,0,0,1,1,0,0,0,1,1,1,1,1,1},
{1,1,
|
|
|
|
// Maze
#include<stdio.h>
#define MAX_ROW 20
#define MAX_COL 20
#define MAX_STACK_SIZE (MAX_ROW*MAX_COL)
#define FALSE 0 // FALSE의 초기화
#define TRUE 1 // TRUE의 초기화
#define Empty -1
#define North 0
#define East 2
typedef struct{
int eRow;
int eCol;
int eDir;
}eleme
|
|
|
|
.....
2) stack: stack.h
typedef struct {
int x;
int y;
} data;
typedef struct stackNode{
data data;
stackNode* link;
} stackNode;
stackNode* top; //top pointer
void init()//initializing stack
bool isEmpty() // check if it is empty or not
void push(data td)
data pop()//
|
|
|
|
- Recursion
5주 - Sorting Performance analysis
6주 - Exercising Array
7주 - Evaluation of Expression
8주 - Circular Queue & Maze
9주 - Stack & Queue using Linked list
10주 - Equivalenece Class
11주 - Binary Search Tree
12주 - Priority Queue
13주 - Selection Tree
14주 - Union-Find Algorithm
|
|
메뉴펼치기
