*/

  */

 #ifndef LEMON_FLOYD_WARSHALL_H

 #ifndef LEMON_FLOYD_WARSHALL_H

 #define LEMON_FLOYD_WARSHALL_H

 #define LEMON_FLOYD_WARSHALL_H

 /// \file

 /// \file

 /// \brief FloydWarshall algorithm.

 /// \brief FloydWarshall algorithm.

 ///

 ///

 #include <lemon/list_graph.h>

 #include <lemon/list_graph.h>

   };

   };

   /// \brief %FloydWarshall algorithm class.

   /// \brief %FloydWarshall algorithm class.

   ///

   ///

   /// This class provides an efficient implementation of \c Floyd-Warshall 

   /// This class provides an efficient implementation of \c Floyd-Warshall 

   /// algorithm. The edge lengths are passed to the algorithm using a

   /// algorithm. The edge lengths are passed to the algorithm using a

   /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any 

   /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any 

   /// kind of length.

   /// kind of length.

   ///

   ///