diff options
author | Jed Barber <jjbarber@y7mail.com> | 2020-04-29 19:51:28 +1000 |
---|---|---|
committer | Jed Barber <jjbarber@y7mail.com> | 2020-04-29 19:51:28 +1000 |
commit | 933970ba647117d0c5fe1f4d6c6e66429c2e3ce2 (patch) | |
tree | 017b261dfd92d7924728fcbef93f67dec95506a7 /src/directed_graphs.ads | |
parent | 0966aadcc0e95ddb1fc5e3edfbefe0aaf64d2f76 (diff) |
More fine refactoring
Diffstat (limited to 'src/directed_graphs.ads')
-rw-r--r-- | src/directed_graphs.ads | 11 |
1 files changed, 7 insertions, 4 deletions
diff --git a/src/directed_graphs.ads b/src/directed_graphs.ads index 7039d76..c4d48f7 100644 --- a/src/directed_graphs.ads +++ b/src/directed_graphs.ads @@ -560,14 +560,18 @@ package Directed_Graphs is + -- Iterates through all Nodes in the Graph in order of Node_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_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.Forward_Iterator'Class; + return Graph_Iterator_Interfaces.Reversible_Iterator'Class; function First (Container : in Graph) @@ -627,9 +631,8 @@ private (Index_Type => Positive, Element_Type => Node_Type); - function "=" - (Left, Right : in Node_Vectors.Vector) - return Boolean renames Node_Vectors."="; + use type Node_Vectors.Vector; + use type Ada.Containers.Count_Type; package Node_Sort is new Node_Vectors.Generic_Sorting; |