* h_program-lang/dependencies_matrix_code.ml: type

h_program-lang/dependencies_matrix_code.ml

@@ -32,7 +32,11 @@ module G = Graph_code
 (*****************************************************************************)
 
 (* dependency structure matrix *)
-type dm = unit
+type dm = {
+  matrix: int array array;
+  (* could be a tree *)
+  names: Graph_code.node array;
+}
 
 (* list of nodes to expand *)
 type config = Graph_code.node list
@@ -47,11 +51,25 @@ type config = Graph_code.node list
 
 (* poor's man DSM visualizer; use codegraph for a real visualization *)
 let display dm =
-  raise Todo
+  pr2_gen dm;
+  ()
 
 (*****************************************************************************)
 (* Main entry point *)
 (*****************************************************************************)
 
 let build config g =
-  raise Todo
+
+  let top_nodes = G.succ G.root G.Has g in
+
+  (* todo: iterate while in config *)
+  let nodes = top_nodes in
+  let n = List.length nodes in
+
+  let dm = {
+    matrix = Common.make_matrix_init ~nrow:n ~ncolumn:n (fun i j -> 0);
+    names = Array.of_list nodes;
+  }
+  in
+  dm
+

h_program-lang/graph_code.ml

@@ -146,6 +146,17 @@ let load file =
 let has_node n g =
   G.has_node n g.has
 
+let pred n e g =
+  match e with
+  | Has -> G.pred n g.has
+  | Use -> G.pred n g.use
+
+let succ n e g =
+  match e with
+  | Has -> G.succ n g.has
+  | Use -> G.succ n g.use
+
+
 let parent n g =
   let xs = G.pred n g.has in
   Common.list_to_single_or_exn xs

h_program-lang/graph_code.mli

@@ -19,6 +19,8 @@ val add_edge: (node * node) -> edge -> graph -> unit
 
 (* graph access *)
 val has_node: node -> graph -> bool
+val succ: node -> edge -> graph -> node list
+val pred: node -> edge -> graph -> node list
 (* can raise exception *)
 val parent: node -> graph -> node
 val parents: node -> graph -> node list