资源列表
HuffmanTree
- 该源文件为赫夫曼树的构建和使用,是数据结构课程中的一个例子-The source files for building and using Huffman tree is a data structure of an example of a curriculum
BiTree
- 该源代码为二叉树的构建和使用,为数据结构课程中的一个例子-The source code for the construction and use of binary tree data structure courses for an example
FDM-any-accuracy
- 电磁波、声波或地震波等数值模拟中常常会用到有限差分法，但是很多文章都只是泛泛而谈时间2阶，空间4阶等等如何用公式，本文给出了任意阶精度的泰勒展开与迭代公式。-Numerical simulation of electromagnetic, acoustic or seismic waves will often use the finite difference method, but many articles are just generalities time two bands, spa
ADTLIst
- ADT LIST implementation assignment
implementation-for-the-Heap-Trees
- It s required to design an Abstract Data Type (ADT) Java implementation for the Heap Trees data structure that includes the following operations: 1. Constructor and display operations 2. Creating a Heap Tree a given array 3. Adding an elemen
Linked-List
- The static (circular) queue should be implemented as a class named StaticCircularQueue With a maximum of 100 integer elements, The Dynamic queue should be implemented as a class named DynamicQueue, The Dynamic queue must not be
SinglyLinkedList
- The newly added method should work as follow: 1. Takes two input objects L1 & L2 of type SinglyLinkedList, 2. L1 & L2 represents two Integer list in ascending order, 3. Returns an object L3 with the sorted merge value of L1 & L2 4. For exampl
RB_Tree
- Implementation of basic insertion, deletion and search algorithms in a red-black tree in C++.
system progromming assignment1
- 这是关于一个对于integer 相关的对bit进行操作的训练
TSP
- 用邻接表解决的TSP变形问题（带权值求最长路径）-TSP deformation problems solved with the adjacent table (with the right to find the value of the longest path)
cross
- 利用叉积求点在区域中的位置Use cross product demand in the region point position-Use cross product demand in the region point position
contor
- 利用contor函数和BSF实现的魔块问题（游戏）-Use magic block problem (game) contor functions and BSF implemented