CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - Tree
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
GUI Develop
Windows Kernel
WinSock-NDIS
Driver Develop
ADO-ODBC
GDI-Bitmap
CSharp
.net
Multimedia Develop
Communication
Shell api
ActiveX/DCOM/ATL
IME Develop
ISAPI-IE
Hook api
Screen saver
DirextX
Process-Thread
Console
File Operate
Printing program
Multi Monitor
DNA
Other
Search - Tree - List
[
Communication
]
sdk_winbase_io_asyncio
DL : 0
The AsyncIO sample (also called the \"PDC\" sample) is a character-mode program for searching the files in a directory tree for a match against a pattern. It uses multiple threads, with each thread processing one file at a time, accumulating its matches. When each thread finishes searching a file, the thread sends the matches contiguously to a standard output.
Date
: 2008-10-13
Size
: 18.64kb
User
:
黄磊
[
Communication
]
MonitorFinal
DL : 0
一个利用snmp协议访问mib2树的程序 非常的详细,有说明文档-an agreement using snmp visit mib2 tree very detailed procedures, documentation,
Date
: 2008-10-13
Size
: 615.74kb
User
:
王和
[
Communication
]
shujujeigou
DL : 0
详细介绍了数据结构中关于树和图的相关知识,并通过C语言实现了关于树和图的个种操作,是学习C语言和数据机构的很好好材料-detailed data on the structure of the tree and plans related knowledge, and through C language on the map of the trees and the species of operation, is learning C language and the good data good materials
Date
: 2008-10-13
Size
: 8.64mb
User
:
喔科
[
Communication
]
drop_target_Dlg
DL : 0
You imagine? Right, there s more than one possibility, this time I ll give you tree. One for your private data, one for the common data in order to receive data from other applications like Excel, WinWord etc. and at last, I ll give you a handy-dandy class you can derive ANY MFC object from, to make it a drop target
Date
: 2008-10-13
Size
: 22.16kb
User
:
wuhongbing
[
Communication
]
sdk_winbase_io_asyncio
DL : 0
The AsyncIO sample (also called the "PDC" sample) is a character-mode program for searching the files in a directory tree for a match against a pattern. It uses multiple threads, with each thread processing one file at a time, accumulating its matches. When each thread finishes searching a file, the thread sends the matches contiguously to a standard output.
Date
: 2025-12-20
Size
: 18kb
User
:
黄磊
[
Communication
]
MonitorFinal
DL : 0
一个利用snmp协议访问mib2树的程序 非常的详细,有说明文档-an agreement using snmp visit mib2 tree very detailed procedures, documentation,
Date
: 2025-12-20
Size
: 615kb
User
:
王和
[
Communication
]
CFpFach
DL : 0
3G中FP协议对应的FACH解码程序,可以供大家参考。-FP agreement 3G in the corresponding FACH decoding process can be for your reference.
Date
: 2025-12-20
Size
: 4kb
User
:
黄筱
[
Communication
]
hafuman
DL : 0
哈夫曼算法 用C++编程解决哈夫曼树的问题 分块程序-Huffman algorithm using C++ programming to solve the problem of sub-Huffman tree block procedures
Date
: 2025-12-20
Size
: 43kb
User
:
hanruyun
[
Communication
]
serial-lcd-sd12
DL : 0
How to conect an lcd serial on pic. using tree pins. project of mikroc.
Date
: 2025-12-20
Size
: 7kb
User
:
sniper_jod
[
Communication
]
maodv-code
DL : 0
this the multicast extension of the adhoc routing protocol in the ns2 extension. It is a tree based routing protocol uses hello messages-this is the multicast extension of the adhoc routing protocol in the ns2 extension. It is a tree based routing protocol uses hello messages
Date
: 2025-12-20
Size
: 69kb
User
:
shiva
[
Communication
]
Aggregation
DL : 0
an ns2 code for aggregation tree in wireless sensor networks
Date
: 2025-12-20
Size
: 4kb
User
:
bariye
[
Communication
]
convolutional-code-2-1-4-viterbi
DL : 0
本程序是卷积码的viterbi译码,卷积码的编码结构图已经附在程序打包中,本卷积码是循环递归卷积码,最后状态不容易回零,本程序最后有判决程序,记录回零状态!反向译码!本程序可以直接生成节点的树图,便于纠错,检错!-This program is viterbi decoding convolutional codes, convolutional codes have been attached to the coding structure packaged in a loop of the recursive convolutional code convolutional code, the final state is not easy to zero, the last a decision procedure of this program, records back to the zero state! Reverse decoding! This program can generate tree nodes, to facilitate error correction, error detection!
Date
: 2025-12-20
Size
: 9kb
User
:
jjl
[
Communication
]
STP
DL : 0
北大青鸟网络工程师培训教程之-STP协议-spanning tree protocal
Date
: 2025-12-20
Size
: 297kb
User
:
liulei
[
Communication
]
multicast_1
DL : 0
MPH以及扩展后的EMPH算法,能返回组播树以及每一条路径-MPH and extended EMPH algorithm, can return the multicast tree and every path
Date
: 2025-12-20
Size
: 277kb
User
:
[
Communication
]
Zw-new2.01
DL : 0
树状类型选择,串口通讯软件,MODBUS规约-Tree type selection, serial communication software, MODBUS protocol
Date
: 2025-12-20
Size
: 227kb
User
:
ctzhlzc
[
Communication
]
NV-tools
DL : 0
1.手机的NV项编辑; 2.具有自动语法解析头文件的功能; 3.保存分析后的语法树。-1 phone NV Item Editor 2 header files with automatic parsing function 3 Save the analysis of the syntax tree.
Date
: 2025-12-20
Size
: 818kb
User
:
刘晓静
[
Communication
]
DHU
DL : 0
图论,最小生成树,一种数学建模的实用方法,对你的比赛,和应用很有帮助-Graph theory, the minimum spanning tree,A good mathematical modeling tool, It is very helpful to your study MATLAB
Date
: 2025-12-20
Size
: 1kb
User
:
shamo
[
Communication
]
asdasda
DL : 0
二叉树的一些算法实现,包括建立、判断、遍历等-Some binary tree algorithm, including the establishment of, judge, traversal, etc.
Date
: 2025-12-20
Size
: 2kb
User
:
fag2208
[
Communication
]
BST1
DL : 0
运用伸展树的特性,每次插入新的结点后,调用展开函数,使得新结点成为所建树的根结点。-Use of the characteristics of the splay tree, each time you insert a new node, call to function, making the new node intoFor the achievements of the root.
Date
: 2025-12-20
Size
: 1kb
User
:
zhuo64508
[
Communication
]
BTree101
DL : 0
二叉树的递归算法:计算高度、结点个数、交换左右儿子问题的描述写一完整函数,计算树的结点数目int CountNode(BTNode< T> * &t);完善以下两个函数:计算树的高度int Depth(BTNode< T> * &root);对树的所有子树交换左右孩子void swapsons(BTNode< T> * &t);-Binary Tree Recursive Algorithm: Calculate the height of node number, the exchange about the issue of his son to write a complete description of function, calculating the number of tree node int CountNode (BTNode
Date
: 2025-12-20
Size
: 2kb
User
:
zhong078352
«
1
2
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.