资源列表
TSP
- The basic principle using the branchand- bound strategy to solve the traveling salesperson optimization problem (TSP) consists of two parts. There is a way to split the solution space. There is a way to predict a lower b
convexhull_Grahamscan
- Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S in
xhj
- 3D 选号机 可以按自已的意图,选取或去掉不想要的号码,缩小可选范围-3D选号machine can be their own intentions, select or remove unwanted numbers, narrowing the range of optional
oct3bank
- 三分之一倍频程滤波器组的算法。可以从时域进行滤波得到频谱，需要读入数据。-One-third octave filter bank algorithm. Can be time-domain filter spectrum, the need to read into the data.
project7
- visual c++ 简单程序 关于MFC 开发-visual c $!#! simple procedures developed on the MFC
Addison.Starting.Out.with.Python.Mar.2008
- This book uses the Python language to teach pro - gramming concepts and problem -solving skills, without assuming any previous program- ming experience. With easy-to-understand examples, pseudocode, flowcharts, and other tools, the student
mouse
- 用C实现鼠标器 调试环境为TC 2.0-With C debugging environment for the realization of mouse TC 2.0
menus
- c实现menus 调试环境是TC 2.0-c achieve menus debugging environment is TC 2.0
phonebook
- 用C实现通讯录功能,调试环境为TC2.0-Address Book using C to achieve functional, debugging environment TC2.0
pport
- 读者要在命令行下输入tcc -B d:\tc\source\pport.c,来编译 之后需要编译server.c和clint.c-Readers to the command line, enter the tcc-B d: csourcepport.c, after the need for the compiler to compile server.c and clint.c
ALLOCATE
- 三个非常使用的高速的内存分配函数.读者可以直接拷贝这三个函数到程序中去,使用Allocate()和My_Free()代替系统提供的alloc()和free()函数.-The use of three very high-speed memory allocation function. Readers can directly copy these three functions to the processes, the use of Allocate () and My_Free () to
utorrent
- plugin to test some thing i wanna do