Semantic Clustering of Search Engine Results

Algorithm 1

Shortest path.

let dist be a array of minimum distances initialized to ∞ (infinity)

for each vertex

for each edge ()

  // the weight of the edge ()

for  from 1 to 

 for  from 1 to 

   for  from 1 to 

  if 

  end if