一个经典的Ｃ程序的代码集合

实例有关说明： 数据源：本实例使用的数据源在本章实例MyOdbcSmpl目录中，数据源为ACCESS数据源，数 据文件为Mydb.mdb。请根据本章2.4.1创建ODBC数据源中所指示的ODBC数据源管 理器（ODBC32.exe）来创建和配置数据源MyDB（也可以命名为其他名称）。 执行结果：本章实例的执行结果MyOdbcSmpl目录中的可执行文件MyOdbcSmpl.exe。在数据 源中选择刚配置的MyDB，在数据表或视图中选择要查询的表或视图，选择查询的 列，如果有查询条件，请在查询条件中输入，最后确定是否输出显示查询结果， 缺省为显示，单击“执行”按钮，执行查询并显示查询结果，在SQL语句框中显 示执行的查询。-Note : Data Source : The data used by the examples in this chapter source directory MyOdbcSmpl example, ACCESS data source for data sources, data files for Mydb.mdb. Requests under this chapter 2.4.1 create ODBC data source as directed by the ODBC Data Source Manager (ODBC32.exe) to create and configure data sources MyDB (also named other names). Outcome : examples of this chapter MyOdbcSmpl results of the implementation of the directory MyOdbcSmpl.exe executable files. The data sources to choose just the MyDB configuration, the data in Table View or choose to check the table or view, the choice for the series, if there are inquiries conditions, the conditions for the imp

校园e卡通中数据库的设计和系统页面设计，实现服务器端数据库对交易的监视和记录的功能 -Campus e cartoon in database design and system page design, server-side database to realize the transaction monitor and record the functions of

怎样判断一个指针指向的对象是否已经被析构，很好的学习C++的资料-how to decide a pointer at whether the target has been Destructors, good learning C information

网络优化算法：任两点间最短路径问题的BellmanFord算法-Network optimization algorithms: the shortest path between any two points BellmanFord algorithm issues

数据结构中树的相关操作,希望对大家有用!thanks-tree data structure of operation, we hope to useful! Thanks

数据结构c语言版，图的遍历，周游世界，无向图的遍历，包含14个国家。-Data structure c language version, graph traversal, travel around the world, undirected graph traversal, including 14 countries.

这是一个表示数据结构tree的c++模板对象,封装的非常好.tree-msvc.hh能在 visual c++下使用,如同使用stl标准模板类库一样-This is a tree data structure that the c++ template object, the package is very good. Tree-msvc.hh be able to use visual c++, as the use of standard template library stl the same as

C数据结构常用算法程序集２，描述数据结构算法。-C data structures commonly used algorithm Set 2, describe data structure algorithms.

在学习数据结构时，往往不知道那些结构与算法有何用，以及怎么用。这个小小程序充分显示了Huffman二叉树的应用。虽然其压缩效果比RAR相差甚远，但也能说明一二。 -the study data structure, they often do not know what the structure and algorithm, as well as how use. This little procedure fully demonstrated the application of the binary tree Huffman. Although the compression ratio falls far short of RAR, but can also explain on January 2.

网络流算法的程序以及用网络流解决两个最小割模型的代码-Network flow algorithm for the procedure as well as network flow solution to the two minimal cut model code