资源列表
24JAVA
- 这是计算24点的JAVA程序 用javascr ipt编写实现。附源程序及程序的运行结果
Drag
- javascr ipt拖动、 -javascr ipt drag, javascr ipt drag,
VoiceRecorderMSP430
- Voice_ Recorder_ MSP430.rar
machine-simulink(www.power88.ir)
- machine simulink & mfile in the matlab
network-security
- network security project document first review
WiCommMatlabCodes
- It contains coding about mobile agents that can be used in wireless communications
DM9000A
- 一个PROTEL格式的——DM9000A的原理图-A PROTEL format- DM9000A schematic
cdecl-and-stdcall
- 关于vc++编译器选项cdecl和stdcall的详细说明，本人经过编辑和确认。-Cdecl and stdcall on vc++ compiler option, I edited and confirm.
nimabixianggemingzizhemenanawocao
- 非常全的VB代码，真的很准龙与虎，希望你要-Very full VB code, it is really true dragon and the tiger, I hope you want to
Imwlzf
- 我我产们中国 回荡埲保保轵蔷薇的袄 吵工中了 烧火湹颉击碎唾壶 顺不硅-Jijafkdf kajkdjfka kaioj dfkaddl,.
BiTree
- 输入一个字符串，并建成一棵二叉树，满足左子树的字符都要小于根结点的字符，右字树的字符都要大于根结点的字符，每个结点值有字符和字符的出现次数，并用三种遍历方法打印，比较是否与自己想象的相一致。再求树的深度、叶子结点数、最大结点值。-Enter a string, and the completion of a binary tree, to meet the characters in the left subtree must be less than the root node of the
graph
- 用邻接矩阵法建一无向连通图（顶点信息为字符），分别用dfs（深度优先搜索）和bfs(广度优先搜索)遍历，输出图中顶点信息并验证。-Adjacency matrix to build an undirected connected graph (vertex information for characters), respectively dfs (depth-first search), and bfs (breadth-first search) traversal, the output