数据库pb语言的一些程序示例,给pb学习者参考使用,希望能给大家带来帮助!...

编写了一个关于图的操作的应用程序，可以自己手动输入图的节点和节点的关系，然后可以进行查找节点，求节点的出度和入度，求最短的路径等-Prepared a map of the operation on the application, you can manually enter their own graph of the relationship between nodes and nodes, and then can search the node, and the out-degree and node-degree, and the shortest path, etc.

SVG动态读取数据库并实时显示出来。该代码以通过后台读取时间实时显示出来，如果你需要读取数据库，请在Default.aspx中处理即可。-SVG Dynamic read the database and displayed in real time. The code to read through the background of real-time display of time, if you need to read the database, please Default.aspx in treatment can be.

该项目是一个在线投票系统，使学生能够通过在线投票而不费吹灰之力；

它是基本的 C 编程概念和文件处理中的应用。 使用此应用程序用户可以搜索各种文件在系统内。打开该文件。读它。计算总的行在它和许多这类功能。

利用Linklist实现超大整数之加减乘除-Linklist achieve large integers using the Math

压缩包内解决用计算机实现图论中的最短路问题-Compression package to resolve the computer graph theory realize the shortest path problem

IOI 2001 解题报告 内容：所有题目的详细分析以及参考程序 此外还有Ｔｅｓｔ数据-IOI 2001 Solving the contents of the report: a detailed analysis of all the topics and make reference to procedures in addition to Test Data

求解约瑟夫问题。设有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.

数据结构。拉格朗日插值法算法。通过拉格朗日算法求方程-Data structure. Lagrange interpolation algorithm. Through the Lagrange method of Equation

利用Excel进行读写操作，很方便，很实用，可以试一试-Use Excel to read and write operation, it is convenient and very practical, you can try