一个通用的oracle OCI开发程序包

匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.

罗马支配数的算法，对广义Petersen图P(n,2)的罗马支配数进行了研究-Rome dominated the number of algorithms, on the generalized Petersen graph P (n, 2) the number of Roman domination of the research

开发工具 Informix-4gl- Development kit Informix-4gl

十字链表和求鞍点的程序-Cross and saddle point for the procedure

基本数据结构类的定义和实现: MyStack ,MyPoint,MyArc,Graph,MyQueuesMyStack为构造的一个通用的C++模版堆栈类 MyPoint为一个坐标结构MyArc为带权的边类Graph为临街矩阵表示的图MyQueues为按权值顺序存储的边的队列-basic data structure class definition and realization : MyStack, MyPoint, MyArc, Graph, MyQueuesMyStack for a generic structure of the C category MyPoint stack template for a structure MyArc to coordinate with the right side of the street like Graph Matrix plans MyQueues value of the order by the right side of the storage Queue

包括字符串反转， 链表反转， 判断两个数组中是否存在相同的数字， 判断链表是否存在环， 找出单向链表的中间结点， 如何判断一棵二叉树是否是平衡二叉树， strstr()的简单实现，-Including the string reversal, list reversal, to determine the existence of two different array of figures to determine the existence of ring list, find the middle of a one-way linked list nodes, how to determine whether it is a balanced binary tree Binary Tree, strstr () to achieve a simple,

数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法-algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.

好东西大家　要支持啊 c++常用排序算法-Good thing we have to support ah c++ Common sorting algorithm

数据结构的代码演示程序，利用栈的原理，将级数fact递归问题的执行过程以直观的形式演示出来。-data structure code demo program using the stack principle, Recursive series fact of the implementation process in the form of visual presentation out.

这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm