diff options
| author | Alasdair Armstrong | 2019-06-04 16:37:48 +0100 |
|---|---|---|
| committer | Alasdair Armstrong | 2019-06-04 16:37:48 +0100 |
| commit | 6d3a6edcd616621eb40420cfb16a34762a32c5c1 (patch) | |
| tree | d3a753af05b4a3d40a5ce0c6eb7711770105caba /src/graph.mli | |
| parent | e24587857d1e61b428d784c699a683984c00ce36 (diff) | |
| parent | 239e13dc149af80f979ea95a3c9b42220481a0a1 (diff) | |
Merge branch 'sail2' into separate_bv
Diffstat (limited to 'src/graph.mli')
| -rw-r--r-- | src/graph.mli | 9 |
1 files changed, 0 insertions, 9 deletions
diff --git a/src/graph.mli b/src/graph.mli index 02480a9d..09b78304 100644 --- a/src/graph.mli +++ b/src/graph.mli @@ -71,15 +71,6 @@ module type S = val add_edge : node -> node -> graph -> graph val add_edges : node -> node list -> graph -> graph - (** Add edges to the graph, but may leave the internal structure - of the graph in a non-normalized state. Fix leaves repairs any - such issue in the graph. These additional functions are much - faster than those above, but it is important to call fix_leaves - before calling reachable, prune, or any other function. *) - val add_edge' : node -> node -> graph -> graph - val add_edges' : node -> node list -> graph -> graph - val fix_leaves : graph -> graph - val children : graph -> node -> node list (** Return the set of nodes that are reachable from the first set |