package TCSLib

You can search for identifiers within the package.

in-package search v0.2.0

TCSLib
- Tcsargs
  - CustomArgs
  - SimpleArgs
- Tcsarray
- Tcsautohelper
- Tcsautomata
  - Alphabet
  - DBA
  - DBVPA
  - DMA
  - DMVPA
  - DPA
  - DPVPA
  - NBA
  - NBVPA
  - NMA
  - NMAFunctions
  - NMVPA
  - NMVPAFunctions
  - NPA
  - NPAFunctions
  - NPVPA
- Tcsautomataparser
- Tcsautotransform
  - DBAtoDPA
  - DBAtoNBA
  - DBAtoNPA
  - DPAtoNBA
  - DPAtoNPA
  - GoodForGamesNBAtoNPA
  - NBAtoDPA
  - NBAtoNPA
  - NPAtoDPA
  - NPAtoNBA
  - NcoBAtoComplementDBA
- Tcsbasedata
  - Bits
  - CompRef
  - Comparators
  - Domain
  - Enumerators
  - Formators
  - Iterators
  - OptionUtils
  - Triple
  - Tuple
  - UniqueIntegerAssignment
- Tcscache
- Tcsctlstarformula
- Tcsformulaparse
- Tcsgameparser
- Tcsgames
- Tcsgraph
- Tcslist
  - IntListUtils
  - ListUtils
- Tcsltlformula
- Tcsltmcformula
- Tcsmaths
  - BigFloat
  - BigInt
  - FloatUtils
  - IntUtils
  - MathField
  - RandomUtils
- Tcsmessage
  - MessageChannel
- Tcsmetaformula
- Tcsmmcformula
- Tcspdlformula
- Tcsqueue
  - QueueUtils
  - SingleOccQueue
- Tcsset
- Tcsstats
  - CustomStats
- Tcsstrings
  - StringUtils
- Tcstiming
- Tcstransitionsys
- Tcstransitionsysparser

Legend:
Library
Module
Module type
Parameter
Class
Class type

type 'a node

type 'a nodes = 'a node Tcsset.TreeSet.t

type 'a digraph

val compare_node : 'a node -> 'a node -> int

val equal_node : 'a node -> 'a node -> bool

val empty_nodes : unit -> 'a nodes

val create : unit -> 'a digraph

val node_count : 'a digraph -> int

val edge_count : 'a digraph -> int

val add_node : 'a digraph -> 'a -> 'a node

val add_empty_node : 'a digraph -> 'a node

val del_node : 'a digraph -> 'a node -> unit

val add_edge : 'a digraph -> 'a node -> 'a node -> unit

val del_edge : 'a digraph -> 'a node -> 'a node -> unit

val get_content : 'a node -> 'a

val set_content : 'a node -> 'a -> unit

val get_fwd_edges : 'a node -> 'a nodes

val get_bwd_edges : 'a node -> 'a nodes

val get_nodes : 'a digraph -> 'a nodes