OFDM 仿真使用 MATLAB

郑莉c++课件 C++语言程序设计配套使用（清华大学出版社） -Zheng Li c++ Courseware C++ Language Program Design supporting the use of (Tsinghua University Press)

uda旧的实验控制台版本.仅作实验测试用途.仅有英文命令行版.含源代码. -uda old console version of the experiment. experimental testing purposes only. the only English version of the command line. containing the source code.

学校导游咨询系统-school guides Advisory System

these files contain matlab files and documents

在AutoCAD开发过程中,动态查询实体与数据库的情况的工具-Query the information of the entity and the database dynamic in AutoCAD developing.

这个程序是一个用鼠标画直线的源码,是用vc做的,对于那些初学者可能比较有用1-the procedure is painting a straight line with the mouse the source, is to use vc do, for those who may be more useful to beginners 1

双向链表的插入和删除，本人纯菜鸟，代码水平不高，请见谅！-Two-way linked list of the insert and delete, I pure rookie, code level, please forgive me!

读写Excel文件- Read-write Excel document

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

vc++学习资料，包括“孙鑫老师《vc++深入详解》1-20课笔记”“VC++编程指南”“vc经典教程”-vc++ learning materials, including