package containers-data

You can search for identifiers within the package.

in-package search v0.2.0

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

type ('v, 'e) path = ('v * 'e * 'v) list

val generic : 
  tbl:'v set ->
  bag:'v bag ->
  graph:('v, 'e) t ->
  'v iter ->
  'v iter_once

Traversal of the given graph, starting from a sequence of vertices, using the given bag to choose the next vertex to explore. Each vertex is visited at most once.

val generic_tag : 
  tags:'v tag_set ->
  bag:'v bag ->
  graph:('v, 'e) t ->
  'v iter ->
  'v iter_once

One-shot traversal of the graph using a tag set and the given bag.

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

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

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

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

val dijkstra : 
  tbl:'v set ->
  ?dist:('e -> int) ->
  graph:('v, 'e) t ->
  'v iter ->
  ('v * int * ('v, 'e) path) iter_once

Dijkstra algorithm, traverses a graph in increasing distance order. Yields each vertex paired with its distance to the set of initial vertices (the smallest distance needed to reach the node from the initial vertices).

parameter dist
distance from origin of the edge to destination, must be strictly positive. Default is 1 for every edge.

val dijkstra_tag : 
  ?dist:('e -> int) ->
  tags:'v tag_set ->
  graph:('v, 'e) t ->
  'v iter ->
  ('v * int * ('v, 'e) path) iter_once

module Event : sig ... end