搜索资源列表
Kruskal
- 一个用vc实现的Kruskal算法，程序流程非常清晰，有助于对算法的理解。-a vc achieved using Kruskal algorithm, program flow is very clear, contribute to the understanding of the algorithm.
汇编语言程序设计报告
- 这是有关汇编语言的程序设计实例,以实验报告的形式给出.有源码,流程图.-This is the assembly language programming examples, the report of the experiment is given. A source, the flow chart.
graphDegree
- 求图的顶点连通度算法。方法就是先对源和汇做枚举，之后对每个枚举情况，把除去源汇两点的其余所有顶点看成是容量限制为1的点，求网络的最大流，就是此点对的顶点连通度，之后对枚举的所有点对找连通度最小的当成图的连通度。 带有顶点容量限制的最大流方法：将带容量限制的顶点u拆成两个点u 和u*，原顶点u的入边为u 的入边，原顶点u的出边为u*的出边，之后在u 和u*之间连接双向边，边的容量为顶点的容量限制。-plans for the vertex connectivity algorithms. F
huffmanFORdatastreamcompress
- 用于数据流压缩的huffman算法源代码，c++编写，程序十分简练-data flow for the Huffman compression algorithm source code, c preparation, the procedure was very concise
c++powerflow
- 潮流计算程序介绍，读者可以据此独立编制潮流计算程序。-flow calculation procedures, independent readers will be prepared accordingly flow calculation procedures.
caculation
- 电力系统潮流算法,内含多个子程序,可工大家学习参考-power flow algorithm, containing more than subroutine, we can learn from the Public Reference
数据结构的文件读写
- 结构数据的读写是指从\"流\"文件中读取数据存入结构，或将结构数据写入\"流\"文件。我们可以用以下两种方法进行结构数据的文件读写-read and write data structure is defined as "the flow" paper read data are stored in the structure or structures to write data "flow" document. We can use the follo
NetStream
- 已知一个网络对应的邻接矩阵，求该网络上的最大流。属于数据结构中的问题。-a network known counterparts in the adjacent matrix, the network for the maximum flow. Data structures belonging to the problem.
biaohao
- 最大流量Prim 算法寻找最小生成树,用C语言实现,有完整的注释-maximum flow Prim finding minimum spanning tree algorithm, using C language, a complete Notes
codebuf
- 一个编码器，能编解码位流，适用于压缩算法的编码输出。-a coding device that can flow spaces codecs, compression algorithm applied to the coding output.
InOutData
- 此程序对网路传输数据的传输是个很好的东东,其主要是对数据进行压入和压出作了封装, 对int,long,byte,char*和结构均支持, 数据是以流的形式-this procedure to the Internet to transmit data transmission is a very good Eastern, mainly for data indentation made and squeezed out the package, the right int, long, byt
dinic的网络最大流算法模板
- dinic的网络最大流算法模板，非常实用，经过自己多次测试通过的!Q,Dinic network maximum flow algorithm templates, very useful, after their own, adopted a series of trial runs! Q
txl.rar
- 数据结构课程设计 通讯录，一个很不错的系统，流程图包含在内。,Address book data structure course design, a very good system, flow chart included.
ACM_template.rar
- 本人参加ACM竞赛使用的一些算法模板，包括二分图匹配，欧拉回路的构造以及网络流中的最大流与最小费用最大流等，可以说实战性非常强。,ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and mini
duct4
- duct.f computes a fully developed viscous laminar flow in a rectangular channel of aspect ratio b/a (=bar). solve the equation: d^2u/dx^2 + d^2u/dy^2 = -1, -a<x<a, -b<y<b method of discretisation: 3-point centered differences
unstruc-cavity
- 非结构方腔流动计算程序，采用C语言，计算流体动力学-Non-structural square cavity flow calculation program, using C language, computational fluid dynamics
4.tar
- 依据Johnson原则，应用贪心算法解决两处理机流水作业调度问题。注释详实，可读性好。-Johnson based on the principle of application of the greedy algorithm to solve the two processor flow-shop scheduling problem. Comments detailed, readable.
Flow-shop-scheduling
- 流水作业调度问题要求确定这n个作业的最优加工顺序，使得从第一个作业在机器 上开始加工，到最后一个作业在机器 上加工完成所需的时间最少。-Flow-shop scheduling problem requires to determine that the optimal n-job processing sequence, so the first job from start processing on the machine, to the last job on the machine p
980507(Network-flow-IPII)
- 演算法程式設計課堂練習檔，本檔為visual studio之c/c++專案資料夾壓縮檔，內容為network flow之練習題-the practicing file of the computer algorithm course
power-flow
- forward backward power flow