From 8f896432d18ddaa227c1936467d19b4b78ea63ea Mon Sep 17 00:00:00 2001
From: ccremers <ccremers@4f7d145f-a0d4-0310-ae10-d96cc04433c1>
Date: Wed, 22 Feb 2006 16:58:11 +0000
Subject: [PATCH] - Added some stuff on the new graph code.

---
 src/todo.txt | 13 +++++++++++++
 1 file changed, 13 insertions(+)

diff --git a/src/todo.txt b/src/todo.txt
index 42f7c46..10df0d9 100644
--- a/src/todo.txt
+++ b/src/todo.txt
@@ -12,6 +12,19 @@
   - Make a push-graph structure, where old graphs are simply remembered?
     Does this help at all?
   - Improve the speed of the thing by finally moving to a bit-thing.
+  Required interface:
+  * Abstract graph (node relations)
+    - make_empty_graph of size n (with ->cycle=0)
+    - destroy graph
+    - get_transitive_relation (g,n1,n2) (enforces closure)
+    - set_transitive_relation (g,n1,n2) (sets dirty flag, checks cycle)
+    - has_cycle (g)
+  * High-level (event dependencies)
+    - make_deps for current sys (make_empty+fill), returning cycle flag
+    - destroy_deps(G)
+    - set_deps (G,r1,s1,r2,s2), returning cycle flag
+    - get_deps (G,r1,s1,r2,s2)
+    - get_cycle_flag (G)
 - Simple timestamps could be added by prefixing send message before the
   role, sending any timestamp constants out first to the intruder. These
   should of course be hidden in the output somehow.