苗火 Nicholas

[Data structures]Orthogonal link

2019-8-19 萧 写技术

#include <stdio.h> #include <stdlib.h> #define MAX 1024 typedef struct _OLNode{ int i,j; int e; struct _OLNode *right, *down; }OLNode; typedef struct _CrossList{ OLNode **rhead; OLNode **chead; int m,n,t; //m rows, n cols, t none zero }CrossList; int CreateMatr...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(3)

[Data structures]Triple sequential matrix

2019-8-19 萧 写技术

#include <stdio.h> #include <stdlib.h> #define MAX 1024 typedef struct _Triple{ int i,j; int e; }Triple; typedef struct _TSMatrix{ Triple data[MAX+1]; int rpos[MAX+1]; //Sequential table of row logical link int m,n,t; //m rows, n cols, t none zero }TSMatrix; void...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(2)

[Data structures]Create binary tree by sequence

2019-8-8 萧 写技术

#include <stdio.h> #include <stdlib.h> #define MAX 20 typedef struct _BiTree{ char data; struct _BiTree *left; struct _BiTree *right; }BiTree; void CreateByPreInOrder(BiTree **T, char *pre, int pre_begin, int pre_end, char *in, int in_begin, int in_end) { int len; i...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(11)

[Data structures]Backtrack

2019-8-8 萧 写技术

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 20 #define INFINIT 65535 int k; void GetPowerSet(int i, int *A, int *B) { int x; int j; if(i>A[0]){ for(j=1; j<=B[0]; j++){ printf("%d", B[j]); } printf("\n"); }else{ x ...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(9)

[Data structures]Huffman

2019-8-7 萧 写技术

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 20 #define INFINIT 65535 typedef struct _HTNode{ int weight; int parent; int left; int right; }HTNode; void HuffmanCoding(HTNode **HT, char ***HC, int *w, int n) { int i; int m; int m...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(18)

[Data structures]Merge forest set

2019-8-5 萧 写技术

#include <stdio.h> #include <stdlib.h> #define MAX 20 typedef struct _PTreeNode{ int data; int parent; }PTreeNode; typedef struct _PTree{ PTreeNode nodes[MAX]; int n; }PTree; int find_mfset(PTree *S, int i) { int j,k,t; if(i<1 || i>S->n){ return -1...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(19)

[Data structures]Threaded binary tree

2019-8-2 萧 写技术

#include <stdio.h> #include <stdlib.h> #define MAX 20 typedef struct _BiTree{ char data; struct _BiTree *left; struct _BiTree *right; int lTag; int rTag; }BiTree; BiTree *pre; int PreOrderTraverseCreate(BiTree **T) { char c; scanf(" %c",&c); printf(" %...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(14)

[Data structures]Traversing binary tree

2019-7-31 萧 写技术

#include <stdio.h> #include <stdlib.h> #define MAX 20 typedef struct _BiTree{ char data; struct _BiTree *left; struct _BiTree *right; }BiTree; int PreOrderTraverseCreate(BiTree **T) { char c; scanf(" %c",&c); printf(" %c", c); if(c == '$'){ *T = NULL; ...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(16)

[Data structures]Floyd

2019-7-30 萧 写技术

#include <stdio.h> #include <stdlib.h> #define MAX 20 #define INFINIT 65535 typedef struct _MGraph{ char vexs[MAX]; int arcs[MAX][MAX]; int vexnum; int arcnum; }MGraph; int visited[MAX]; int LocateVex(MGraph *G, char v) { int i=0; while(i<G->vexnum &...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(15)

[Data structures]Dijkstra

2019-7-30 萧 写技术

#include <stdio.h> #include <stdlib.h> #define MAX 20 #define INFINIT 65535 typedef struct _MGraph{ char vexs[MAX]; int arcs[MAX][MAX]; int vexnum; int arcnum; }MGraph; int visited[MAX]; int LocateVex(MGraph *G, char v) { int i=0; while(i<G->vexnum &...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(29)