Viterbi算法源程序,注释简洁,利于使用

c++链式队列的实现头文件如下： typedef int Item; typedef struct node * PNode; typedef struct node {  Item data;  PNode next; }Node; typedef struct {  PNode front;  PNode rear;  int size; }Queue; /*构造一个空队列*/ Queue *InitQueue(); /*销毁一个队列*/ void DestroyQueue(Queue *pqueue); /*清空一个队列*/ void ClearQueue(Queue *pqueue); /*判断队列是否为空*/ int IsEmpty(Queue *pqueue); /*返回队列大小*/ int GetSize(Queue *pqueue); /*返回队头元素*/ PNode GetFront(Queue *pqueue,Item *pitem); /*返回队尾元素*/ PNode GetRear(Queue *pqueue,Item *pitem); /*将新元素入队*/ PNode EnQueue(Queue *pqueue,Item item); /*队头元素出队*/ PNode DeQueue(Queue *pqueue,Item *pitem); /*遍历队列并对各数据项调用visit函数*/ void QueueTraverse(Queue *pqueue,void (*visit)());

数据结构：链表程序-data structure : procedures Chain

旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.

一个很好的进销存系统源码-a good source of Invoicing System

学生信息管理系统，书上的源代码。比较简单，可以供学习参考用。-Student Information Management System, the book" s source code. Relatively simple, can be used for study and reference.

数据结构的课程设计，是实现二叉树的数据结构，包括文档。-Data structures course design is to achieve binary tree data structure, including the documentation.

c++写的一个关于数据结构的程序,其中包含了硬币的分法等算法,相信会给喜欢数据结构的朋友带来帮助!-c write a data structure for the procedure, which includes a coin-law algorithm, would like to believe that the data structure to help bring friends!

实现哈夫曼编码译码，可以实现，本实验可以实现编码，译码，打印哈夫曼数，等-There is a chance to appreciate different ways of life.

We discussed two versions of the 3-sum problem: A "naive" implementation (O(N^3)) and a "sophisticated" implementation (O(N^2 lg N)). Implement these algorithms.  Your implementation should be able to read data in from regular data/text file with each entry on a separate line.

使用ADO进行联接数据据的类封装。可以很便利地实现数据库的读写查。