资源列表
ShortPathMFC
- 演示了最短路径的算法逻辑，以对话框为交互工具。-demonstration of the shortest path algorithm logic, a dialog box for interactive tools.
HeapSortMFC
- 演示了堆排序的算法逻辑，且以MFC为开发工具，实现了可视化。-demonstration of the heap sorting algorithm logic and in the MFC for the development of tools to achieve a visualization.
GraphSmalltree
- 演示了最小生成树的普林算法和克鲁斯卡尔算法得算法过程。-demonstration of the minimum spanning tree algorithm and Chapline Kelushikaer algorithm algorithm in the process.
AVDOS
- 演示了AVL的删除与插入算法，通过模拟dos命令行实现。-demonstration of the AVL delete and insert algorithm simulation dos command line to achieve.
LRU2
- LRU对列队的实现,就是实现找出最近最少用的元素的算法.-LRU lined up to the realization that to achieve at least recently used to identify the elements of the algorithm.
chest
- java编写的可调节棋盘大小的残缺棋盘覆盖演示程序-prepared by the board may adjust the size of incomplete coverage chessboard Demonstration Program
graphicsalgorithmy
- 一套很好的图论算法源码,包括图的遍历,最短路径的实现，有向图计算、拓扑排序等多个算法的源码。-a good graph algorithm source code, including the traverse map, the shortest path, and it is to map, many other topological sorting algorithm source code.
jiefangchengju
- 求解方程组。输入方程组的系数距阵，程序先判断是否有解，有解输出解向量。-solving equations. The importation of the equation coefficient matrix procedure first determine whether explicit, explicit solution vector output.
path.cpp
- 试在虚基类Network中增加一个函数FindPaths，对于给定的无向图G 和G 中的2 个顶点v和w，输出G 中从v到w的一条简单路径。若有多条可能路径，则输出任意一条。 -test in the virtual base class to add a Network Function FindPaths. For a given undirected graph G and G, the two vertices v, w, output from the G v w to a si
color.cpp
- 对于给定的图G，如果存在一种用2种颜色对顶点着色的 方案，使得图中任意一条边所连接的2 个顶点着有不同 颜色，则称图G 是可2着色的。-for the given graph G, if there is a use two colors of vertex programs, make a map arbitrary edge connected with two vertices are different colors, says G is 2-colored.
euler.cpp
- 有时仅对赋权有向图上从任意一个顶点到另外任意一个顶点之间有没有路感兴趣。试修改Floyd算法，计算出图的道路矩阵P，使得从顶点i到顶点j有路时P[i,j]= 1,否则P[i,j]= 0。-sometimes only to empower a map from any one vertex to another arbitrary point between a road not interested. Try to amend Floyd algorithm calculated the ro
BOTHSTAC
- 双向栈的操作 入本 出本 双向栈的操作 入本 出本 双向栈的操作 入本 出本 双向栈的操作 入本 出本 双向栈的操作 入本 出本 双向栈的操作 入本 出本 双向栈的操作 入本 出本 双向栈的操作 入本 出本 双向栈的操作 入本 出本 -stack of two-way operation to the two-way out of the stack into the operation of the two-way