nQueenProblem

SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video applications.-SR-tree is an index structure for high-dimensional nearest neighbor queries,C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image/video applications.

利用链表的结构，定义了航班信息链和乘客资料链，通过对链表的初始化、插入、删除等操作实现航线及乘客资料的录入、修改、办理退订票等功能。

这是一个分治法应用和递归的完美体现，它根据输入的数字在屏幕上打出美丽的图案。-this is a separate rule and the application of recursive the perfect embodiment of its import figures on the screen making beautiful designs.

Town是一个100% 纯Java API，它位于JDBC API的顶部。这个API的目的是简化和一个JDBC兼容的关系数据库的交互。通过使用Town,可以执行和管理select/insert/update/delete　SQL语句，而不用真正写一行SQL。Town也可以使用任何JDBC连接字符串和内部连接池。-Town is 100% pure Java API, it is located JDBC API the crown. This API goal is the simplification and a JDBC compatible relational database interactive. Through uses Town, may carry out and manage select/insert/update/delete the SQL sentence, but does not need truly to write line of SQL. Town also may use any JDBC to connect the character string and internal connection pond.

双向约瑟夫问题，利用双向链表实现双向进行的约瑟夫问题-Two-way Joseph problems, using two-way two-way linked to the issue of Joseph

wce4.0,database,- wce4.0,database

分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.

Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM). -Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).

使用数据库的VC编程实现，一个简单的DEMO-use of the VC database programming, a simple DEMO

图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such as the shortest path to map the way! VC interface!