// One cell in the connection/cost matrix for Warshall's algorithm
// and for Floyd's algorithm.
class PathCell
{
// Default:  cell configuration --- there is no connection
   boolean connected = false;               // ¿ Is there a path ?
   int     distance = Integer.MAX_VALUE/2;  // cost of the path
   String  path = "";                       // listing of vertices

   void initialize ( boolean connected, int distance, String path )
   {
      this.connected = connected;
      this.distance = distance;
      this.path = path;
   }
}