diff options
| author | Alasdair Armstrong | 2018-08-16 17:22:32 +0100 |
|---|---|---|
| committer | Alasdair Armstrong | 2018-08-16 17:22:32 +0100 |
| commit | eee4d26e53a5e33cdb71e9a338154e2dbf18830c (patch) | |
| tree | b63a93ec9052f78dd586857cc31bd46d7401d14e /src/graph.mli | |
| parent | d00c376141c62975880a1565931296a257fce97d (diff) | |
Use Set rather than Hashtbl in graph.ml
Removes the need for the node type to have a valid Hash function
Diffstat (limited to 'src/graph.mli')
| -rw-r--r-- | src/graph.mli | 4 |
1 files changed, 3 insertions, 1 deletions
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). *) |