WINAPI阶段练习01
#pragma comment(linker,"/subsystem:windows")#define WINVER 0x0500#define _WIN32_WINNT 0x0500#include <windows.h>#define VK_X 0x58LPCTSTR lpszAppName = TEXT("Haroldi"),lpszTitle = TEXT("阶段练习");//==========================================================LRESULT CALLBACK WndProc(HWND,UINT,WPARAM,LPA...
[原创]有向图转换&遍历&拓扑&最短路径
http://bbs.bc-cn.net/dispbbs.asp?boardID=179&ID=130955&page=1
[原创]无向图转换&遍历&MST
请多多指教...
http://bbs.bc-cn.net/dispbbs.asp?boardID=179&ID=129767&page=1
[原创] Huffman编码生成程序
#include <stdio.h>#include <stdlib.h>#define MaxSize 50typedef struct{ char c; //代码; int w; //代码权值; char code[MaxSize]; //代码的Huffman编码; }HuffCode[MaxSize];typedef struct{ int Weight; //权值; int LChild,RChild,Parent; }HTNode,HuffTree[MaxSize];//==...
[原创]非递归遍历输入/出二叉树
//非递归方式建树，并按任一种非递归遍历次序输出二叉树中的所有结点；#include <stdio.h>#include <stdlib.h>#include <malloc.h>#define MaxSize 50typedef char ElemType;typedef struct TNode{ ElemType data; struct TNode *lchild,*rchild; }BTree;//------------------------------------------------------------------------------
...
[原创]Joseph(约瑟夫环)
......typedef int ElemType;typedef struct LNode{ ElemType data; struct LNode *next; }LinkList;......//-------------------------------------------------------------------------------------int main(void){ int n,s,m; LinkList *sa = NULL; printf("\t<<<<<约瑟夫问题求解>>>>>\n输入人...
最新评论