JSP servlet Postgre MVC framework ... online library system source code. CMU Pra...

资源描述C++写的购票系统，可以实现查询车次信息，购票，退票等功能，车次信息是提前预定好的，可以自己修改，考虑到了多个站点以及发车时间问题，解决了购票冲突问题，即在不同车站买到同一个座位上的车票。

数据结构中排序的实例分析，可供有兴趣的朋友参考学习-Sort of data structure example of analysis, available to interested friends refer to learning

 ；/*用于多文本直方图的Visual C#2010代码。

实现了波兰式的求解，对大数计算使用，可以到100位数的运算-realization of the Polish-solving, the use of large numbers calculation, the median of 100 Operators

罗马支配数的算法，对广义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

约瑟夫环源代码,前中后序递归遍历二叉树-Josephus source code, before, during and after recursive traversal sequence binary tree

一个通用的oracle OCI开发程序包-A generic oracle OCI development package

PieChartCtrl用C＋＋开发的管理系统-PieChartCtrl C++ development management system

NetBeans下的 Java访问数据库的工程文件。-NetBeans under the Java access to the database project file.

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.