From eee4d26e53a5e33cdb71e9a338154e2dbf18830c Mon Sep 17 00:00:00 2001
From: Alasdair Armstrong
Date: Thu, 16 Aug 2018 17:22:32 +0100
Subject: Use Set rather than Hashtbl in graph.ml

Removes the need for the node type to have a valid Hash function
---
 src/graph.mli | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

(limited to 'src/graph.mli')

diff --git a/src/graph.mli b/src/graph.mli
index 748ce717..11ea63dc 100644
--- a/src/graph.mli
+++ b/src/graph.mli
@@ -61,7 +61,7 @@ module type S =
     type node
     type graph
     type node_set
-       
+
     val leaves : graph -> node_set
 
     val empty : graph
@@ -71,6 +71,8 @@ module type S =
     val add_edge : node -> node -> graph -> graph
     val add_edges : node -> node list -> graph -> graph
 
+    val children : graph -> node -> node list
+
     (** Return the set of nodes that are reachable from the first set
        of nodes (roots), without passing through the second set of
        nodes (cuts). *)
-- 
cgit v1.2.3