An optimal algorithm for MoJo distance

Effective comparison of different decompositions of a software system is integral for the evaluation of software clustering algorithms. One of the approaches that has been developed to tackle this issue is the MoJo distance measure. The original algorithm for the computation of MoJo distance was a heuristic one that only approximated the exact value. In this paper we introduce an algorithm that calculates the exact distance in polynomial time. We also present experiments that showcase that the new algorithm calculates MoJo distance more accurately and efficiently than before.