基于关系数据库的图的运算

Calculation of graph based on relational database

针对在数据库应用程序中经常遇到的一种查询和实际问题的求解,提出了在关系数据库中对图进行表示和运算的方法。在该方法中,图中各顶点信息用字段来存放,图中的边用记录来表示,给出了在该表示方法中对图进行遍历和求解最小生成树的算法。通过对一无向图的遍历及其最小生成树的求解举例,表明该方法表示图易于存储数据,对于解决数据库应用中遇到的复杂问题具有一定的参考价值。

In allusion to a kind of query and the solution of factual problems which usually arise in database application programs the artide,gives a method to denote and calculate graph in relational database. With the method,vertexes of graph are stored in fields and edges are expressed in records. A method to traverse graph and calculate the minimum spanning tree of graph is given. An example to traverse and calculate the minimum spanning tree of a graph without direction is given. The example indicates that it is easy to store data with the method. For the solution to complicated problems in database application, it has reference value..