资源列表
1455
- 北大ACM1455(Crazy tea party)-North ACM1455 (Crazy tea party)
1005
- 北大ACM1005(I Think I Need a Houseboat)-North ACM1005 (I Think I Need a Houseboat)
cengxubianlierchashu
- shi.c 说明:本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,对于空结点输入宏ENDTAG所对的值(暂定为整数0). 建立好二叉树后即可自动进行遍历依次层序输出各结点的值. ----Author:zhg 2006.11.26 E-mail: wudazhg@163.com 仅供参考学习之用，所有权保留-shi.c : The procedures for the binary tree traversal sequence. procedure
E23_0310
- 火车调度,学得还不错,跟大家一起分享.不过不是自己写的-train, we learn was pretty good, to share with you. But it is not that he wrote
operate
- 1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal
tree-leave
- 中序遍历输出二叉树 输出二叉树的叶子树 输出二叉树的节点数-which preorder output binary tree output binary tree leaf tree output binary tree nodes
zhan-op
- 栈的操作与应用 定界符配对检查 中缀转后缀并求值-stack operation and application delimiter matching inspection superintendent to seek value and Suffix
tree-op
- 前序线索二叉树的前序遍历 中序线索二叉树的中序遍历 后序线索二叉树的后序遍历-Preorder clues before the binary tree traversal sequence which leads the order of the binary tree traversal sequence clues after the binary tree after preorder
duoDT
- 这是在邻接表的基础上实现的多段图的向前算法-This the adjacency list on the basis of the multi-map algorithm forward ... ... ...
cfffsss
- 改进后的算法大大减少了对于那些运动矢量为零的块的搜索冗余，同时对于运动比较剧烈的块直接进入大范围搜索。这样即提高了搜索效率，又不会使搜索结果陷入局部最优。-improved algorithm greatly reduced for those zero motion vector search block redundancy, Meanwhile, more intense campaign of direct access to block large-scale search. That
Establishment-usebinarytreeprocedure
- 本程序的功能主要是建立并实现了二叉树的算法 -this program is the main function of the establishment and the realization of a binary tree algorithm
franction
- 简单地分数运算,实现分数地加减乘除运算!-simple computation, fractional arithmetic operations to!