package containers-data

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

More detailed interface

package containers-data

containers-data
- CCBV
- CCBijection
  - Make
    
    L
    
    R
  - OrderedType
  - S
- CCBitField
  - Make
  - S
- CCCache
- CCDeque
- CCFQueue
- CCFun_vec
- CCGraph
  - Dot
  - Iter
  - Lazy_tree
  - MAP
  - Map
    
    O
  - Traverse
    
    Event
- CCHashSet
  - ELEMENT
  - Make
    
    E
  - S
- CCHashTrie
  - KEY
  - Make
    
    K
  - S
  - Transient
- CCHet
  - Key
  - Map
  - Tbl
- CCImmutArray
- CCIntMap
- CCKTree
  - Dot
  - pset
- CCLazy_list
  - Infix
- CCMixmap
  - Make
    
    X
  - ORD
  - S
- CCMixset
- CCMixtbl
- CCMultiMap
  - BIDIR
  - Make
    
    K
    
    V
  - MakeBidir
    
    L
    
    R
  - OrderedType
  - S
- CCMultiSet
  - Make
    
    O
  - S
- CCMutHeap
  - Make
    
    X
- CCMutHeap_intf
  - RANKED
  - S
- CCPersistentArray
- CCPersistentHashtbl
  - HashedType
  - Make
    
    H
  - S
- CCRAL
  - Infix
- CCRingBuffer
  - Array
    
    Byte
    
    Make
    
    Elt
    
    S
  - Byte
  - Make
    
    Array
    
    X
  - MakeFromArray
    
    A
  - S
    
    Array
- CCSimple_queue
  - Infix
- CCTrie
  - Make
    
    W
  - MakeArray
    
    X
  - MakeList
    
    X
  - ORDERED
  - S
  - String
  - WORD
- CCWBTree
  - KEY
  - Make
    
    X
  - MakeFull
    
    X
  - ORD
  - S
- CCZipper
containers-data.top
- Containers_data_top

Legend:
Library
Module
Module type
Parameter
Class
Class type

More detailed interface

type edge_kind = [

| `Forward
| `Back
| `Cross

]

type ('v, 'e) t = [

| `Enter of 'v * int * ('v, 'e) path
| `Exit of 'v
| `Edge of 'v * 'e * 'v * edge_kind

]

A traversal is a sequence of such events

val get_vertex : ('v, 'e) t -> ('v * [ `Enter | `Exit ]) option

val get_enter : ('v, 'e) t -> 'v option

val get_exit : ('v, 'e) t -> 'v option

val get_edge : ('v, 'e) t -> ('v * 'e * 'v) option

val get_edge_kind : ('v, 'e) t -> ('v * 'e * 'v * edge_kind) option

val dfs : 
  tbl:'v set ->
  eq:('v -> 'v -> bool) ->
  graph:('v, 'e) graph ->
  'v iter ->
  ('v, 'e) t iter_once

Full version of DFS.

parameter eq
equality predicate on vertices.

val dfs_tag : 
  eq:('v -> 'v -> bool) ->
  tags:'v tag_set ->
  graph:('v, 'e) graph ->
  'v iter ->
  ('v, 'e) t iter_once

Full version of DFS using integer tags.

parameter eq
equality predicate on vertices.