搜索资源列表
Minimum-code-distance 用C语言编写的求二进制数的最小码距
- 用C语言编写的求二进制数的最小码距。思路清晰，结构明了。适合初学者对C语言的了解与掌握。-Written in C language, the minimum code requirements from the binary number. Clear thinking, clear structure. Suitable for beginners to understand and master the C language.
opf
- 最小费用最大流的一个实验程序,可以根据具体问题来重新修改-Minimum cost maximum flow in an experimental procedure may be based on specific issues to re-modify the
matlab
- floyd最短路算法&求网络的最小费用最大流&匈牙利算法&求网络的最小费用最大流-Floyd s short for network algorithm and the minimum cost flow and Hungary algorithm for the minimum cost and maximum flow network
graph_
- //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
mst
- 最小生成树 MST的四种算法实现。 包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。 复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree Algorithm
graph_cut
- 最大流最小割的代码，功能很好很强大，可以用在图形剪除这方面。-Maximum flow minimum cut of the code, very very powerful feature can be used to cut off this area in the graphics.
minimum
- minimum spanning tree problem, kruskal and prim algorithms.Program gets matrix as an input
Martin94
- Martin, R. Spectral subtraction based on minimum statistics Proc. Eur. Signal Processin conf., 1994, 1182-1185 -Martin, R. Spectral subtraction based on minimum statistics Proc. Eur. Signal Processin conf., 1994, 1182-1185
Minimum_Spanning_Tree
- Minimum spanning tree.cpp If You have a connected, undirected graph, a spanning tree of that graph is a subgraph which is a tree and connects all the vertices together. Here You can do it with in C++ Language.
chap4
- 多步Diophantine方程递推，最小方差自校正程序，广义预测控制程序等-Multi-step recursive Diophantine equation, the minimum variance self-tuning procedures, generalized predictive control procedures,
1
- 对内存中给定的几个无符号字节数，求其最大值和最小值并在数码管上显示。-Memory in a given number of unsigned bytes, find the maximum and minimum values shown in the digital control.
PrimGraph
- Prim´ s algorithm using graphics finds a minimum spanning tree for a connected weighted undirected graph.
Minimum-tree
- 最小生成树，对数据结构新手有用，比较简单 -Minimum spanning tree
Client
- This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Pack
NFAtoDFA(CPP)
- 用c++编程求正规表达式到NFA（不确定的有限自动机），NFA到DFA及DFA（有限自动机）的最小化 -C++ programming with regular expressions to find NFA (not sure of the finite automata), NFA to DFA and DFA (finite automata) of the minimum
Minimum-cost-Spanning-Trees.docx
- Minimum-cost Spanning Trees
minimum
- 取逐个接收的数据序列的最小值，并予以显示-get the minimum of a series of data
the-minimum-dialog-to-show-picture
- 带基本CCD显示功能的最小对话框系统，程序中包含了对ccd的如何打开- the minimum dialog to show picture by ccd
function minimum
- Finding fuction minimum and maximum
82429-minimum-row-value-and-return-the-row
- Minimum row value and return row