Module SmallModels.Hypergraph

type t = {
  1. graph : SL_graph.t;
  2. hyper_edges : Hyperedge.Set.t;
}
val equal : t -> t -> bool
val compare : t -> t -> int
val show : t -> string
val of_inductive_def : InductiveDefinition.t -> SL.Term.t list -> t

Create a singleton hyper-edge representing inductive predicate call.

val of_formula : SL.t -> t
val disjoint_union : t -> t -> t
val size : t -> int
val is_graph : t -> bool
val to_graph : t -> SL_graph.t
val unfold : base_only:bool -> t -> t list

Unfolding