package ocamlgraph

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

package ocamlgraph

ocamlgraph
- Graph
  - Bitv
  - Blocks
    
    BidirectionalLabeled
    
    E
    
    C
    
    HM
    
    I
    
    PV
    
    S
    
    V
    
    VE
    
    BidirectionalMinimal
    
    HM
    
    S
    
    BidirectionalUnlabeled
    
    E
    
    HM
    
    I
    
    PV
    
    S
    
    V
    
    ConcreteVertex
    
    F
    
    X
    
    HM
    
    V
    
    Graph
    
    E
    
    G
    
    E
    
    V
    
    V
    
    HM
    
    Labeled
    
    E
    
    C
    
    HM
    
    I
    
    PV
    
    S
    
    V
    
    VE
    
    Make
    
    Digraph
    
    Abstract
    
    E
    
    G
    
    E
    
    HM
    
    I
    
    PV
    
    S
    
    V
    
    HM
    
    I
    
    PE
    
    PV
    
    S
    
    V
    
    AbstractLabeled
    
    E
    
    G
    
    E
    
    C
    
    HM
    
    I
    
    PV
    
    S
    
    V
    
    VE
    
    HM
    
    I
    
    PE
    
    PV
    
    S
    
    V
    
    Concrete
    
    E
    
    HM
    
    I
    
    PV
    
    S
    
    V
    
    ConcreteBidirectional
    
    E
    
    HM
    
    I
    
    PV
    
    S
    
    V
    
    ConcreteBidirectionalLabeled
    
    E
    
    C
    
    Edge
    
    HM
    
    I
    
    PV
    
    S
    
    V
    
    VE
    
    ConcreteLabeled
    
    E
    
    C
    
    Edge
    
    HM
    
    I
    
    PV
    
    S
    
    V
    
    VE
    
    F
    
    X
    
    Make_Abstract
    
    E
    
    G
    
    E
    
    HM
    
    S
    
    V
    
    HM
    
    I
    
    PE
    
    PV
    
    S
    
    V
    
    Make_Hashtbl
    
    X
    
    Make_Map
    
    X
    
    Minimal
    
    HM
    
    S
    
    Pred
    
    S
    
    PE
    
    PV
    
    TBL_BUILDER
    
    X
    
    Unlabeled
    
    E
    
    HM
    
    I
    
    PV
    
    S
    
    V
  - Builder
    
    I
    
    G
    
    E
    
    V
    
    INT
    
    G
    
    E
    
    V
    
    P
    
    G
    
    E
    
    V
    
    S
    
    G
    
    E
    
    V
  - Classic
    
    I
    
    G
    
    E
    
    V
    
    P
    
    G
    
    E
    
    V
    
    S
  - Cliquetree
    
    CliqueTree
    
    CVS
    
    CliqueTree
    
    E
    
    V
    
    CliqueTreeE
    
    CliqueTreeV
    
    CliqueV
    
    G
    
    E
    
    V
  - Coloring
    
    G
    
    V
    
    GM
    
    Mark
    
    V
    
    Make
    
    G
    
    V
    
    H
    
    Mark
    
    G
    
    Mark
    
    V
  - Components
    
    G
    
    V
    
    Make
    
    G
    
    V
  - Contraction
    
    G
    
    E
    
    V
    
    Make
    
    G
    
    E
    
    V
  - Delaunay
    
    CCC
    
    Float
    
    S
    
    FloatPoints
    
    Int
    
    S
    
    IntPoints
    
    Make
    
    S
    
    Triangulation
    
    S
  - Dot
    
    Parse
    
    B
    
    G
    
    E
    
    V
    
    L
  - Dot_ast
  - Dot_lexer
  - Dot_parser
  - Fixpoint
    
    Analysis
    
    G
    
    E
    
    V
    
    Make
    
    A
    
    G
    
    E
    
    V
  - Flow
    
    FLOW
    
    Ford_Fulkerson
    
    F
    
    G
    
    E
    
    V
    
    G_FORD_FULKERSON
    
    E
    
    V
    
    G_GOLDBERG
    
    E
    
    V
    
    Goldberg
    
    F
    
    G
    
    E
    
    V
  - Gmap
    
    E_DST
    
    E_SRC
    
    E
    
    Edge
    
    G_Dst
    
    G_Src
    
    E
    
    V_DST
    
    V_SRC
    
    V
    
    Vertex
    
    G_Dst
    
    G_Src
    
    V
  - Gml
    
    G
    
    E
    
    V
    
    Parse
    
    B
    
    G
    
    E
    
    V
    
    L
    
    Print
    
    G
    
    E
    
    V
    
    L
  - Graphviz
    
    ATTRIBUTES
    
    CommonAttributes
    
    Dot
    
    X
    
    E
    
    V
    
    DotAttributes
    
    GraphWithDotAttrs
    
    E
    
    V
    
    Neato
    
    X
    
    E
    
    V
    
    NeatoAttributes
  - Heap
    
    Functional
    
    X
    
    FunctionalSig
    
    Imperative
    
    X
    
    Ordered
  - Imperative
    
    Digraph
    
    Abstract
    
    E
    
    Mark
    
    V
    
    AbstractLabeled
    
    E
    
    Mark
    
    V
    
    Concrete
    
    E
    
    V
    
    ConcreteBidirectional
    
    E
    
    V
    
    ConcreteBidirectionalLabeled
    
    E
    
    V
    
    ConcreteLabeled
    
    E
    
    V
    
    Graph
    
    Abstract
    
    E
    
    Mark
    
    V
    
    AbstractLabeled
    
    E
    
    Mark
    
    V
    
    Concrete
    
    E
    
    V
    
    ConcreteLabeled
    
    E
    
    V
    
    Matrix
    
    Digraph
    
    E
    
    V
    
    Graph
    
    E
    
    V
    
    S
    
    E
    
    V
    
    S
    
    Abstract
    
    E
    
    Mark
    
    V
    
    AbstractLabeled
    
    E
    
    Mark
    
    V
    
    Concrete
    
    E
    
    V
    
    ConcreteLabeled
    
    E
    
    V
  - Kruskal
    
    G
    
    E
    
    V
    
    Generic
    
    G
    
    E
    
    V
    
    UF
    
    W
    
    Make
    
    G
    
    E
    
    V
    
    W
    
    UNIONFIND
  - Leaderlist
    
    G
    
    V
    
    Make
    
    G
    
    V
  - Mcs_m
    
    MaximalCardinalitySearch
    
    I
    
    Gr
    
    E
    
    V
    
    P
    
    G
    
    E
    
    V
  - Md
    
    I
    
    G
    
    E
    
    V
    
    P
    
    G
    
    E
    
    V
  - Minsep
    
    G
    
    V
    
    I
    
    G
    
    Mark
    
    V
    
    VSetset
    
    Vertex_Set
    
    MINSEP
    
    G
    
    V
    
    VSetset
    
    Vertex_Set
    
    P
    
    G
    
    V
    
    VSetset
    
    Vertex_Set
  - Nonnegative
    
    Persistent
    
    E
    
    G
    
    E
    
    V
    
    V
    
    W
    
    WEIGHT
  - Oper
    
    Choose
    
    G
    
    I
    
    G
    
    E
    
    V
    
    Make
    
    B
    
    G
    
    E
    
    V
    
    Neighbourhood
    
    G
    
    V
    
    Vertex_Set
    
    P
    
    G
    
    E
    
    V
    
    S
  - Pack
    
    Digraph
    
    Bfs
    
    Classic
    
    Components
    
    Dfs
    
    E
    
    Mark
    
    Marking
    
    PathCheck
    
    Rand
    
    Topological
    
    V
    
    Graph
    
    Bfs
    
    Classic
    
    Components
    
    Dfs
    
    E
    
    Mark
    
    Marking
    
    PathCheck
    
    Rand
    
    Topological
    
    V
  - Path
    
    BellmanFord
    
    G
    
    E
    
    V
    
    H
    
    W
    
    Check
    
    G
    
    V
    
    Dijkstra
    
    G
    
    E
    
    V
    
    W
    
    G
    
    E
    
    V
    
    WEIGHT
  - Persistent
    
    Digraph
    
    Abstract
    
    E
    
    V
    
    AbstractLabeled
    
    E
    
    V
    
    Concrete
    
    E
    
    V
    
    ConcreteBidirectional
    
    E
    
    V
    
    ConcreteBidirectionalLabeled
    
    E
    
    V
    
    ConcreteLabeled
    
    E
    
    V
    
    Graph
    
    Abstract
    
    E
    
    V
    
    AbstractLabeled
    
    E
    
    V
    
    Concrete
    
    E
    
    V
    
    ConcreteLabeled
    
    E
    
    V
    
    S
    
    Abstract
    
    E
    
    V
    
    AbstractLabeled
    
    E
    
    V
    
    Concrete
    
    E
    
    V
    
    ConcreteLabeled
    
    E
    
    V
  - Rand
    
    I
    
    G
    
    E
    
    V
    
    Make
    
    B
    
    G
    
    E
    
    V
    
    P
    
    G
    
    E
    
    V
    
    Planar
    
    I
    
    G
    
    E
    
    V
    
    Make
    
    B
    
    G
    
    E
    
    V
    
    P
    
    G
    
    E
    
    V
    
    S
    
    S
  - Sig
    
    ANY_TYPE
    
    COMPARABLE
    
    EDGE
    
    G
    
    E
    
    V
    
    HASHABLE
    
    I
    
    E
    
    V
    
    IM
    
    E
    
    Mark
    
    V
    
    MARK
    
    ORDERED_TYPE
    
    ORDERED_TYPE_DFT
    
    P
    
    E
    
    V
    
    VERTEX
  - Sig_pack
    
    S
    
    Bfs
    
    Classic
    
    Components
    
    Dfs
    
    E
    
    Mark
    
    Marking
    
    PathCheck
    
    Rand
    
    Topological
    
    V
  - Strat
    
    Algo
    
    G
    
    V
    
    P
    
    S
    
    G
    
    V
    
    PLAYER
    
    STRAT
  - Topological
    
    G
    
    V
    
    Make
    
    G
    
    V
    
    Make_stable
    
    G
    
    V
  - Traverse
    
    Bfs
    
    G
    
    V
    
    Dfs
    
    G
    
    V
    
    G
    
    V
    
    GM
    
    Mark
    
    V
    
    Mark
    
    G
    
    Mark
    
    V
  - Unionfind
    
    HashedOrderedType
    
    Make
    
    X
    
    S
  - Util
    
    CMPProduct
    
    X
    
    Y
    
    DataV
    
    L
    
    V
    
    HTProduct
    
    X
    
    Y
    
    OTProduct
    
    X
    
    Y
  - Version

