comp

图结构有着广泛的应用，本实训主要涉及两个方面的内容：一个是有关图的最短路径问题，用一个交通查询系统例子来验证迪杰斯特拉算法和费洛伊德算法；而另一个则工程项目实施过程中的关键路径问题。(Graph structure has a wide application, the Training involves two main aspects: one is related to map the shortest path problem, using examples of a traffic inquiry system to verify Dijkstra algorithm and fees Lloyd algorithm and the other and one project implementation process of the critical path problem.)

说明：  贪心方法是一种改进了的分级处理方法。它首先根据题意，选取一种量度标准。然后按这种量度标准对这n个输入排序，并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解，则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)

本程序为数据结构常用算法中的冒泡法，希望对大家有所帮助！错误的地方请见谅！-This procedure commonly used algorithm for the data structure of bubble law, would like to help everyone! Wrong place please forgive me!

C语言树的简单实现,介绍了树你前序遍历，树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)

本项目旨在提供有关安得拉邦学院的信息。安得拉邦是一个希望参加不同课程学习的人有越来越多机会的州。本网站旨在向这些人提供有关A.P舒适时尚的机会的信息。拉普拉德什政府的新教育政策

门到门蔬菜服务程序的人可以订购从他们的家的蔬菜和蔬菜将 蔬菜店到他们的家。这个项目是蔬菜销售者可以管理他们的 库存

用数据结构算法的方式，用C语言编写的一个实现MD5加密的小程序的代码-Algorithm with the way data structure, using C language, an implementation of MD5 encryption applet code

OTL4.0被设计成一个C++模板框架和OTL-适配器的组合。该框架是一个通用的实施OTL流的概念。该OTL-适配器周围的数据库API薄包装和作为类的类型参数传递到模板框架。

常在该网站下载资料，也想分享些材料上去，这个资料是FRFT算法(Often the site to download information, but also want to share some material up, this information is FRFT algorithm)

采用模版函数对数据结构的线性列表和栈以及队列进行编程。-template function using the data structure of the linear list and Stack and Queue program.