Module Gbs

Basic interface to the Glasgow Subgraph Solver (GBS), an efficient solver for induced and non-induced subgraph isomorphism.

References

type node = {
  1. ident : int;
  2. lbl : string;
  3. name : string;
  4. in_deg : int list;
  5. out_deg : int list;
}

Flattened node representation

type t = {
  1. nodes : node list;
  2. adj : (int * int) list;
}

Type of flattened digraphs

val sols_to_str : ((int * int) list * (int * int) list * (int * int) list) list -> string
val match_one : t -> t -> ((int * int) list * (int * int) list * (int * int) list) list
val match_all : t -> t -> ((int * int) list * (int * int) list * (int * int) list) list
val equal : t -> t -> bool
val count_sols : t -> t -> int
val search_time : unit -> float