鲍曼莫斯科国立大学类型和数据结构课程的任务库，CS学位
Repository for tasks from course of Types and Data Structures in Bauman Moscow State University, CS degree (2023-12-20, C, 0KB, 下载0次)
霍洛维茨、沙尼和安德森·弗里德编写的教科书《C语言中数据结构的基础》（第2版）中的源代码。
Source codes from the textbook, "Fundamentals of Data Structures in C, 2nd Ed." written by Horowitz, Shani, and Anderson-Freed. (2021-05-21, C, 0KB, 下载0次)
数据结构和算法的优化实现，如芬维克树、分段树、堆栈、优先级查询...
An optimised ?? implementation of Data structures & Algorithms like Fenwick Trees, Segment Trees, Stacks, Priority Queues, Linked Lists etc for enterprise usage in our favourite ?? language - JavaScript (2021-08-09, JavaScript, 0KB, 下载0次)
某汽车轮渡口，过江渡船每次能载 10 辆车过江。过江车辆分别为客车类和
货车类，上船有如下规定：同类车先到先上船，客车先于货车上渡船，且每上 4 辆客
车，才允许上一辆货车；若等待客车不足 4 辆则以货车代替；若无货车等待则允许客
车都上船。设计一个算法模拟渡口管理。
An automobile ferry can carry 10 vehicles across the river at a time. The vehicles crossing the river are passenger cars and passenger cars respectively. For trucks, there are the following regulations for boarding: the same kind of vehicles first come first board the ship, the passenger cars first take the ferry on the truck, and each passenger gets on four passengers. Only one truck is allowed; if less than four waiting buses are replaced by a truck; if no waiting truck is allowed, passengers are allowed. All the cars get on board. Design an algorithm to simulate ferry management. (2019-06-22, C/C++, 1KB, 下载2次)
实现对美国地图的朴素迪杰斯特拉算法与A*最短路径搜索
Simple implementation of Dijkstra algorithm and A* on the map of the United States of the shortest path search (2018-02-09, C/C++, 1427KB, 下载2次)
求有向图中的一点到任意一点之间的最短路径，用dijkstra算法实现。
The shortest path between one point and any point in the directed graph is realized by the Dijkstra algorithm. (2018-01-11, C/C++, 809KB, 下载1次)
定义一个二维方阵类matrix。通过重载二元运算符"+"、"-"、"*"和一元运算符"~"，来实现矩阵加、矩阵减、矩阵乘以及矩阵转置
Define a two-dimensional square class matrix. By overloaded binary operator+ " ," - " ," * " and unary operator" ~ " to achieve matrix plus matrix reduction, matrix multiplication, and matrix transpose (2013-03-30, Visual C++, 1KB, 下载2次)
典八皇后问题——数据结构课程设计报告,虽然好多地方都有，我这个是按老师要求做好的，加个封面就可以直接上交。
Typical eight queens problem- data structure courses designed reports, although a lot of places have, I this is the request of the teachers do a good job, plus a cover can be directly handed. (2012-12-18, Visual C++, 535KB, 下载3次)
矩阵链乘。给定多个矩阵的维度，求出他们的相乘顺序，使得，按这样的顺序相乘的代价最小
Matrix chain multiplication。Solve the matrix chain order for a specic problem. This can be done by computing MATRIXCHAIN-
ORDER(p) where p = h5 10 3 12 5 50 6i (2012-05-29, Java, 1KB, 下载2次)
克鲁斯卡尔算法通常用来求解最小生成树问题，使树的权值之和最小。
Kruskal algorithm is usually used to solve the minimum spanning tree problem, so the right value of the tree and the minimum. (2012-05-17, Visual C++, 2KB, 下载4次)
链表，对链表的一些基本操作，包括创建、初始化，在里面加一个元素，删除一个元素，查找一个元素等,查找有多少个元素，销毁链表等，这里包括测试函数，和前面的不同
List, some of the list operations, including create, initialize, which add an element, delete an element, find an element (2012-04-30, C/C++, 2KB, 下载2次)
狄克斯特拉算法，在通信网结构设计和选择路径时最基本的两种算法之一。
Dick Stella algorithm, the communication network design and selection of path one of the most basic of the two algorithms. (2011-04-14, Visual C++, 1KB, 下载1次)
标准C的Hash表实现，采用环形队列加顺推的原理，实现高效的HASH表，参考暴雪游戏的实现原理，原创
Standard C, Hash table implementation, pushed along by the ring plus the principle of the queue, to achieve efficient HASH table, refer to the realization of the principle of Blizzard games, original (2011-01-29, C/C++, 13KB, 下载16次)
地杰斯特拉算法，实现确定图中任意两点间的最短距离，并显示最短路径
Jess Terra algorithm to achieve an arbitrary figure to determine the shortest distance between two points and displays the shortest path (2011-01-11, C/C++, 1KB, 下载9次)
本代码是对地杰克斯最短路径算法的应用，用于求解铁路旅游的费用最优解。
This code is the shortest path algorithm to the application of Jack, used to solve the optimal solution cost of rail travel. (2010-12-31, C++, 4KB, 下载2次)
这是香浓费罗埃利斯赫夫曼编码程序（严蔚敏数据结构在c++语言的实现。
This is the Shannon fees Luoailisi Huffman coding procedures (Yan Wei-min data structure in c++ language implementation. (2009-11-18, Visual C++, 1KB, 下载2次)
最小生成树的克鲁斯卡尔算法
采用邻接矩阵存储图，用树表示和实现集合操作
Kruskal minimum spanning tree algorithm uses the adjacency matrix memory map, with trees and realize that the collection operation (2009-05-12, Visual C++, 19KB, 下载4次)
数据结构课程设计报告,虽然好多地方都有，我这个是按老师要求做好的，加个封面就可以直接上交。
Data structure course design report, although a lot of places, I this is based on the teacher asked to do a good job, and add the cover can be directly handed over. (2009-01-01, Visual C++, 362KB, 下载10次)
串及矩阵的压缩存储应用,二叉树的构造与遍历,栈的测试和应用,线性表的链存储操作实现 源码加报告
String and the compressed matrix storage applications, the binary tree structure and traversal, stack testing and applications, linear forms of chain store operations to achieve source plus report (2008-05-26, C/C++, 164KB, 下载1次)
本程序为使用克鲁斯卡尔 (kruskal)算法构造最小生成树，首先使用链表建立连通图，交换权值以及头和尾，对权值进行排序，使用克鲁斯卡尔 (kruskal)算法构造最小生成树
This procedure for the use of Kruskal (kruskal) Minimum Spanning Tree Algorithm, the first to use linked lists to establish connectivity map, the right to exchange value, as well as head and tail, sort of weights, the use of Kruskal (kruskal) algorithm for the smallest structure Spanning Tree (2008-05-25, C/C++, 1KB, 下载30次)