Legend:
Library
Module
Module type
Parameter
Class
Class type

Parameters

module V : Sig.COMPARABLE

module HM : sig ... end

Signature

module S : sig ... end

module E : sig ... end

type edge = E.t

val mem_edge : ('a * S.t) HM.t -> HM.key -> S.elt -> bool

val mem_edge_e : ('a * S.t) HM.t -> (HM.key * S.elt) -> bool

val find_edge : ('a * S.t) HM.t -> HM.key -> S.elt -> HM.key * S.elt

val find_all_edges : 
  ('a * S.t) HM.t ->
  HM.key ->
  S.elt ->
  (HM.key * S.elt) list

val unsafe_remove_edge : 
  (S.t * S.t) HM.t ->
  HM.key ->
  S.elt ->
  (S.t * S.t) HM.t

val unsafe_remove_edge_e : 
  (S.t * S.t) HM.t ->
  (HM.key * S.elt) ->
  (S.t * S.t) HM.t

val remove_edge : (S.t * S.t) HM.t -> HM.key -> HM.key -> (S.t * S.t) HM.t

val remove_edge_e : (S.t * S.t) HM.t -> (HM.key * HM.key) -> (S.t * S.t) HM.t

val iter_succ : (S.elt -> unit) -> ('a * S.t) HM.t -> HM.key -> unit

val fold_succ : (S.elt -> 'a -> 'a) -> ('b * S.t) HM.t -> HM.key -> 'a -> 'a

val iter_succ_e : 
  ((HM.key * S.elt) -> unit) ->
  ('a * S.t) HM.t ->
  HM.key ->
  unit

val fold_succ_e : 
  ((HM.key * S.elt) -> 'a -> 'a) ->
  ('b * S.t) HM.t ->
  HM.key ->
  'a ->
  'a

val succ : ('a * S.t) HM.t -> HM.key -> S.elt list

val succ_e : ('a * S.t) HM.t -> HM.key -> (HM.key * S.elt) list

val map_vertex : (HM.key -> HM.key) -> (S.t * S.t) HM.t -> (S.t * S.t) HM.t

module I : sig ... end

type t = (S.t * S.t) HM.t

module PV = I.PV

module PE = E

val iter_edges : (HM.key -> S.elt -> unit) -> ('a * S.t) HM.t -> unit

val fold_edges : (HM.key -> S.elt -> 'a -> 'a) -> ('b * S.t) HM.t -> 'a -> 'a

val iter_edges_e : ((HM.key * S.elt) -> unit) -> ('a * S.t) HM.t -> unit

val fold_edges_e : 
  ((HM.key * S.elt) -> 'a -> 'a) ->
  ('b * S.t) HM.t ->
  'a ->
  'a

val iter_pred : (S.elt -> unit) -> (S.t * 'a) HM.t -> HM.key -> unit

val fold_pred : (S.elt -> 'a -> 'a) -> (S.t * 'b) HM.t -> HM.key -> 'a -> 'a

val pred : (S.t * 'a) HM.t -> HM.key -> S.elt list

val in_degree : (S.t * 'a) HM.t -> HM.key -> int

val iter_pred_e : 
  ((S.elt * HM.key) -> unit) ->
  (S.t * 'a) HM.t ->
  HM.key ->
  unit

val fold_pred_e : 
  ((S.elt * HM.key) -> 'a -> 'a) ->
  (S.t * 'b) HM.t ->
  HM.key ->
  'a ->
  'a

val pred_e : (S.t * 'a) HM.t -> HM.key -> (S.elt * HM.key) list