Module `Layered.Make`

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

Parameters

G : TREE

Signature

type t: A tree

type vertex: A vertex of the tree.

module H : Stdlib.Hashtbl.S with type H.key = vertex

val layout : distance:(vertex -> vertex -> float) -> t -> vertex -> Tree_layout.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.