TSP - DFS
#include #include #include #include using namespace std; #define MAX 150 typedef struct Vertex* Vertex_Pointer; int Top = -1; struct Vertex { double x, y; double distance; int dept; int check[10]; Vertex_Pointer link; }; Vertex_Pointer Stack[MAX]; void Stack_push(Vertex_Pointer input) { if(Top == MAX - 1){ cout
-
- 꼬반
- 2009. 4. 19. 20:53
TSP - Recursion
#include #include #include #include #include #include #define MAX 150 int *xpoint; int *ypoint; int vertex, s = 1; int point, depth = 0; float during_t; LARGE_INTEGER frequency, start_t, finish_t; void greedy(int a); int way(int b); void main() { int i = 0; int txp = 0, typ = 0; printf("number of vertexies ? : "); scanf("%d", &vertex); xpoint = (int*)malloc(vertex); ypoint = (int*)malloc(vertex)..
-
- 꼬반
- 2009. 4. 19. 20:52
TSP - Greedy
#include #include #include #include #include #include #define MAX 150 int *xpoint; int *ypoint; int vertex, s = 1; int point, depth = 0; float during_t; LARGE_INTEGER frequency, start_t, finish_t; void greedy(int a); int way(int b); void main() { int i = 0; int txp = 0, typ = 0; printf("number of vertexies ? : "); scanf("%d", &vertex); xpoint = (int*)malloc(vertex); ypoint = (int*)malloc(vertex)..
-
- 꼬반
- 2009. 4. 19. 20:52
간단 그리드 알고리즘
#include #include #define CA 500 #define CB 100 #define CC 50 #define CD 10 #define CLK_TCK 1000 void count(int c, int b); void main() { long start, stop; float time; int charge, bcharge; printf("금액 설정 : "); scanf("%d",&charge); printf("사용할 금액은 : "); scanf("%d",&bcharge); start = GetTickCount(); count(charge, bcharge); stop = GetTickCount(); time = (float)(stop-start)/CLK_TCK; printf("TIME : %f ..
-
- 꼬반
- 2009. 3. 17. 16:33
그리드 실행시간 구하기 포함버젼.
#include #include #define MAX 150 #define CA 500 #define CB 100 #define CC 50 #define CD 10 #define CLK_TCK 1000 int queue1[MAX]; // 잔액 int queue2[MAX]; // 500원 int queue3[MAX]; // 100원 int queue4[MAX]; // 50원 int queue5[MAX]; // 10원 void add2(int x2, int y2); void add3(int x3, int y3); void add4(int x4, int y4); void add5(int x5, int y5); void del(); void greedy(int c1, int c2); void makenode()..
-
- 꼬반
- 2009. 3. 17. 16:28