/// The algorithm computes

     /// The algorithm computes

     /// - The shortest path tree for each node.

     /// - The shortest path tree for each node.

     /// - The distance between each node pairs.

     /// - The distance between each node pairs.

     ///

     ///

     /// \note d.run(s) is just a shortcut of the following code.

     /// \note d.run(s) is just a shortcut of the following code.

     ///  d.init();

     ///  d.init();

     ///  d.start();

     ///  d.start();

     void run() {

     void run() {

       init();

       init();

       start();

       start();

     }

     }