资源列表
csmile_1_0.src
- C-smile OOL is a scr ipting language with C++-like grammar. It has compiler, VM running bytecodes and C++ extendible runtime. Intended to run in standlone and embedded mode C-smile 面向对象语言在语法上比较像C＋＋的脚本化的语言，它有一个编译器，一个运行字节码的虚拟机，和可扩展的C＋＋运行时。它是为运行独立的可插
SysData
- 一个小的服务程序，实现时钟同步，并做成服务程序，让它一直运行-a small service procedures, to achieve clock synchronization, and causing service procedures, it has been running
小小五子棋
- 一个delphi编写的小游戏，很好玩的。 -prepared in a small game, very fun.
xumin_20461
- 这是一个关于绘图的简单的小程序,如果可以的话,可以改进!-This is a simple drawing on a small procedure, if I may, can be improved!
xumin_20462
- 到底有几分说得比想像更快 是我们感情丰富太慷慨 还是要上天安排 是我们本来就是那一半 还是舍不得太乖 是那一次约定了没有来 让我哭得像小孩 是我们急着证明我存在 还是不爱会发呆-said in the end a bit faster than we imagine the feelings rich or too generous to God is our arrangement was originally half or reluctant to be t
ximin_20463
- 到底有几分说得比想像更快 是我们感情丰富太慷慨 还是要上天安排 是我们本来就是那一半 还是舍不得太乖 是那一次约定了没有来 让我哭得像小-said in the end a bit faster than we imagine the feelings rich or too generous to God is our arrangement was originally half or reluctant to be too clever it is not the
算法第一次实验
- 着色问题，输入一个图和颜色的种数，要求有邻边的两个顶点不能着同一种颜色，找出所有的着色方案-coloring, the importation of a color map and the number of categories, and a two adjacent edges of the peak is not the same color, identify all the coloring program
longest
- 输入一个带权图的无向图，求出其中一个顶点到其它顶点最长的路径，并输出这条最长路径-input with a map without the right to plan, which sought a vertex to vertex other the longest path, and the output of the longest path.
5班8号周前平
- 输入一个有向图，用深度优先搜索，判断该图是否为一有圈的图。-importation of a directed graph, with the depth-first search to determine whether the plan is a map of the circle.
zqp05
- 该程序为你模拟银行驱动系统，要求算出每个窗口顾客等待时间，和工作人员的平均繁忙度。-the procedure for your bank-driven simulation system that requires each window to calculate customer waiting time, and the average peak degrees.
zhou04
- 求函数的积分，用三种不同的方法求某一积分值，如矩形积分法等-function for the integration, using three different methods for a particular integral value, such as rectangular integral Law
5班8号周前平第2题
- 单源最短路径问题。从文件中读入一个图，求一个顶点到其它所有顶点的最短路径。-single source shortest path problem. Reading from the document into a plan and seek a culmination of all the other vertices in the shortest path.