摘要
图论中的一个典型的问题就是最短路径和最小代价问题。本文介绍了一种基于Oracle的表、视图及存储过程求解最短路径(最小代价)的方法.该方法使得解决复杂的有向图问题更加容易,而且不需要很多代码。
A typical question is the question of shortest path and smallest value. The text introduced a method which based on the Oracle table, the view and the procedure. It makes solving---more easier and doesn＇ t need many codes.
出处
《齐齐哈尔大学学报（自然科学版）》
2008年第5期32-35,共4页
Journal of Qiqihar University(Natural Science Edition)
关键词
有向图
最短路径
顶点
权
directed graph
shortest path
vertices
weight
