package camllib

  1. Overview
  2. Docs
package camllib
Legend:
Library
Module
Module type
Parameter
Class
Class type
val attrvertex : ('a, 'b) compare -> ('a, 'c, 'd, 'e, 'f) graph -> 'a -> 'd
val attrhedge : ('a, 'b) compare -> ('c, 'b, 'd, 'e, 'f) graph -> 'b -> 'e
val is_vertex : ('a, 'b) compare -> ('a, 'c, 'd, 'e, 'f) graph -> 'a -> bool
val is_hedge : ('a, 'b) compare -> ('c, 'b, 'd, 'e, 'f) graph -> 'b -> bool
val succhedge : ('a, 'b) compare -> ('a, 'c, 'd, 'e, 'f) graph -> 'a -> 'c Sette.t
val predhedge : ('a, 'b) compare -> ('a, 'c, 'd, 'e, 'f) graph -> 'a -> 'c Sette.t
val succvertex : ('a, 'b) compare -> ('c, 'b, 'd, 'e, 'f) graph -> 'b -> 'c array
val predvertex : ('a, 'b) compare -> ('c, 'b, 'd, 'e, 'f) graph -> 'b -> 'c array
val succ_vertex : ('a, 'b) compare -> ('a, 'b, 'c, 'd, 'e) graph -> 'a -> 'a Sette.t
val pred_vertex : ('a, 'b) compare -> ('a, 'b, 'c, 'd, 'e) graph -> 'a -> 'a Sette.t
val add_vertex : ('a, 'b) compare -> ('a, 'c, 'd, 'e, 'f) graph -> 'a -> 'd -> unit
val add_hedge : ('a, 'b) compare -> ('a, 'b, 'c, 'd, 'e) graph -> 'b -> 'd -> pred:'a array -> succ:'a array -> unit
val replace_attrvertex : ('a, 'b) compare -> ('a, 'c, 'd, 'e, 'f) graph -> 'a -> 'd -> unit
val replace_attrhedge : ('a, 'b) compare -> ('a, 'b, 'c, 'd, 'e) graph -> 'b -> 'd -> unit
val remove_hedge : ('a, 'b) compare -> ('a, 'b, 'c, 'd, 'e) graph -> 'b -> unit
val remove_vertex : ('a, 'b) compare -> ('a, 'b, 'c, 'd, 'e) graph -> 'a -> unit
val topological_sort : ('a, 'b) compare -> ?priority:'b priority -> ('a, 'b, 'c, 'd, 'e) t -> 'a -> 'a list
val topological_sort_multi : ('a, 'b) compare -> 'a -> 'b -> ?priority:'b priority -> ('a, 'b, 'c, 'd, 'e) t -> 'a Sette.t -> 'a list
val reachable : ('a, 'b) compare -> ?filter:('b -> bool) -> ('a, 'b, 'c, 'd, 'e) t -> 'a -> 'a Sette.t * 'b Sette.t
val reachable_multi : ('a, 'b) compare -> 'a -> 'b -> ?filter:('b -> bool) -> ('a, 'b, 'c, 'd, 'e) t -> 'a Sette.t -> 'a Sette.t * 'b Sette.t
val cfc : ('a, 'b) compare -> ?priority:'b priority -> ('a, 'b, 'c, 'd, 'e) graph -> 'a -> 'a list list
val cfc_multi : ('a, 'b) compare -> ?priority:'b priority -> 'a -> 'b -> ('a, 'b, 'c, 'd, 'e) graph -> 'a Sette.t -> 'a list list
val scfc : ('a, 'b) compare -> ?priority:'b priority -> ('a, 'b, 'c, 'd, 'e) graph -> 'a -> (unit, 'a) Ilist.t
val scfc_multi : ('a, 'b) compare -> 'a -> 'b -> ?priority:'b priority -> ('a, 'b, 'c, 'd, 'e) graph -> 'a Sette.t -> (unit, 'a) Ilist.t
val print : ('a, 'b) compare -> (Format.formatter -> 'a -> unit) -> (Format.formatter -> 'b -> unit) -> (Format.formatter -> 'c -> unit) -> (Format.formatter -> 'd -> unit) -> (Format.formatter -> 'e -> unit) -> Format.formatter -> ('a, 'b, 'c, 'd, 'e) graph -> unit
val min : ('a, 'b) compare -> ('a, 'c, 'd, 'e, 'f) graph -> 'a Sette.t
val max : ('a, 'b) compare -> ('a, 'c, 'd, 'e, 'f) graph -> 'a Sette.t