数据库结构课本中二叉树中求最小代价生成树

javaWeb教程-javaWeb Guide

清除电脑系统的临时文件， 垃圾文件，很方便。用于wiodows-Computer system to clear the temporary files, junk files easily. For wiodows

很好的一个VB程序 可以作为学生期末作业 是一个综合实验-Good one VB program can work as a student is a comprehensive end of experiment

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.

一个用Dreamweaver制作的留言本，可以进行留言，是一个不错的留言本！-a production of the messages, voice mail can be a good message this!

RCPC编码，这个是用于CCS环境下的RCPC编码。里面有三种打孔图形。-RCPC codes, this is for the CCS environment RCPC coding. There are three types of perforated graphics.

用C++写的一个地形DEMO，不是很复杂，对刚开始学的话好好研究有帮助的-With C++ Write a terrain DEMO, not very complicated, then just beginning to learn good study help

实现二值化，当像素值（r+g+b）/3>128时设为255,当像素值小于128时设置为0.做归一化处理后，2值化的颜色 1为白，0为黑。边缘部分，计算有误差，255,254,253,252 就算白，0，1，2，3，4就算黑。屏幕显示时，肉眼是分辨不出这点误差的。你可以对2值化后的图像值作归一化处理，得到1和0，然后再放大（乘255），就可得到满意的数值。至于左边界上 1 254 253， 0 255 255，可能是2值化前，颜色原本就有差别。不是2值化的错误。

源码-source

datagrid打印 可以实现在当前控件的打印功能-datagrid printing can be achieved in the current control of the printing function