-
yuesehuhuan
就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)
- 2007-11-22 11:35:10下载
- 积分:1
-
最小生成树
给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)
- 2017-06-05 17:27:17下载
- 积分:1
-
binary
实现对二叉树的操作:建树、遍历、求层高、叶子数和结点数等(binary tree)
- 2011-12-09 15:58:29下载
- 积分:1
-
DataStructureTest
数据结构的一些基本的相关的试验,如二叉树的遍历,打印,如排序算法,检索算法,动态结构的静态实现实验(Data structures related to some basic tests, such as binary tree traversal, print, such as sorting algorithms, search algorithms, the dynamic structure of the realization of the experimental static)
- 2009-01-20 13:18:22下载
- 积分:1
-
multiplication
本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)
- 2009-05-16 22:04:42下载
- 积分:1
-
1
说明: 可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)
- 2013-11-13 21:16:53下载
- 积分:1
-
bag1
使用不同的方法解决背包问题:本算法采用的是动态规划方法,比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
- 2011-07-16 18:40:31下载
- 积分:1
-
KMP---MFC
数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)
- 2020-07-04 08:40:01下载
- 积分:1
-
expression
利用栈完成算术表达式求值:从键盘或文件中输入算术表达式,计算其结果并显示。要求处理过程为:(1)转换为后缀表达式并输出;(2)对后缀表达式求值并输出。
输入的表达式中可以有整数、实数、括号,运算符包括+、-、*、/、#(代表单目负)。可以多次输入不同的表达式进行计算,直到用户选择“退出”。栈的基本操作可以自己实现,也可以使用系统提供的STL实现。
(Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)
- 2011-10-30 14:14:01下载
- 积分:1
-
floy
floyd算法
数据结构
求最短路径(floyd algorithm for data structure for shortest path)
- 2007-11-13 23:39:25下载
- 积分:1