module InsnNodes = struct
  type t = (mem * insn)
  let compare hit1 hit2 =
    let mem1, insn1 = hit1 in
    let mem2, insn2 = hit2 in
    Insn.compare insn1 insn2
  let hash insn = 0
  let equal insn1 insn2 = false
end

module ProbabilisticEdges = struct
  type t = float
  let compare = Float.compare
  let default = 0.0
end

module G = Graph.Imperative.Digraph.ConcreteBidirectionalLabeled
    (InsnNodes)(ProbabilisticEdges)