Abstract-A family of distributed algorithms for the dynamic computation of the shortest paths in a computer network or Memet is presented, validated, and analyzed. According to these algorithms, each node maintains a vector with its distance to ever
This document is intended to provide readers who already have experience with general VDM concepts from language manuals [LangManPP] or books [Fitzgerald&05] and/or courses and it is also assumed that the reader has general knowledge about concepts
