with

    Ada.Strings.Unbounded,
    Directed_Graphs;


package Graph_Tests is


    package SU renames Ada.Strings.Unbounded;


    type Node_ID is new Positive;
    type Edge_ID is new Positive;
    type Node_Label is new SU.Unbounded_String;
    type Edge_Label is new SU.Unbounded_String;


    package Graphs is new Directed_Graphs
       (Node_ID_Type    => Node_ID,
        Edge_ID_Type    => Edge_ID,
        Node_Label_Type => Node_Label,
        Edge_Label_Type => Edge_Label);


end Graph_Tests;