package ocamlgraph

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Bidirectional graphs

package ocamlgraph

ocamlgraph
- Graph
  - Blocks
    
    BidirectionalLabeled
    
    E
    
    C
    
    HM
    
    I
    
    S
    
    V
    
    VE
    
    BidirectionalMinimal
    
    HM
    
    BidirectionalUnlabeled
    
    E
    
    HM
    
    I
    
    S
    
    V
    
    ConcreteVertex
    
    F
    
    X
    
    HM
    
    V
    
    Graph
    
    G
    
    E
    
    V
    
    HM
    
    Labeled
    
    E
    
    C
    
    HM
    
    I
    
    S
    
    V
    
    VE
    
    Make
    
    Digraph
    
    Abstract
    
    E
    
    G
    
    E
    
    HM
    
    I
    
    PV
    
    S
    
    HM
    
    I
    
    PE
    
    PV
    
    S
    
    V
    
    AbstractLabeled
    
    E
    
    G
    
    E
    
    C
    
    HM
    
    I
    
    PV
    
    S
    
    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
    
    G
    
    E
    
    HM
    
    V
    
    I
    
    Make_Hashtbl
    
    X
    
    Make_Map
    
    X
    
    Minimal
    
    HM
    
    Pred
    
    S
    
    PE
    
    PV
    
    TBL_BUILDER
    
    X
    
    Unlabeled
    
    E
    
    HM
    
    I
    
    S
    
    V
  - Builder
    
    I
    
    G
    
    E
    
    V
    
    INT
    
    G
    
    E
    
    V
    
    P
    
    G
    
    E
    
    V
    
    S
    
    G
    
    E
    
    V
  - ChaoticIteration
    
    Data
    
    G
    
    E
    
    V
    
    Make
    
    D
    
    G
    
    E
    
    V
  - Classic
    
    I
    
    G
    
    E
    
    V
    
    P
    
    G
    
    E
    
    V
    
    S
  - Clique
    
    Bron_Kerbosch
    
    G
    
    V
    
    G
    
    V
  - Cliquetree
    
    CliqueTree
    
    CliqueTree
    
    E
    
    V
    
    CliqueTreeE
    
    CliqueTreeV
    
    CliqueV
    
    G
    
    E
    
    V
  - Coloring
    
    G
    
    V
    
    GM
    
    Mark
    
    V
    
    Make
    
    G
    
    V
    
    Mark
    
    G
    
    Mark
    
    V
  - Components
    
    BiConnectivity
    
    G
    
    E
    
    V
    
    Connectivity
    
    GB
    
    G
    
    E
    
    V
    
    G
    
    V
    
    Make
    
    G
    
    V
    
    U
    
    V
    
    Undirected
    
    G
    
    V
  - Contraction
    
    G
    
    E
    
    V
    
    Make
    
    G
    
    E
    
    V
  - Cycles
    
    Fashwo
    
    GB
    
    G
    
    E
    
    V
  - DGraphModel
    
    DotG
    
    E
    
    V
    
    Make
    
    G
    
    E
    
    V
    
    model
    
    abstract_model
  - DGraphRandModel
    
    G
    
    E
    
    V
    
    GraphAttrs
    
    E
    
    V
  - DGraphSubTree
    
    G
    
    E
    
    V
    
    Make
    
    G
    
    E
    
    V
    
    Tree
    
    E
    
    V
    
    Make_from_dot_model
    
    Tree
    
    E
    
    V
    
    S
    
    Tree
    
    E
    
    V
    
    Tree
    
    E
    
    V
  - DGraphTreeLayout
    
    Make
    
    Tree
    
    E
    
    V
    
    TreeManipulation
    
    MakeFromDotModel
    
    Tree
    
    E
    
    V
    
    TreeManipulation
  - DGraphTreeModel
    
    S
    
    Tree
    
    E
    
    V
    
    TreeManipulation
    
    tree_model
    
    SubTreeDotModelMake
    
    Tree
    
    E
    
    V
    
    TreeManipulation
    
    tree_model
    
    SubTreeMake
    
    G
    
    E
    
    V
    
    Tree
    
    E
    
    V
    
    TreeManipulation
    
    tree_model
  - Delaunay
    
    CCC
    
    Float
    
    FloatPoints
    
    Int
    
    IntPoints
    
    Make
    
    S
    
    Triangulation
    
    S
  - Dominator
    
    G
    
    V
    
    I
    
    V
    
    Make
    
    G
    
    V
    
    Make_graph
    
    G
    
    V
    
    S
  - Dot
    
    Parse
    
    B
    
    G
    
    E
    
    V
    
    L
  - Dot_ast
  - Fixpoint
    
    Analysis
    
    G
    
    E
    
    V
    
    Make
    
    A
    
    G
    
    E
    
    V
  - Flow
    
    FLOW
    
    FLOWMIN
    
    Ford_Fulkerson
    
    F
    
    G
    
    E
    
    V
    
    G_FORD_FULKERSON
    
    E
    
    V
    
    G_GOLDBERG_TARJAN
    
    E
    
    V
    
    Goldberg_Tarjan
    
    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
  - Graphml
    
    G
    
    E
    
    Print
    
    G
    
    E
    
    L
  - Graphviz
    
    ATTRIBUTES
    
    CommonAttributes
    
    Dot
    
    X
    
    E
    
    V
    
    DotAttributes
    
    GraphWithDotAttrs
    
    E
    
    V
    
    Neato
    
    X
    
    E
    
    V
    
    NeatoAttributes
  - 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
  - Merge
    
    B
    
    X
    
    G
    
    E
    
    V
    
    I
    
    G
    
    E
    
    V
    
    P
    
    G
    
    E
    
    V
    
    S
  - Mincut
    
    G
    
    V
    
    Make
    
    G
    
    V
  - Minsep
    
    G
    
    V
    
    I
    
    G
    
    Mark
    
    V
    
    MINSEP
    
    G
    
    V
    
    P
    
    G
    
    V
  - Nonnegative
    
    Imperative
    
    G
    
    E
    
    Mark
    
    V
    
    Mark
    
    W
    
    Persistent
    
    G
    
    E
    
    V
    
    W
  - Oper
    
    Choose
    
    G
    
    I
    
    G
    
    E
    
    V
    
    Make
    
    B
    
    G
    
    E
    
    V
    
    Neighbourhood
    
    G
    
    V
    
    P
    
    G
    
    E
    
    V
    
    S
  - Pack
    
    Digraph
    
    Bfs
    
    Classic
    
    Coloring
    
    Components
    
    Dfs
    
    E
    
    Eulerian
    
    Mark
    
    Marking
    
    PathCheck
    
    Rand
    
    Topological
    
    V
    
    Graph
    
    Bfs
    
    Classic
    
    Coloring
    
    Components
    
    Dfs
    
    E
    
    Eulerian
    
    Mark
    
    Marking
    
    PathCheck
    
    Rand
    
    Topological
    
    V
  - Path
    
    BellmanFord
    
    G
    
    E
    
    V
    
    W
    
    Check
    
    G
    
    V
    
    Dijkstra
    
    G
    
    E
    
    V
    
    W
    
    G
    
    E
    
    V
    
    Johnson
    
    G
    
    E
    
    V
    
    W
    
    WJ
  - 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
  - Prim
    
    G
    
    E
    
    V
    
    Make
    
    G
    
    E
    
    V
    
    W
  - 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
    
    WEIGHT
  - Sig_pack
    
    S
    
    Bfs
    
    Classic
    
    Coloring
    
    Components
    
    Dfs
    
    E
    
    Eulerian
    
    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
  - Util
    
    CMPProduct
    
    X
    
    Y
    
    DataV
    
    L
    
    V
    
    HTProduct
    
    X
    
    Y
    
    Memo
    
    X
    
    OTProduct
    
    X
    
    Y
  - WeakTopological
    
    G
    
    V
    
    Make
    
    G
    
    V
  - XDot
    
    Make
    
    G
    
    E
    
    V
  - XDotDraw

