数据结构 c语言 教程

经典的八皇后问题，结合MFC界面编程，能够清晰看到皇后的排列位置。-eight Queen"s classic, combining MFC programming interface, can see clearly what the position with the Queen.

求解约瑟夫问题。设有n个人围成一个圆圈坐下，对所有围从的人从某个位置开始编号为1,2,3，……，n,从编号为1的人开始报数1，报数依交进行，报数n的人即出列，下一个人从1开始报数，再报数m的人便是第二个出列的人如此重复下去，直到最后一个人出列为止，于是便得到一个出列的顺序，这称之为约瑟夫(Josephu)问题。-solving problems. N individuals have formed a circle to sit down, all right Wai from the start from a position of No. 1, 2, 3, ..., n, for a number of people reported a few, according to several newspaper pay, the newspaper n ie the out, the next person was from the beginning a few , and reported m is the second out of this series continue to repeat until the final out in a series, then get a series out of order, which called Joseph (Josephu) problem.

用vb写的饮食管理系统功能全面-with vb was eating a comprehensive management system function

测试各种排序算法,使用VC.NET进行开发，如果有任何问题请发邮件给我-test algorithm, using VC.NET develop, if there is any question, please send an email to

DataBase development

如果发现有提示控件未注册,请运行"控件注册.bat"注册控件.-If it is found that the control has prompted unregistered, please run

如果一个估价函数可以找出最短的路径，我们称之为可采纳性。A*算法是一个可采纳的最好优先算法。A*算法的估价函数可表示为：f"(n) = g"(n) + h"(n) 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报 打分 发表评论 暂无评论

具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.

数据库系统：访问数据库。访问数据库并能对出错进行捕捉-database system : access to the database. Access to the database and is able to capture for mistakes

中后序列求二叉树，c语言，源码有注释，可供学习使用。-posterior sequence for Binary Tree, c language, a source notes for studying.