搜索资源列表
fenxingshusixiang
- Electromagnetic scattering from the trees above a tilted rough ground plane generated by the stochastic Lidenmayer system is studied by Monte Carlo simulations in this paper.The scattering coefficients are calculated in three methods:coherent additio
Unlock_MTK
- ＭＴＫ解锁能接明天棵新品手机计划开斋节所得税 -MTK unlocking be able to take tomorrow trees Id al-Fitr New phone tax plan
WatchpointEventSet
- 可怜见立刻建立棵今年可怜见看来内；可近年来看见；立刻脑筋；看来脑筋那里建立；看来内 -Gelianjian immediately established trees seem Gelianjian year; Can be seen in recent years; Immediately brains; It seems brains established there; It appears within
2-3-trees
- It s a note about data structure. Tree---self balancing and rotate-It's a note about data structure. Tree --- se lf balancing and rotate
shujujiegou-erchashu
- 叉排序树与平衡二叉排序树基本操作的实现 用二叉链表作存储结构 (1)以回车( \\n )为输入结束标志,输入数列L,生成二叉排序树T； (2)对二叉排序树T作中序遍历,输出结果； (3)计算二叉排序树T的平均查找长度,输出结果； (4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结 点,并作中序遍历(执行操作2)；否则输出信息“无结点x”； (5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and
digital_picture_process_for_vc
- 包括锐化、平滑、LOG滤波器提取边缘数学形态学的腐蚀、膨胀、骨架化、开闭运算以及分形方法画树木和树叶 包括源代码、3篇文档和可执行程序。-including sharpening, smoothing, edge extraction LOG filter of mathematical morphology of corrosion, swelling, skeleton, opening and closing operations and fractal approach painting
decision-trees
- 决策树lisp代码 决策树lisp代码-decision tree lisp code decisio n tree lisp code
myAlgorithmExamplesAndExplain
- 都是自己编写的常用算法的事例,本人础作. 里面有:哈密尔顿环,皇后问题,图的着色问题,子集和数问题,树和等价问题,栈的各种用发等.-themselves are prepared by the algorithm commonly used examples, I make foundation. There are : Hamilton Central, Queen's, graphs, and several subsets, trees and equivalence, the
kthtree
- kthtree问题 给定一棵有向树T，树T 中每个顶点u都有一个权w(u)；树的每条边(u,v)也都有一个 非负边长d(u,v)。有向树T的每个顶点u 可以看作客户，其服务需求量为w(u)。每条边(u,v)的边长d(u,v) 可以看作运输费用。如果在顶点u 处未设置服务机构，则将顶点u 处的服务需求沿有向树的边(u,v)转移到顶点v 处服务机构需付出的服务转移费用为w(u)*d(u,v)。 树根处已设置了服务机构，现在要在树T中增设k处服务机构，使得整棵树T 的服务转移费用最小-kt
DATALECTURE
- 数据结构 授课教案 本章主要介绍以下内容： 1.数据结构研究的主要内容 2.数据结构中涉及的基本概念 3.算法的概念、描述方法以及评价标准 栈和队列 1.树的定义和存储结构 2.二叉树的定义、性质、存储结构 3.二叉树的遍历、线索算法 4.树和二叉树的转换 5.哈夫曼树及其应用 -data structure templates teach this chapter introduces the follow
treemain
- 一个用树做的四则运算代码，望大家给与指教-one of the trees used four Operational code, we hope to give exhibitions
TransferableTreeNode
- 用于转换JAVA中的树的结构类型,检测传输拖放的数据是否可以接受用,重载Transferable类型-for conversion of the trees and the structure type, drag and drop testing transmission of data can be used to accept, Heavy Transferable types
openGlSence(moon)
- OPENGL场景绘制作业，一个院子，一个屋子，几棵树，喷泉、水池等。附当时的作业报告。-OpenGL Scene Rendering operations, a yard, a house and a few trees, fountains and ponds, and so on. Report of the operations report.
DataStruct
- 里面包含各种数据结构方面的知识,如链表,树,图等 含有vc代码-which contains various data structure of knowledge, such as linked lists, trees, and maps containing vc code
TreeFlower
- 分形算法做的漂亮的花草树木，夹道笔直的树木和红花绿草地构成了美丽的风景画-fractal algorithm so beautiful flowers and trees, the trees lining the road straight to the grass and safflower constitutes a beautiful landscape painting
45623541
- 数字图像处理源码,vc写的，包括锐化、平滑、LOG滤波器提取边缘数学形态学的腐蚀、膨胀、骨架化、开闭运算以及分形方法画树木和树叶 包括源代码、3篇文档和可执行程序 -digital image processing source code, written by the vc, including sharpening, smoothing, LOG filter from the brink of mathematical morphology corrosion, swelling, ske
QccPackSPIHT-0.54-1.tar
- QccPackSPIHT-0.54-1 (release 2007-04-30) The Set Partitioning in Hierarchical Trees (SPIHT) algorithm for wavelet-based image coding .-QccPackSPIHT - 0.54-1 (release 2007-04-3 0) The Set Partitioning in Hierarchical Trees ( SPIHT) algorithm for wav
redblcaktree
- Red Black Trees This file is come from the Linux Kernel.-Red Black Trees This file is come from the Li nux Kernel.
数字图像处理源码
- 包括锐化、平滑、LOG滤波器提取边缘数学形态学的腐蚀、膨胀、骨架化、开闭运算以及分形方法画树木和树叶 包括源代码、3篇文档和可执行程序 下载地址： 数字图像处理源码 -including sharpening, smoothing, edge extraction LOG filter of mathematical morphology of corrosion, swelling, skeleton, opening and closing operations a
My_eclat
- A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm i