**F. Aurenhammer and J. Hagauer**

For two edges and of a connected graph let iff
. Here
denotes the length of a shortest path in joining vertices and . An
algorithm is presented that computes the equivalence classes induced on
by the transitive closure of in time and
space . Finding the equivalence classes of is the
primary step of several graph algorithms.