数据结构最短路径算法的实现

1.本程序由本人采用vc++ 6.0编写，包括了排序平衡二叉树的整套算法（包括插入、删除、查找以及其测试算法）。 2.运行myavl_vc.exe输入树的初始结点个数，确定后本程序将在内存中生成一棵相应结点数的二叉树，在此基础上你可以进行各种操作（插入、删除、查找以及测试其平衡性、排序性等） 3.每一个结点信息包括"商品编码"、"商品名称",且以"商品编码"作为关键字 4.初始生成的树的结点的商品编码为从1按顺序递增，商品名称为"生成的商品"加上商品编码 5.程序中的随机插入与随机删除是为了更好的测试程序的正确性和可靠性 6.随机插入（删除）时，程序将不断向（从）树中随机插入（删除）结点，每次随机插入（删除）都会进行平衡性与排序性的检查，如果树已经失去了有序性或平衡性，则会弹出树已失去了有序性或平衡性的提示并停止插入（删除）操作，当然你可以随时中断随机操作-1. The procedure I used vc 6.0 preparation, including the sequencing of the entire balanced binary tree algorithm (including insert, delete, search and test algorithm). 2. Running myavl_vc.exe importation of the initial tree node number, the procedures established in the memory of the formation of a corresponding nodes of a binary tree, and on this basis you can conduct various operations (insert, delete, search and testing their balance, sorting etc.) 3. each node information including "Product Codes," "trade names," and the "commodity codes" as the keyword 4. initial produ

Many applications use connection/object pool. A program may require a IMAP connection pool and LDAP connection pool. One could easily implement a IMAP connection pool, then take the existing code and implement a LDAP connection pool. The program grows, and now there is a need for a pool of threads. So just take the IMAP connection pool and convert that to a pool of threads (Copy, paste, find, replace????). Need to make some changes to the pool implementation? Not a very easy task, since the code has been duplicated in many places. Re-inventing source code is not an intelligent approach in an object oriented environment which encourages re-usability. It seems to make more sense to implement a pool that can contain any arbitrary type rather than duplicating code. How does one do that? The answer is to use type parameterization, more commonly referred to as templates.-connection/object pool. A program may require a IMAP connection po ol and LDAP connection pool. One could easily im plemen

本设计完成了要求的所有功能，可由系统建立一张图或者由用户自行建立一张图,并对该图进行关键路径的搜寻.用户界面友好，有用户使用说明,每一步操作都有说明与提示。程序运行通过，有详细的解释说明。-the design completed all the required functions, from the establishment of a system or plan established by the users themselves a map, and this map critical path of the search. User friendly interface, users note, every step of the operation have notes and hints. Running through a detailed explanation.

数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tr-data structure Balance- Bi-Tree data structure Balance- Bi-Tr ee data structure Balance- Bi-Tree data structure Balance- Bi-Tr

在9（3*3）个方格的方阵中填入数字1到N(N>=10)内的某9个数字 每个方格填一个整数，要求相邻两个方格的两个整数之和为质数。 试求所有的解-in 9 (3* 3) grid matrix to fill out a number of N (Ngt; = 10) of a nine figures each box filled an integral require two adjacent box at the two integral to the quality and number. Examination for all solutions

数据结构的java实现-data structure to achieve the java

实例有关说明： 数据源：本实例使用的数据源在本章实例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

物流管理信息系统， 内含Delphi源码， 有Access数据库， 还有文档说明及数据库说明。

一个用c++语言写的、学习简单工厂模式的代码。通过一个父类（OperationFactroy）指针，实现通过判断输入的计算符号而调用加、减、乘、除子类操作的简单代码。

数据结构用C语言实现，算法较巧妙-data structure using C language, the algorithm more cleverly