[数据结构] DataStructures-Assignment-5
从逗号分隔的值列表中读取事故报告，创建二进制搜索树的数组列表，其中每个树都填充与发生位置的匹配状态的事故。
Reads accident reports from a comma-separated values list, creating an array list of Binary Search Trees, with each tree being filled with accidents of matching state where they occured. (2024-03-05, Java, 0KB, 下载0次)
[数据结构] RouteBoustrophedonCipher
路由路由器路由器，，
RouteBoustrophedonCipher,, (2023-10-08, Python, 0KB, 下载0次)
[数据结构] nuclei
评估核结构数据（ENSDF）解析器、查看器和编辑器
An Evaluated Nuclear Structure Data (ENSDF) parser, viewer and editor (2023-06-17, C++, 0KB, 下载0次)
[数据结构] 简易计算器
简易计算器（栈），可实现+，-，*，/，^,%等运算
Clean Calculator Beta (2019-06-02, C/C++, 51KB, 下载0次)
[数据结构] 范式计算器
范式计算器应用程序，其中包含开发文档，有代码说明
Normal Calculator.exe
And Introduction file inside (2019-01-03, C/C++, 656KB, 下载0次)
[数据结构] 哈夫曼编码器，译码器问题
完成哈夫曼编码，译码问题，用C语言实现编码器，译码器的功能。
Complete the Hoffman code, decoding the problem, using the C language to implement the encoder, decoder functions. (2018-03-13, C/C++, 307KB, 下载1次)
[数据结构] Bellman-Ford-queue-optimization
Bellman-Ford算法关键之处在于：只有那些在前一遍松弛中改变了最短路程估计值的顶点，才能引起它们邻接点最短路程估计值发生改变。
Bellman-Ford algorithm that crucial point: Only those former slack again changed the vertex shortest distance estimates, causing their neighbors to the shortest distance estimates change. (2015-11-09, C/C++, 1KB, 下载1次)
[数据结构] sxdicss
Inclan和Tiao(1994) 提出的迭代累积平方和算法（ICSS）是对变点检验的一种比较成熟方法。该算法假定时间序列在开始一段时间内呈现出平稳性方差，直到方差发生突变才会改变其波动水平，随后又保持一个方差直到下一个突变反复重复上述过程，就能得到未知数目的方差突变时间。
break point (2013-09-27, matlab, 1KB, 下载41次)
[数据结构] BANK
银行家算法 设计程序模拟预防进程死锁的银行家算法的工作过程。假设系统中有n个进程P1, … ,Pn，有m类可分配的资源R1, … ,Rm，在T0时刻，进程Pi分配到的j类资源为Allocationij个，它还需要j类资源Need ij个，系统目前剩余j类资源Workj个，现采用银行家算法进行进程资源分配预防死锁的发生
Banker (2011-06-01, Visual C++, 1KB, 下载3次)
[数据结构] FIRc
FIR低通滤波器C语言实现,FIR低通滤波器C语言实现，FIR低通滤波器C语言实现
FIR low-pass filter C language, FIR low-pass filter C language, FIR low-pass filter C language (2010-11-07, Visual C++, 29KB, 下载33次)
[数据结构] code
(1) 生成n个[0,65535]以内的整数随机数，存入文本文件；
(2) 将n个随机数从小到大排序，并显示结果。排序采用k桶法
(3)用函数编制混合同余的伪随机数发生器
(1) generate n-[0,65535] integer random number within, into a text file (2) n random numbers from small to large order, and displays the results. Sort by k Bucket (3) the preparation of mixed-use functions with more than a pseudo-random number generator (2010-07-31, C/C++, 71KB, 下载13次)
[数据结构] KMP-nextval
KMP算法是通过分析子串，预先计算每个位置发生不匹配的时候，所需GOTO的下一个比较位置，整理出来一个next数组，然后再上面的算法中使用。
KMP algorithm is by analyzing the sub-string, place pre-calculated for each location does not match the time required to compare the next GOTO location, sorted out a next array, and then use the above algorithm. (2010-05-12, C/C++, 1KB, 下载1次)
[数据结构] huffman
哈弗曼编码器，含有完整源码。文件的输入与输出。
Havermann encoder, includes full source code. File input and output. (2009-12-28, Visual C++, 957KB, 下载13次)
[数据结构] SimpleCalcMFC
MFC计算器。用堆栈实现，可以进行含括号的四则运算。
MFC calculator. Implementate With the stack. Can be carried out with the four fundamental operations in parentheses. (2009-12-05, Visual C++, 11919KB, 下载468次)
[数据结构] hash
查找： 建立一个哈希查找表，哈希函数采用: H(key)= key P(其中P=13)，若发生冲突后,用链地址法解决冲突。
Search: the creation of a hash lookup table, the use of hash function: H (key) = key P (of which P = 13), if the occurrence of post-conflict, and conflict resolution chain address law. (2009-06-17, C/C++, 69KB, 下载51次)
[数据结构] adfsdfasd
解码器，播放器，VC，网络通讯
Decoder, the player, VC, network communications (2009-01-12, Visual C++, 133KB, 下载2次)
[数据结构] jisuanqi
计算器程序，c++语言实现，利用栈，可执行复杂的4则运算如8-1+(2-1)*9/3,vc++6编译通过
Calculator program, c++ Language, using the stack, executable complex such as the four computing 8-1+ (2-1)* 9/3, vc++ 6 compiler through (2008-07-09, Visual C++, 384KB, 下载21次)
[数据结构] notch_filter
陷波滤波器（notch filter）算法说明和设计过程，并给出了MATLAB的实现。一个非常好的例程，经过了仔细测试！
Notch Filter (notch filter) algorithm description and design process, given the realization of MATLAB. A very good routines, after careful testing! (2006-07-02, matlab, 15KB, 下载2115次)
[数据结构] 关键路径
(1)输入E条弧<j,k>,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1<=i<=n-1).如果得到的拓朴有序序列中顶点个数小于网中顶点数n,则说明网中存在环,不能求关键路径,算法终止 否则执行步骤(3)(3)从汇点v出发,令vl[n-1]=ve[n-1],按逆拓朴排序求其余各顶点的最迟发生时间vl[i](n-2>=i>=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.
(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time of l (s). If any meet the conditions of the arc e (s) = l (s), was critical activities. (2005-04-14, C/C++, 2KB, 下载62次)
[数据结构] ConvertDemo
编写好的VC为基础的二进制，八进制，十进制，十六进制的数值转换器，功能类似于windows的计算器中的转换功能
VC good preparation for the foundation of binary, octal, decimal, hexadecimal numerical converter, similar to the function of the windows of conversion calculator functions (2005-03-26, Visual C++, 309KB, 下载121次)