在 JAVA 游戏

1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal sequence of vertices losers Figure out from the starting point V0 according to the breadth- first traversal sequence vertex 2, and plans to establish the topological sorting

高级算法里的排序讲义ppt。sorting- In high-level algorithm arrangement printed lecture ppt. Sorting

应收款管理,管理收款项目和其他!-receivables management, project management and other receivables!

清华大学版的数据结构书实验编的解决8皇后问题的原程序，还是动态的显示。-version of the experimental data structure book series to solve the problems of the original Queen"s procedures, or dynamic display.

一个用C写的迷宫小游戏，旨在对C中的指针及数据结构中的单链表和栈的使用的训练。-Using C to write a maze game, designed for C of the pointer and data structure of a single linked list and stack the use of training.

问题描述：设有11种不问的钱币各若干张，可用这II种钱币产生许多不同的面值。试 设计一个算法，计算给定的某个面值，能有多少种不同的产生方法。例如有1分3张，2分 3张，5分1张，则能组成7分面值的方法有：3个1分+2个2分，1个1分十3个2分，2 个1分+1个5分，1个2分+1个5分共四种。 ^编程任务：对于给定的II种不同钱币，编程计算某个给定面值能有多少种不同的产生 方法。-Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.

KRUSKAL算法-KRUSKAL Algorithm

关于数据库的源代码。适合初学者参考如何使用数据库。-With regard to the database source code. Suitable for advanced users how to use the database.

this is a zip file contain a program for design of deep foundation with excel.

详细说明：matalb实现的协同过滤，里面包含很多重要算法，都已经实现