package GuaCaml

  1. Overview
  2. Docs
package GuaCaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
val vertex_map_vtag : ('va -> 'vb) -> ('va, 'e) Type.vertex -> ('vb, 'e) Type.vertex
val graph_map_vtag : ('va -> 'vb) -> ('va, 'e) Type.graph -> ('vb, 'e) Type.graph
val vertex_map_etag : ('ea -> 'eb) -> ('v, 'ea) Type.vertex -> ('v, 'eb) Type.vertex
val graph_map_etag : ('ea -> 'eb) -> ('v, 'ea) Type.graph -> ('v, 'eb) Type.graph
val vertex_map_both : ('va -> 'vb) -> ('ea -> 'eb) -> ('va, 'ea) Type.vertex -> ('vb, 'eb) Type.vertex
val graph_map_both : ('va -> 'vb) -> ('ea -> 'eb) -> ('va, 'ea) Type.graph -> ('vb, 'eb) Type.graph
val transpose : ?reverse:bool -> ('v, 'e) Type.graph -> ('v, 'e) Type.graph
val vertex_list_sons : ?reflexive:bool option -> ('v, 'e) Type.graph -> int list -> int list
val neighbors_set : ('a, 'b) Type.graph -> int list -> int list
val vertex_list_adjacent : ('a, 'b) Type.graph -> int list -> int list
val vertex_list_neighbors : ('a, 'b) Type.graph -> int list -> int list
val internal_vertex_edges_rename : int -> int array -> ('v, 'e) Type.vertex -> ('v, 'e) Type.vertex
val internal_graph_edges_rename : ('v, 'e) Type.graph -> int array -> ('v, 'e) Type.graph
val unop_opgraph : ('v, 'e) Type.opgraph -> ('v, 'e) Type.graph
val vertex_rma_vertices : int array -> ('v, 'e) Type.vertex -> ('v, 'e) Type.vertex
val graph_rma_vertices : int array -> ('v, 'e) Type.graph -> ('v, 'e) Type.graph
val rma_of_rml : int -> int list -> int array
val graph_rml_vertices : int list -> ('v, 'e) Type.graph -> ('v, 'e) Type.graph
val graph_rm_vertex : int -> ('v, 'e) Type.graph -> ('v, 'e) Type.graph
val internal_vertex_edges_oprename : int -> int option array -> ('v, 'e) Type.vertex -> ('v, 'e) Type.vertex
val internal_graph_edges_oprename : ('v, 'e) Type.graph -> int option array -> ('v, 'e) Type.graph
val subgraph : bool array -> ('v, 'e) Type.graph -> ('v, 'e) Type.graph * int option array * int array
val subgraph_array : bool array array -> ('v, 'e) Type.graph -> ('v, 'e) Type.graph array * (int * int) list array * int array array
val vertex_union_edges : ?replace:bool -> ?reflexive_false:bool -> ('v, 'e) Type.vertex -> (int * 'e) list -> ('v, 'e) Type.vertex
val graph_union_edges : ?replace:bool -> ?inplace:bool -> ?reflexive_false:bool -> ('v, 'e) Type.graph -> int list -> (int * 'e) list -> ('v, 'e) Type.graph
val graph_add_clique : ?replace:bool -> ?inplace:bool -> ?reflexive_false:bool -> ('v, 'e) Type.graph -> (int * 'e) list -> ('v, 'e) Type.graph
val graph_is_undirected : ('v, 'e) Type.graph -> bool
val vertex_is_reflexive : ?refl:bool -> ('v, 'e) Type.vertex -> bool
val graph_is_reflexive : ?refl:bool -> ('v, 'e) Type.graph -> bool
val vertex_rm_reflexive : ('v, 'e) Type.vertex -> ('v, 'e) Type.vertex
val graph_rm_reflexive : ('v, 'e) Type.graph -> ('v, 'e) Type.graph
val graph_is_clique : ('v, 'e) Type.graph -> int list -> bool