DIJKSTRA算法实现的最短路径程序linjiebiaoshortpath

单循环链表，用C++实现 提供入队，出队，判断空等方法(Single cycle linked list, with C++ into the team, the team judge waited in vain for methods)

以太网首部的一个c语言程序，代码功能是对设备要传送的帧进行排队(Ethernet header c language program code function is queued frames to be transferred to the device)

说明：  离散随机线性系统的卡尔曼滤波。 其中13lman.c是卡尔曼滤波函数，4rinv.c是滤波函数中用到的矩阵求逆函数，13lman0.c是主程序。(discrete stochastic linear Kalman filtering system. 13lman.c which is the Kalman filter function, 4rinv.c filtering function is used in the matrix inversion function, is the main program 13lman0.c.)

the longest common serials

多段图、遍历、排序。用C语言解决多段图中的成本问题，得出最佳优化方案。(More paragraphs figure, traverse, ranking. C language solve more paragraphs in the chart the cost, obtains the best optimization scheme. )

说明：  数据结构中的顺序表，是其中的一个重要组成部分(The order of the table data structure is an important component of which)

斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。(Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.)

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)

用c++实现的haffman tree 小程序，仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)

采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values ​ ​ adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)