EFFICIENT ASYNCHRONIZED GRAPH ALGORITHMS AND ADA CODING
高效异步并行图算法及ADA的实现

In this paper, both a sequential and an asynchronised algorithm to compute the all pair shortest distance matrix D and the path matrix P are given. This result is applied to develop other asynchronized graph algorithms. The main steps to code these asynchronised algorithms in ADA are introduced.