资源列表
meijupailiezuhe131
- T012_枚举排列组合131,关于枚举排列组合的算法-T012_ enumerate permutations 131, permutations and combinations on the enumeration algorithm
Bellman_ford
- T0041_最短路径Bellman_ford算法优化,bellman-ford优化-T0041_ Bellman_ford shortest path algorithm optimization, bellman-ford optimization
224Edmonds_Karp
- T017_最大流增广路算法224Edmonds_Karp-T017_ maximum flow augmenting path algorithm 224Edmonds_Karp
T006_Floyd_Warshal
- T006_Floyd_Warshall算法任意两点间的最短路径-T006_Floyd_Warshall algorithm shortest path between any two
zuidazuixiaofeiyongliu
- 关于T018_最小费用最大流问题的算法，求出最大流最小费用-About T018_ minimum cost maximum flow problem algorithm, find the maximum flow minimum cost
roweditor
- 实现简单的行编辑系统，打开、退出、显示、删除、添加等功能-Line editing system to achieve a simple, open, quit, display, delete, add, etc.
largenumber
- 实现存储任意大整数的功能，利用单链表，能够输入、输出、加法、赋值-Implementing Stored arbitrarily large integer functions, the use of a single list, can be input, output, addition, assignment
sequencetree
- 实现用顺序存储实现的二叉树类，具有二叉树的基本功能-Stored in order to achieve achieved using a binary tree class with the basic functions of a binary tree
binomialqueue
- 实现类伯努利队列类，具有其基本功能，能够添加、删除、显示-Implementation class Bernoulli queue class, with its basic functions, the ability to add, delete, display
leastpackage
- 实现了最小背包问题的解决，利用优先级队列来解决-Achieve a minimum knapsack problem, the use of priority queues to resolve
Josephus
- 通过循环链表解决约瑟夫环问题：一群人围坐成环，指定某人报出某个数，并从这个人开始报数，报到制定的数的人站出来，然后下一个人继续报数，依次循环，最后程序显示站出的顺序-Josephus through circular linked list to solve the problem: a group of people sitting in a ring, someone reported a designated number, and this person reported the num
Integration
- 使用变步长梯形法和Romberg积分法实现1到3上分别对e^x和1/x的积分-Trapezoidal method using variable step size and Romberg integration method to achieve 1-3 respectively for e ^ x and 1/x is integral