1. Overview
  2. Docs

Full implementation. If the operations in TREE are O(1), the layout functions is O(n).


module G : TREE


module H : Hashtbl.S with type key = G.V.t
val layout : distance:(G.V.t -> G.V.t -> float) -> G.t -> G.V.t -> Common.pos H.t

Same as Tree_layout.Layered.layout, but with the specified implementation.

  • returns

    An Hashtable which contains one binding per accessible vertex in g.