package prbnmcn-stats

You can search for identifiers within the package.

in-package search v0.2.0

package prbnmcn-stats

prbnmcn-stats
- CHANGES
- LICENSE
- README
- Library prbnmcn-stats
  - Stats
    
    Stats_intf
    
    Stateful_PRNG
    
    Gen
    
    Infix
    
    Rational
    
    Fin_dist
    
    Graph
    
    V
    
    Fin
    
    Float
    
    Dist
    
    Rational
    
    Dist
    
    Emp
    
    Empirical_statistics
    
    Float
    
    Rational
    
    Gen
    
    Make
    
    Infix
    
    Rational
    
    Infix
    
    Rational
    
    Pdfs
    
    Combi
    
    Mh
    
    MH_parameters
    
    Make_core_sampling_loop
    
    Make
    
    Finbij
    
    S
    
    Make
    
    Graph
    
    Dist
    
    Graph_statistics
    
    Undirected_edge
    
    Table
    
    Vertex_set
    
    Vertex_table
    
    Vertex_bij
    
    Tree
    
    Make
    
    Undirected_edge
    
    Table
    
    Vertex_set
    
    Vertex_table
    
    Vertex_bij
    
    Tree
    
    Log_space
    
    Binning
    
    Specfun
    
    Int_table
    
    String_table
    
    Float_table
- Sources
  - prbnmcn-stats
    
    alias.ml
    
    binning.ml
    
    combi.ml
    
    emp.ml
    
    fin.ml
    
    fin_dist.ml
    
    finbij.ml
    
    gen.ml
    
    graph.ml
    
    helpers.ml
    
    log_space.ml
    
    mh.ml
    
    pdfs.ml
    
    result.ml
    
    specfun.ml
    
    stats.ml
    
    stats__.ml
    
    stats_intf.ml
    
    tools.ml
    
    vec.ml

Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module `Stats.Graph`Source

Basic statistics on graphs (experimental)

Sourcemodule Dist : sig ... end

Dist handles distances between vertices. The distance between two vertices is the length of a shortest path between those vertices.

Sourcemodule type Graph_statistics = sig ... end

module Make
  (Graph : Stats_intf.Graph) : 
  Graph_statistics with type t = Graph.t and type vertex = Graph.vertex

Graph statistics generic on an undirected Graph implementation.