搜索资源列表
KeyPath
- 数据结构中关键路径算法的实现与应用。介绍求关键路经的算法，对于给出的事件结点网络，要求求出从起点到终点的所有路径，经分析、比较后找出长读最大的路径，从而得出求关键路径的算法。-data structure Critical Path algorithm implementation and application. Introduced for passing key algorithm is given for the incident node network requirements de
2Dfft
- VHDL 关于2DFFT设计程序 u scinode1 ∼ scinode9.vhd: Every SCI node RTL vhdl code. The details can be seen in the following section. u 2dfft.vhd: The top module includes these scinodes and form a 3x3 SCI Torus network, and it support these sub-mo
keil2
- 总线各节点具有独立的电器特性，各节点单元电路能在相互不受影响的情况下，甚至在系统供电情况下，接入或撤除-bus node is independent of the electrical characteristics of the circuit nodes will not be affected in each other circumstances, even in the system of power, or remove access
bitree5
- 数据结构二叉数结点的各种运算，求左右结点，前后中序遍历各结点-data structure two forks few nodes in a variety of computing and seek around nodes, which preorder before and after each node, etc
createBtree
- 根据cdm.txt文件中给出的数据构造一颗二叉树。每行第一个数是节点，第二、三是左右子树。-cdm.txt According to the document presented a binary tree data structure. Each trip is the first node number, the second and the third is about subtrees.
zhenming3
- Applet可以直接从网络上结点获取图象并显示出来,创建对应于其他结点的图象-applet directly from the network node and access images shown, corresponding to the creation of other nodes images
deBoorCH
- de Boor 求值算法求作二次和三次B-样条插值曲线，Hartley-Judd法确定节点矢量，使用基于基的运算的插值法求控制顶点-algorithm evaluates demand for secondary and cubic B-spline interpolation curve, Hartley-Judd determine node vector-based computing interpolation method for the control vertices
lianbiaoshixian
- 程序运行后，可以任意次任意选择1－５各种功能（第一次当然应选0），直至选择6结束程序运行。 考虑实现功能5的函数原型作下列几种变化时，该函数及程序的其它部分需要作什么相应的变化，说明变化的原因。 node* del5560(node*) void del5560(node*&) void del5560() //头指针使用全局变量-running, they can choose any arbitrary time 1-5 various functions (th
zhigongguanli
- 建立一个结点包括职工的编号、年龄和性别的单向链表，分别定义函数完成以下功能： （4）删除指定编号的职工结点； （5）删除年龄在60岁以上的男性职工或55岁以上的女性职工结点，保存在另一个链表中。 主函数建立简单菜单选择，测试你的程序。-establish a node, including the number of employees, age and gender of the one-way linked list, defined function to complete t
duoxiangsih
- 1、 应用程序 直接可以实现多项式的各项操作。 2、 查看原代码VC++6.0打开“多项式\\poly88.dsp”或者用记事本打开“多项式\\poly88.cpp” 3、 代码简单说明: 本程序是一个工程文件包含了链式与顺序两种多项是处理方式： 链表存储结构：多项式类是polynomail，节点类是polynelem； 顺序存储结构：多项是结构体是Ploynomial，节点类是term。 4、 注：在运行应用程序\"多项式.exe\"时，在
AVL_Lib
- Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory
CAN_ADPE
- 这是一个CAN总线适配器的程序，将CAN节点的数据采集之后通过USB接口传送到上位PC机上去，由于保密性，现在只上传CAN节点的部分程序，供大家参考-This is a CAN bus adapter procedures, CAN node data acquisition after transmission via the USB interface to the upper PC up, confidentiality, only upload CAN nodes part of the
ThreadedBitree
- 线索二叉树 包括了类声明，创建树，插入节点，删除树等操作。-clues, including a binary tree type statement, create tree node insert, delete, etc tree.
bpnnet
- 这是一个解决XOR问题的基于BP神经网络的C语言程序 隐层中有一个节点-This is a solution to the problem XOR BP neural network-based C language program hidden layer is a node
graphic_algorithm
- 每对节点间最短路径 Floyd-Warshall 算法 D[i,j]表示从i到j的最短距离； P[i,j]表示从i到j的最短路径上j 的父节点-between each pair of nodes Shortest Path Floyd-Warshall algorithm D [i, j] said from i to j is the shortest distance; P [i, j] said from i to j the shortest path
My_TreeView
- 这个例子演示了如何向一个TreeView控件增加、减少结点 增加结点的方式包括了增加“兄弟姐妹”结点：这种情况也四种增加方式，分别 是最初、最后、下一个和上一个。也包含了增加子结点的方式 这样就使用了TreeView控件中的这5种关系。 另外，该例子也演示例如何通过拖放操作来对结点进行位置上的改变 拖放操作是比较广泛的一种Windows操作，在本例子之后将对其进行介绍 -This example demonstrated how a TreeView cont
LevelOrderTraverse
- 从键盘输入二叉树的节点数据建立二叉树，然后中序遍历-keyboard input from the binary tree data to establish binary tree node, which then preorder
vmfdjska;a
- 关于仿真软件的界面的实现 实现开始 暂停，停止的功能，还能增加节点还没有-simulation software for the interface to achieve the realization suspended and stop functions, but also not to increase node
BPSAN
- 通过BP神经网络学习一个3维的函数的源代码，为加快速度，程序初始化的为已经经过学习的得到结点权值，如果预设为随机值，将重新学习。-BP neural network through a three-dimensional study of the function of the source code to speed up, the initialization procedure for the study has already been node weights, if limited
Blink-compileshuoming
- 一种基于nesC的无线传感器网络应用程序,并提供了编译说明书,此文件就是编译后生成的二进制文件，将此文件用avr-studio通过JTAG烧写到节点中。-nesC-based wireless sensor network applications, and to provide a compiler brochures, this file is the compiled binary files generated. this document is avr-studio through t