Legend:
Library
Module
Module type
Parameter
Class
Class type

Imperative Directed Graphs.

include S

module Concrete
  (V : Sig.COMPARABLE) : 
  Sig.I
    with type V.t = V.t
     and type V.label = V.t
     and type E.t = V.t * V.t
     and type E.label = unit

Imperative Unlabeled Graphs.

module Abstract
  (V : Sig.ANY_TYPE) : 
  Sig.IM with type V.label = V.t and type E.label = unit

Abstract Imperative Unlabeled Graphs.

module ConcreteLabeled
  (V : Sig.COMPARABLE)
  (E : Sig.ORDERED_TYPE_DFT) : 
  Sig.I
    with type V.t = V.t
     and type V.label = V.t
     and type E.t = V.t * E.t * V.t
     and type E.label = E.t

Imperative Labeled Graphs.

module AbstractLabeled
  (V : Sig.ANY_TYPE)
  (E : Sig.ORDERED_TYPE_DFT) : 
  Sig.IM with type V.label = V.t and type E.label = E.t

Abstract Imperative Labeled Graphs.

Bidirectional graphs

Bidirectional graphs use more memory space (at worse the double) that standard concrete directional graphs. But accessing predecessors is in O(1) amortized instead of O(max(|V|,|E|)) and removing a vertex is in O(D*ln(D)) instead of O(|V|*ln(D)). D is the maximal degree of the graph.

module ConcreteBidirectional
  (V : Sig.COMPARABLE) : 
  Sig.I
    with type V.t = V.t
     and type V.label = V.t
     and type E.t = V.t * V.t
     and type E.label = unit

Imperative Unlabeled, bidirectional graph.

module ConcreteBidirectionalLabeled
  (V : Sig.COMPARABLE)
  (E : Sig.ORDERED_TYPE_DFT) : 
  Sig.I
    with type V.t = V.t
     and type V.label = V.t
     and type E.t = V.t * E.t * V.t
     and type E.label = E.t

Imperative Labeled and bidirectional graph.