------------------------------------------------------------------------------
------------------------------------------------------------------------------
--  This Ada package was automatically generated by the software engineering
--tool Platypus
--  see http://cassoulet.univ-brest.fr/mme
--
--  Any modification of this file will be lost.
--  Please see the "platypus" directory instead : it contains the Cheddar's
--  model and its meta-model.
------------------------------------------------------------------------------

------------------------------------------------------------------------------
-- Cheddar is a free real time scheduling tool.
-- This program provides services to automatically check temporal constraints
-- of real time tasks.
--
-- Copyright (C) 2002-2009   Frank Singhoff
-- Cheddar is developed by the LISYC Team, University of Brest
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 2 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program; if not, write to the Free Software
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
--
--
-- Contact : cheddar@listes.univ-brest.fr
--      To post to this mailing list, you must be subscribed
--      (see http//beru.univ-brest.fr/~singhoff/cheddar for details)
--
------------------------------------------------------------------------------
------------------------------------------------------------------------------

with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;

with Objects; use Objects;

with lists;

with Ada.Strings.Unbounded.Text_IO; use Ada.Strings.Unbounded.Text_IO;

with Framework_Config; use Framework_Config;

with Ada.Finalization;

with unbounded_strings; use unbounded_strings;

use unbounded_strings.unbounded_string_list_package;

with Unchecked_Deallocation;

with Text_IO; use Text_IO;

with convert_strings;

with convert_unbounded_strings;

package Generic_Graph.extended is

   procedure initialize (obj : in out graph_ptr);
   procedure initialize (obj : in out generic_edge_ptr);
   procedure initialize (obj : in out generic_node_ptr);

   procedure add_generic_node
     (obj     : in out graph;
      n       : in     generic_node_ptr;
      succeed :    out Boolean);
   procedure add_generic_node
     (obj     : in out graph_ptr;
      n       : in     generic_node_ptr;
      succeed :    out Boolean);

   procedure add_generic_edge
     (obj     : in out graph;
      e       : in     generic_edge_ptr;
      succeed :    out Boolean);
   procedure add_generic_edge
     (obj     : in out graph_ptr;
      e       : in     generic_edge_ptr;
      succeed :    out Boolean);

   function edge_in_graph
     (obj : in generic_edge_ptr;
      g   : in graph) return Boolean;
   function edge_in_graph
     (obj   : in generic_edge_ptr;
      g_ptr : in graph_ptr) return Boolean;

   function node_in_graph
     (obj : in generic_node_ptr;
      g   : in graph) return Boolean;
   function node_in_graph
     (obj   : in generic_node_ptr;
      g_ptr : in graph_ptr) return Boolean;

end Generic_Graph.extended;