步步高多媒体学生电脑JS版模拟器

Windows 窗口菜单响应编程-response to the Windows programming menu

包含多种字符处理程序的小程序包,对初学者有很大帮助-Contains a variety of characters in the process of small package of great help for beginners

集合排序 现有若干个集合的数据，每个数据集合可以自选一个指标参加排序。-Sort the existing number of collections of data collection, each data set can be an indicator of on-demand sort join.

模糊C均值聚类代码,使用初学者，很好理解

非常不错的自动更新程序.该有的都有了.十分好用-Very good automatic updates. That everything I had. Very easy to use

这是windows编写的成品游戏，名字叫疯狂斗地主。-This is the preparation of finished windows games, crazy斗地主name.

关于OFDM仿真的程序,对初学OFDM仿真的朋友应该很有帮助.-OFDM simulation on the procedures for beginners OFDM simulation should be helpful friend.

《Visual C++程序设计实验指导与实训》源代码- Visual C++ Guidance and training program design experiments, the source code

MFC写的迷宫游戏，搜索算法值得研究，还可以自己调整迷宫，界面友好

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.