[Data structures]Create binary tree by sequence
#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
[Data structures]Backtrack
#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
[Data structures]Huffman
#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
[Data structures]Merge forest set
#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
[Data structures]Threaded binary tree
#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
[Data structures]Traversing binary tree
#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
[Data structures]Floyd
#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
[Data structures]Dijkstra
#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
[Data structures]Critical path (Active on edge)
#include <stdio.h> #include <stdlib.h> #define MAX 20 #define INFINIT 65535 typedef struct _ArcCell{ int adj; // Weight or flag about connection int *info; // Other information }ArcCell; typedef char VertexType; typedef enum{ DG, DN, UDG, UDN }GraphKind; ty...标签: Data Structures data_structures
[Data structures]Topological sort
#include <stdio.h> #include <stdlib.h> #define MAX 20 #define INFINIT 65535 typedef struct _ArcCell{ int adj; // Weight or flag about connection int *info; // Other information }ArcCell; typedef char VertexType; typedef enum{ DG, DN, UDG, UDN }GraphKind; ty...日历
最新微语
- 有的时候，会站在分叉路口，不知道向左还是右
2023-12-26 15:34
- 繁花乱开，鸟雀逐风。心自宁静，纷扰不闻。
2023-03-14 09:56
- 对于不可控的事，我们保持乐观，对于可控的事情，我们保持谨慎。
2023-02-09 11:03
- 小时候，
暑假意味着无忧无虑地玩很长一段时间，
节假意味着好吃好喝还有很多长期不见的小朋友来玩...
长大后，
这是女儿第一个暑假，
一个半月...
2022-07-11 08:54
- Watching the autumn leaves falling as you grow older together
2018-10-25 09:45
分类
最新评论
- Goonog
i get it now :) - 萧
@Fluzak：The web host... - Fluzak
Nice blog here! Also... - Albertarive
In my opinion you co... - ChesterHep
What does it plan? - ChesterHep
No, opposite. - mojoheadz
Everything is OK!... - Josephmaigh
I just want to say t... - ChesterHep
What good topic - AnthonyBub
Certainly, never it ...