资源列表
ghkpm32
- 动态Icon 简介 这个简单的类可以允许你在你的应用程序的主窗口()
BearBlaster-master
- 基于Jmonkeyengine 3做的3d游戏，可以放到安卓手机上跑(Based on the Jmonkeyengine 3 3D game, you can run on the Android Mobile)
SS8-ramp-01
- 板卡测试程序，主要是描述对于电脑主板的硬件电路的测试，以及相应部分功能的测试(A test program for the board, mainly describing the test of the hardware circuit of a computer motherboard.)
1215. bernoulli
- 实现一棵Bernoulli树。实现下列操作： 1.insert X，将整数X加入优先队列 2.delete，将优先队列中最小值弹出 3.min，输出最小值 初始优先队列为空。(Implement a Bernoulli tree. The following operations are implemented: 1.insert X, adding integer X to the priority queue 2.delete, the m
jfinal-3.0-src
- jfinal是一个极速web开发框架，jfinal3.0框架内容(jfinal3.0 is a great web development structure)
1042_左儿子右兄弟
- 输入一棵左儿子右兄弟表示的树，输出它(按照正常表示的)前序、后序和层次遍历的结果。 [左儿子右兄弟表示法是一种精神，务必领会] 样例说明： 2 /|\ 1 3 4 / \ \ 5 6 7(Enter a tree expressed by the right brother of a left son, and output the result of the tree, which is traversed by the preorder, the p
1117_Code
- 每次找到最小叶子节点，输出它的相邻节点（叶子节点只有一个相邻节点），删除该叶子节点。循环对图做这个操作，直到只剩一个节点。最后一共要输出N-1个数。(finds the smallest leaf node at a time, and outputs its adjacent node (the leaf node has only one adjacent node) to delete the leaf node. The loop does this to the graph until
1211_isCBT
- Descr iption 给出一棵二叉树的结构,判断这棵二叉树是不是完全二叉树。必须使用二叉树类实现。(Descr iption The structure of a two forked tree is given to determine whether the two forked tree is a complete two tree. The two forked tree class must be implemented.)
manspugatozHDLC
- 动态分区方式主存的分配和回收, 通过本实验可以了解在动态分区管理方式()
CRC16_RTU_张政林
- CRC16-rtu-超方便移植 字符串协议超级好玩的crc(CRC16-rtu- super convenient transplantation)
1214_traverse
- Descr iption 给出一棵孩子兄弟表示法下的树的结构以及各个结点的权值，要求按先序、后序、层次遍历二叉树并输出各个结点的权值。(Descr iption This paper gives the structure of a child's brother representation and the weight of each node, and asks for traversing the two fork tree according to the preorder, po
CBOYRD
- 动态显示窗口的源程序,可以改变界面大小,没有密码,值的推荐给大家()