with Graph_Handler;                      use Graph_Handler;
 
package Mos.classified is
 
   type Network_Type is limited private;
private
 
   type Node_type;
   type Node_Access is access all Node_Type;
   type Connector_Type is array (Positive range <> ) of Node_Access;
   type Connector_Access is access Connector_Type;
   type Node_Type is
      record
         Mos       : Mos_Type;       -- Mos info type ;                           
         Vertex    : Vertex;         -- Graph_Handler.vertex ;                    
         Connector : Connector_Type; -- graph -- connected Mos.Classified.node.   
      end record;
 
   type Network_Type is
      record
         Model : Graph; -- Graphe_Handler.Graph type ;                            
         Root  : Node_Access; -- root data manager.                               
      end record;
end Mos.Classified;

--
   procedure Insert_Vertex
     (Graph : in out Undirected_Graph_Type;
      Element : in Element_Type) is
   begin
      if Graph.N < Max_Vertex and not Graph.Vertexies(Name(Element)).Found then
         Graph.N := Graph.N + 1;
      end if;
      Graph.Vertexies(Name(Element)).Found := True;
      Graph.Vertexies(Name(Element)).Element := Element;
   end Insert_Vertex;