summaryrefslogtreecommitdiff
path: root/src/directed_graphs.ads
blob: 925948db3a59fe07dd4e5cb1d558d49d97db63e1 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976


--  This source is licensed under the Sunset License v1.0


pragma Warnings (Off, """Ada.Containers.Helpers"" is an internat GNAT unit");
pragma Warnings (Off, "use of this unit is non-portable and version-dependent");


with

    Ada.Iterator_Interfaces;

private with

    Ada.Containers.Helpers,
    Ada.Finalization,
    Ada.Streams,
    Ada.Containers.Ordered_Maps,
    Ada.Containers.Vectors;


generic

    type Node_ID_Type is (<>);
    type Edge_ID_Type is (<>);

    type Node_Label_Type is private;
    type Edge_Label_Type is private;

    with function "="
           (Left, Right : in Node_ID_Type)
        return Boolean is <>;

    with function "="
           (Left, Right : in Edge_ID_Type)
        return Boolean is <>;

    with function "="
           (Left, Right : in Node_Label_Type)
        return Boolean is <>;

    with function "="
           (Left, Right : in Edge_Label_Type)
        return Boolean is <>;

package Directed_Graphs is


    pragma Preelaborate;
    pragma Remote_Types;




    subtype Extended_Node_ID_Type is Node_ID_Type'Base
        range Node_ID_Type'Pred (Node_ID_Type'First) .. Node_ID_Type'Last;

    No_Node : constant Extended_Node_ID_Type := Extended_Node_ID_Type'First;

    type Node_Array is array (Positive range <>) of Node_ID_Type;

    subtype Path is Node_Array;




    type Edge_Type is record
        ID   : Edge_ID_Type;
        From : Node_ID_Type;
        To   : Node_ID_Type;
    end record;

    type Edge_Array is array (Positive range <>) of Edge_Type;

    function "<"
           (Left, Right : in Edge_Type)
        return Boolean;




    type Graph is tagged private;

    type Cursor is private;
    pragma Preelaborable_Initialization (Cursor);

    No_Element : constant Cursor;

    function Has_Element
           (Position : in Cursor)
        return Boolean;

    function Element
           (Position : in Cursor)
        return Extended_Node_ID_Type;

    package Graph_Iterator_Interfaces is new
        Ada.Iterator_Interfaces (Cursor, Has_Element);

    Empty_Graph : constant Graph;

    overriding function "="
           (Left, Right : in Graph)
        return Boolean;

    function To_Graph
           (Nodes : in Node_Array;
            Edges : in Edge_Array)
        return Graph;

    function To_Cursor
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Cursor;




    procedure Assign
           (Target : in out Graph;
            Source : in     Graph);

    function Copy
           (Source : in Graph)
        return Graph;

    procedure Move
           (Target, Source : in out Graph);




    function Is_Empty
           (Container : in Graph)
        return Boolean;

    procedure Clear
           (Container : in out Graph);

    procedure Clear_Labels
           (Container : in out Graph);




    function Node_Count
           (Container : in Graph)
        return Ada.Containers.Count_Type;

    function Node_Count
           (Container : in Cursor)
        return Ada.Containers.Count_Type;

    function Node_Count_In_Subgraph
           (Position : in Cursor)
        return Ada.Containers.Count_Type;

    function Edge_Count
           (Container : in Graph)
        return Ada.Containers.Count_Type;

    function Edge_Count
           (Container : in Cursor)
        return Ada.Containers.Count_Type;

    function Edge_Count_In_Subgraph
           (Position : in Cursor)
        return Ada.Containers.Count_Type;

    function Nodes
           (Container : in Graph)
        return Node_Array;

    function Nodes
           (Container : in Cursor)
        return Node_Array;

    function Nodes_In_Subgraph
           (Position : in Cursor)
        return Node_Array;

    function Edges
           (Container : in Graph)
        return Edge_Array;

    function Edges
           (Container : in Cursor)
        return Edge_Array;

    function Edges_In_Subgraph
           (Position : in Cursor)
        return Edge_Array;

    procedure Node_Range
           (Container : in     Graph;
            Minimum   :    out Node_ID_Type;
            Maximum   :    out Node_ID_Type);

    function Unused
           (Container : in Graph)
        return Node_ID_Type;

    function Unused
           (Container : in Graph)
        return Edge_ID_Type;

    function Unused
           (Container : in Cursor)
        return Node_ID_Type;

    function Unused
           (Container : in Cursor)
        return Edge_ID_Type;

    function Unused
           (Container : in Graph;
            Count     : in Positive := 1)
        return Node_Array;




    procedure Insert
           (Container : in out Graph;
            Node      : in     Node_ID_Type);

    procedure Insert
           (Container : in out Graph;
            Node      : in     Node_ID_Type;
            Label     : in     Node_Label_Type);

    procedure Insert
           (Container : in Cursor;
            Node      : in Node_ID_Type);

    procedure Insert
           (Container : in Cursor;
            Node      : in Node_ID_Type;
            Label     : in Node_Label_Type);

    procedure Insert
           (Container : in out Graph;
            Nodes     : in     Node_Array);

    procedure Insert
           (Container : in out Graph;
            Edge      : in     Edge_Type);

    procedure Insert
           (Container : in out Graph;
            Edge      : in     Edge_Type;
            Label     : in     Edge_Label_Type);

    procedure Insert
           (Container : in Cursor;
            Edge      : in Edge_Type);

    procedure Insert
           (Container : in Cursor;
            Edge      : in Edge_Type;
            Label     : in Edge_Label_Type);

    procedure Insert
           (Container : in out Graph;
            Edges     : in     Edge_Array);

    procedure Delete
           (Container : in out Graph;
            Node      : in     Node_ID_Type);

    procedure Delete
           (Position : in out Cursor);

    procedure Delete
           (Container : in out Graph;
            Nodes     : in     Node_Array);

    procedure Delete
           (Container : in out Graph;
            Edge      : in     Edge_Type);

    procedure Delete
           (Container : in Cursor;
            Edge      : in Edge_Type);

    procedure Delete
           (Container : in out Graph;
            Edges     : in     Edge_Array);

    procedure Append_Label
           (Container : in out Graph;
            Node      : in     Node_ID_Type;
            Label     : in     Node_Label_Type);

    procedure Append_Label
           (Position : in Cursor;
            Label    : in Node_Label_Type);

    procedure Append_Label
           (Container : in out Graph;
            Edge      : in     Edge_Type;
            Label     : in     Edge_Label_Type);

    procedure Append_Label
           (Container : in Cursor;
            Edge      : in Edge_Type;
            Label     : in Edge_Label_Type);

    procedure Replace_Label
           (Container : in out Graph;
            Node      : in     Node_ID_Type;
            Label     : in     Node_Label_Type);

    procedure Replace_Label
           (Position : in Cursor;
            Label    : in Node_Label_Type);

    procedure Replace_Label
           (Container : in out Graph;
            Edge      : in     Edge_Type;
            Label     : in     Edge_Label_Type);

    procedure Replace_Label
           (Container : in Cursor;
            Edge      : in Edge_Type;
            Label     : in Edge_Label_Type);

    procedure Delete_Label
           (Container : in out Graph;
            Node      : in     Node_ID_Type);

    procedure Delete_Label
           (Position : in Cursor);

    procedure Delete_Label
           (Container : in out Graph;
            Edge      : in     Edge_Type);

    procedure Delete_Label
           (Container : in Cursor;
            Edge      : in Edge_Type);

    procedure Delete_Subgraph
           (Position : in out Cursor);

    procedure Swap
           (Container   : in out Graph;
            Left, Right : in     Node_ID_Type);

    procedure Swap
           (Left, Right : in out Cursor);




    type Node_Label_Constant_Reference
        (Element : not null access constant Node_Label_Type) is private
    with Implicit_Dereference => Element;

    function Constant_Label_Reference
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Node_Label_Constant_Reference;

    function Constant_Label_Reference
           (Position : in Cursor)
        return Node_Label_Constant_Reference;

    type Node_Label_Reference
        (Element : not null access Node_Label_Type) is private
    with Implicit_Dereference => Element;

    function Label_Reference
           (Container : aliased in out Graph;
            Node      : in             Node_ID_Type)
        return Node_Label_Reference;

    function Label_Reference
           (Position : in Cursor)
        return Node_Label_Reference;

    type Edge_Label_Constant_Reference
        (Element : not null access constant Edge_Label_Type) is private
    with Implicit_Dereference => Element;

    function Constant_Label_Reference
           (Container : in Graph;
            Edge      : in Edge_Type)
        return Edge_Label_Constant_Reference;

    function Constant_Label_Reference
           (Container : in Cursor;
            Edge      : in Edge_Type)
        return Edge_Label_Constant_Reference;

    type Edge_Label_Reference
        (Element : not null access Edge_Label_Type) is private
    with Implicit_Dereference => Element;

    function Label_Reference
           (Container : aliased in out Graph;
            Edge      : in             Edge_Type)
        return Edge_Label_Reference;

    function Label_Reference
           (Container : in Cursor;
            Edge      : in Edge_Type)
        return Edge_Label_Reference;




    function Has_Label
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Boolean;

    function Has_Label
           (Position : in Cursor)
        return Boolean;

    function Has_Label
           (Container : in Graph;
            Edge      : in Edge_Type)
        return Boolean;

    function Has_Label
           (Container : in Cursor;
            Edge      : in Edge_Type)
        return Boolean;

    function Label
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Node_Label_Type;

    function Label
           (Position : in Cursor)
        return Node_Label_Type;

    function Label
           (Container : in Graph;
            Edge      : in Edge_Type)
        return Edge_Label_Type;

    function Label
           (Container : in Cursor;
            Edge      : in Edge_Type)
        return Edge_Label_Type;

    function Neighbors
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Node_Array;

    function Neighbors
           (Position : in Cursor)
        return Node_Array;

    function Parents
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Node_Array;

    function Parents
           (Position : in Cursor)
        return Node_Array;

    function Children
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Node_Array;

    function Children
           (Position : in Cursor)
        return Node_Array;

    function Outbound
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Edge_Array;

    function Outbound
           (Position : in Cursor)
        return Edge_Array;

    function Inbound
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Edge_Array;

    function Inbound
           (Position : in Cursor)
        return Edge_Array;

    function Between
           (Container     : in Graph;
            Parent, Child : in Node_ID_Type)
        return Edge_Array;

    function Between
           (Parent, Child : in Cursor)
        return Edge_Array;

    function Outdegree
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Ada.Containers.Count_Type;

    function Outdegree
           (Position : in Cursor)
        return Ada.Containers.Count_Type;

    function Indegree
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Ada.Containers.Count_Type;

    function Indegree
           (Position : in Cursor)
        return Ada.Containers.Count_Type;

    function Degree
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Ada.Containers.Count_Type;

    function Degree
           (Position : in Cursor)
        return Ada.Containers.Count_Type;

    function Has_Edge
           (Container     : in Graph;
            Parent, Child : in Node_ID_Type)
        return Boolean;

    function Has_Edge
           (Parent, Child : in Cursor)
        return Boolean;

    function Has_Labeled_Edge
           (Container     : in Graph;
            Parent, Child : in Node_ID_Type)
        return Boolean;

    function Has_Labeled_Edge
           (Parent, Child : in Cursor)
        return Boolean;

    function Has_Neighbor
           (Container   : in Graph;
            Left, Right : in Node_ID_Type)
        return Boolean;

    function Has_Neighbor
           (Left, Right : in Cursor)
        return Boolean;




    function Find
           (Container : in Graph;
            Label     : in Node_Label_Type)
        return Node_Array;

    function Find
           (Container : in Graph;
            Label     : in Edge_Label_Type)
        return Edge_Array;

    function Find_In_Subgraph
           (Position : in Cursor;
            Label    : in Node_Label_Type)
        return Node_Array;

    function Find_In_Subgraph
           (Position : in Cursor;
            Label    : in Edge_Label_Type)
        return Edge_Array;

    function Contains
           (Container : in Graph;
            Node      : in Node_ID_Type)
        return Boolean;

    function Contains
           (Container : in Graph;
            Node      : in Node_ID_Type;
            Label     : in Node_Label_Type)
        return Boolean;

    function Contains
           (Container : in Graph;
            Edge_ID   : in Edge_ID_Type)
        return Boolean;

    function Contains
           (Container : in Graph;
            Edge      : in Edge_Type)
        return Boolean;

    function Contains
           (Container : in Graph;
            Edge      : in Edge_Type;
            Label     : in Edge_Label_Type)
        return Boolean;

    function Contains_Label
           (Container : in Graph;
            Label     : in Node_Label_Type)
        return Boolean;

    function Contains_Label
           (Container : in Graph;
            Label     : in Edge_Label_Type)
        return Boolean;

    function Contains_In_Subgraph
           (Position : in Cursor;
            Node     : in Node_ID_Type)
        return Boolean;

    function Contains_In_Subgraph
           (Position : in Cursor;
            Node     : in Node_ID_Type;
            Label    : in Node_Label_Type)
        return Boolean;

    function Contains_In_Subgraph
           (Position : in Cursor;
            Edge_ID  : in Edge_ID_Type)
        return Boolean;

    function Contains_In_Subgraph
           (Position : in Cursor;
            Edge     : in Edge_Type)
        return Boolean;

    function Contains_In_Subgraph
           (Position : in Cursor;
            Edge     : in Edge_Type;
            Label    : in Edge_Label_Type)
        return Boolean;

    function Contains_Label_In_Subgraph
           (Position : in Cursor;
            Label    : in Node_Label_Type)
        return Boolean;

    function Contains_Label_In_Subgraph
           (Position : in Cursor;
            Label    : in Edge_Label_Type)
        return Boolean;




    --  Iterates through all Nodes in the Graph in order of Node_ID_Type.
    function Iterate
           (Container : in Graph)
        return Graph_Iterator_Interfaces.Reversible_Iterator'Class;

    --  Iterates through all reachable Nodes in the subgraph in order
    --  of Node_ID_Type. Note that this is NOT the same as the order of
    --  either breadth first or depth first search.
    function Iterate_Subgraph
           (Container : in Graph;
            Position  : in Cursor)
        return Graph_Iterator_Interfaces.Reversible_Iterator'Class;

    function First
           (Container : in Graph)
        return Cursor;

    function Last
           (Container : in Graph)
        return Cursor;

    function Next
           (Position : in Cursor)
        return Cursor;

    procedure Next
           (Position : in out Cursor);

    function Previous
           (Position : in Cursor)
        return Cursor;

    procedure Previous
           (Position : in out Cursor);

    function Follow
           (Position : in Cursor;
            Edge     : in Edge_Type)
        return Cursor;

    function Cursor_To
           (Position : in Cursor;
            Node     : in Node_ID_Type)
        return Cursor;


private


    pragma Inline (Append_Label);
    pragma Inline (Assign);
    pragma Inline (Copy);
    pragma Inline (Degree);
    pragma Inline (Delete_Label);
    pragma Inline (Element);
    pragma Inline (Has_Element);
    pragma Inline (Has_Label);
    pragma Inline (Has_Labeled_Edge);
    pragma Inline (Has_Neighbor);
    pragma Inline (Is_Empty);
    pragma Inline (Label);
    pragma Inline (Move);
    pragma Inline (Replace_Label);
    pragma Inline (To_Cursor);




    --  These need to be replaced with my own nested packages with
    --  separate bodies, as Ada.Containers.Helpers is GNAT-specific
    package Help renames Ada.Containers.Helpers;
    package Impl is new Help.Generic_Implementation;

    package Streams renames Ada.Streams;

    type Node_Adj is record
        Edge_ID : Edge_ID_Type;
        Node_ID : Node_ID_Type;
    end record;

    package Node_Vectors is new Ada.Containers.Vectors
       (Index_Type   => Positive,
        Element_Type => Node_ID_Type);

    package Adj_Vectors is new Ada.Containers.Vectors
       (Index_Type   => Positive,
        Element_Type => Node_Adj);

    package Edge_Vectors is new Ada.Containers.Vectors
       (Index_Type   => Positive,
        Element_Type => Edge_Type);

    use type Node_Vectors.Vector;
    use type Adj_Vectors.Vector;
    use type Ada.Containers.Count_Type;

    package Node_Sort is new Node_Vectors.Generic_Sorting;

    package Node_Maps is new Ada.Containers.Ordered_Maps
       (Key_Type        => Node_ID_Type,
        Element_Type    => Adj_Vectors.Vector);

    package Node_Label_Maps is new Ada.Containers.Ordered_Maps
       (Key_Type        => Node_ID_Type,
        Element_Type    => Node_Label_Type);

    package Edge_Label_Maps is new Ada.Containers.Ordered_Maps
       (Key_Type        => Edge_Type,
        Element_Type    => Edge_Label_Type);




    type Graph is new Ada.Finalization.Controlled with record
        Connections : Node_Maps.Map;
        Node_Labels : Node_Label_Maps.Map;
        Edge_Labels : Edge_Label_Maps.Map;
        Tamper_Info : aliased Help.Tamper_Counts;
    end record;

    overriding procedure Adjust
           (Container : in out Graph);

    overriding procedure Finalize
           (Container : in out Graph);

    procedure Write
           (Stream    : not null access Streams.Root_Stream_Type'Class;
            Container : in              Graph);
    for Graph'Write use Write;

    procedure Read
           (Stream    : not null access Streams.Root_Stream_Type'Class;
            Container :    out          Graph);
    for Graph'Read use Read;

    type Graph_Access is access all Graph;

    Empty_Graph : constant Graph := (Ada.Finalization.Controlled with others => <>);




    type Cursor is record
        Container : Graph_Access;
        Place     : Node_Maps.Cursor;
        Sub_Index : Node_Vectors.Extended_Index;
    end record;

    procedure Write
           (Stream   : not null access Streams.Root_Stream_Type'Class;
            Position : in              Cursor);
    for Cursor'Write use Write;

    procedure Read
           (Stream   : not null access Streams.Root_Stream_Type'Class;
            Position :    out          Cursor);
    for Cursor'Read use Read;

    No_Element : constant Cursor :=
           (Container => null,
            Place     => Node_Maps.No_Element,
            Sub_Index => Node_Vectors.Extended_Index'First);




    subtype Reference_Control_Type is Impl.Reference_Control_Type;

    type Node_Label_Constant_Reference
        (Element : not null access constant Node_Label_Type) is
    record
        Control : Reference_Control_Type :=
            raise Program_Error with "uninitialized reference";
    end record;

    procedure Write
           (Stream : not null access Streams.Root_Stream_Type'Class;
            Item   : in              Node_Label_Constant_Reference);
    for Node_Label_Constant_Reference'Write use Write;

    procedure Read
           (Stream : not null access Streams.Root_Stream_Type'Class;
            Item   :    out          Node_Label_Constant_Reference);
    for Node_Label_Constant_Reference'Read use Read;

    type Node_Label_Reference
        (Element : not null access Node_Label_Type) is
    record
        Control : Reference_Control_Type :=
            raise Program_Error with "uninitialized reference";
    end record;

    procedure Write
           (Stream : not null access Streams.Root_Stream_Type'Class;
            Item   : in              Node_Label_Reference);
    for Node_Label_Reference'Write use Write;

    procedure Read
           (Stream : not null access Streams.Root_Stream_Type'Class;
            Item   :    out          Node_Label_Reference);
    for Node_Label_Reference'Read use Read;

    type Edge_Label_Constant_Reference
        (Element : not null access constant Edge_Label_Type) is
    record
        Control : Reference_Control_Type :=
            raise Program_Error with "uninitialized reference";
    end record;

    procedure Write
           (Stream : not null access Streams.Root_Stream_Type'Class;
            Item   : in              Edge_Label_Constant_Reference);
    for Edge_Label_Constant_Reference'Write use Write;

    procedure Read
           (Stream : not null access Streams.Root_Stream_Type'Class;
            Item   :    out          Edge_Label_Constant_Reference);
    for Edge_Label_Constant_Reference'Read use Read;

    type Edge_Label_Reference
        (Element : not null access Edge_Label_Type) is
    record
        Control : Reference_Control_Type :=
            raise Program_Error with "uninitialized reference";
    end record;

    procedure Write
           (Stream : not null access Streams.Root_Stream_Type'Class;
            Item   : in              Edge_Label_Reference);
    for Edge_Label_Reference'Write use Write;

    procedure Read
           (Stream : not null access Streams.Root_Stream_Type'Class;
            Item   :    out          Edge_Label_Reference);
    for Edge_Label_Reference'Read use Read;




    type Iterator is new Ada.Finalization.Limited_Controlled and
        Graph_Iterator_Interfaces.Reversible_Iterator with
    record
        Container : Graph_Access;
    end record
    with Disable_Controlled => not Impl.T_Check;

    overriding procedure Finalize
           (Object : in out Iterator);

    overriding function First
           (Object : in Iterator)
        return Cursor;

    overriding function Last
           (Object : in Iterator)
        return Cursor;

    overriding function Next
           (Object   : in Iterator;
            Position : in Cursor)
        return Cursor;

    overriding function Previous
           (Object   : in Iterator;
            Position : in Cursor)
        return Cursor;




    type Subgraph_Iterator is new Ada.Finalization.Limited_Controlled and
        Graph_Iterator_Interfaces.Reversible_Iterator with
    record
        Container : Graph_Access;
        Nodes     : Node_Vectors.Vector;
    end record
    with Disable_Controlled => not Impl.T_Check;

    overriding procedure Finalize
           (Object : in out Subgraph_Iterator);

    overriding function First
           (Object : in Subgraph_Iterator)
        return Cursor;

    overriding function Last
           (Object : in Subgraph_Iterator)
        return Cursor;

    overriding function Next
           (Object   : in Subgraph_Iterator;
            Position : in Cursor)
        return Cursor;

    overriding function Previous
           (Object   : in Subgraph_Iterator;
            Position : in Cursor)
        return Cursor;




    generic
        type Base_Type is private;
        type Array_Type is array (Positive range <>) of Base_Type;
        with package Type_Vectors is new Ada.Containers.Vectors
           (Index_Type   => Positive,
            Element_Type => Base_Type);
    function Vector_To_Array
           (Input : in Type_Vectors.Vector)
        return Array_Type;


end Directed_Graphs;