diff options
| author | Jon French | 2019-03-14 13:56:37 +0000 |
|---|---|---|
| committer | Jon French | 2019-03-14 13:56:37 +0000 |
| commit | 0d88c148a2a068a95b5fc3d5c25b599faf3e75a0 (patch) | |
| tree | cb507bee25582f503ae4047ce32558352aeb8b27 /src/graph.mli | |
| parent | 4f14ccb421443dbc10b88e190526dda754f324aa (diff) | |
| parent | ec8cad1daa76fb265014d3d313173905925c9922 (diff) | |
Merge branch 'sail2' into rmem_interpreter
Diffstat (limited to 'src/graph.mli')
| -rw-r--r-- | src/graph.mli | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/src/graph.mli b/src/graph.mli index 09b78304..02480a9d 100644 --- a/src/graph.mli +++ b/src/graph.mli @@ -71,6 +71,15 @@ 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 |