魔王语言解释程序 请大家多多支持 数据结构实验

有向图 编写程序判断该图是否含有环 如没有则输出其拓扑序列-Digraph write a program to determine whether it contains any part of the plan if there is no sequence of the output of its topological

最段路径的算法 dijkstra算法，用C++编写-The dijkstra algorithm path segment algorithm, using C++ to prepare

专家抽取系统1.0 是用Delphi6.0 开发的一款用于招投标,评审过程中从专家库中抽取专家的软件。可以将抽取结果导入到Excel或Word文档中-experts Extraction System 1.0 is developed using Delphi 6.0 for one of the bidding, The accreditation process from a pool of experts from a software expert. The results can be taken into the Word or Excel document

这是一个使用c代码访问mysql的简单方法。请检查asdasdadasdasdasdasdsasdaasdad，asdasdasdadadadadadadadadadadadadadadadadadqeqewqedcxzczczczxzxasdas，asdsasdasdadaqeweqeweqewew

图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such as the shortest path to map the way! VC interface!

求解约瑟夫问题。设有n个人围成一个圆圈坐下，对所有围从的人从某个位置开始编号为1,2,3，……，n,从编号为1的人开始报数1，报数依交进行，报数n的人即出列，下一个人从1开始报数，再报数m的人便是第二个出列的人如此重复下去，直到最后一个人出列为止，于是便得到一个出列的顺序，这称之为约瑟夫(Josephu)问题。-solving problems. N individuals have formed a circle to sit down, all right Wai from the start from a position of No. 1, 2, 3, ..., n, for a number of people reported a few, according to several newspaper pay, the newspaper n ie the out, the next person was from the beginning a few , and reported m is the second out of this series continue to repeat until the final out in a series, then get a series out of order, which called Joseph (Josephu) problem.

物业缴费管理系统-property Payment Management System

是数据结构的课程设计，程序可以运行，但有时会出错，文档也有，希望对大家有帮助。最重要的是很简单，如果你什么都不会，但是课设题目，你就可以用。-Is the data structure of curriculum design, program can run, but sometimes to be wrong, the document also, I hope all of you help. The most important thing is very simple, what if you do not, but the class-based subject, you can use.

创建BDE别名，在运行时自动创建的。-BDE created Alias, operates automatically created.

数据结构一元多项式的实现-data structure of one yuan achieve polynomial