-
HuffmanTree
用c++实现的haffman tree 小程序，仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)
- 2013-03-14 16:38:15下载
- 积分：1
-
CAR
some problems about c++.(car.cpp)
- 2012-01-12 14:39:48下载
- 积分：1
-
AOV-Sort-Algorithm
使用C语言编写的AOV网的拓扑排序，内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)
- 2011-10-26 16:34:29下载
- 积分：1
-
DisplayBTree
代码注重B树插入、删除的算法逻辑，适用于
学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )
- 2006-07-19 00:00:38下载
- 积分：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
-
123
校园导航系统
1） 校园景点介：绍介相关景点的有关详细信息。
2） 最佳路线查询：查询校园中任意两点之间所有路线，并提供两点间最短的简单路径。
3） 关节点查询：提供校园图的关节点查询。
4） 多景点最佳路线查询：提供多个景点的最佳线路查询，即求途径这个景点的最佳路径。
(Campus Navigation System 1) campus attractions Introduction: Shao Jie-related attractions for more information. 2) The best route query: Query on campus all the routes between any two points, and provides a simple shortest path between two points. 3) joint points: the key points to provide the campus map queries. 4) The best route queries more attractions: multiple sites to provide the best route queries, that is seeking ways to this spot the best path.)
- 2011-08-25 08:56:05下载
- 积分：1
-
graph-DFS
邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
- 2013-10-27 20:16:41下载
- 积分：1
-
Strassen-code
思塞恩算法
常用算法之一
算法导论提及(strassen algorithm which can run correctly)
- 2014-11-28 14:33:16下载
- 积分：1
-
ds-labs
说明： 数据结构基本算法实现。包括栈、二叉树基本运算实现，同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)
- 2011-03-27 03:01:02下载
- 积分：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
