Module Dependencies_matrix_code

type dm = {
  1. matrix : int array array;
  2. i_to_name : Graph_code.node array;
  3. name_to_i : (Graph_code.node, int) Hashtbl.t;
  4. config : config;
}
and config = tree
and tree =
  1. | Node of Graph_code.node * tree list
type partition_constraints = (string, string list) Hashtbl.t
type cell_coord = int * int
val verbose : bool ref
val explain_cell_list_use_edges : cell_coord -> dm -> Graph_code_opti.graph -> (Graph_code.node * Graph_code.node) list
val basic_config : Graph_code.graph -> config
val basic_config_opti : Graph_code_opti.graph -> config
type config_path_elem =
  1. | Expand of Graph_code.node
  2. | Focus of Graph_code.node * deps_style
and deps_style =
  1. | DepsIn
  2. | DepsOut
  3. | DepsInOut
type config_path = config_path_elem list
val string_of_config_path : config_path -> string
val expand_node : Graph_code.node -> tree -> Graph_code.graph -> tree
val expand_node_opti : Graph_code.node -> tree -> Graph_code_opti.graph -> tree
val focus_on_node : Graph_code.node -> deps_style -> tree -> dm -> tree
val is_dead_column : int -> dm -> bool
val is_dead_line : int -> dm -> bool
val is_internal_helper : int -> dm -> bool
val score_upper_triangle : dm -> Graph_code.node list -> int
val score_downer_triangle : dm -> Graph_code.node list -> int
val score_upper_triangle_nodes : dm -> (Graph_code.node * int) list
val score_upper_triangle_cells : dm -> (cell_coord * int) list
val final_nodes_of_tree : tree -> Graph_code.node list
val distance_entity : cell_coord -> Graph_code.node list array -> int
val parents_of_indexes : dm -> Graph_code.node list array
val display : dm -> unit