package ocamlgraph

  1. Overview
  2. Docs
A generic graph library for OCaml

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (4)

Authors

  1. S
    Sylvain Conchon
  2. J
    Jean-Christophe Filliâtre
  3. J
    Julien Signoles

Maintainers

  1. J
    jean-christophe.filliatre@cnrs.fr

Sources

ocamlgraph-2.2.0.tbz
sha256=b0956210863cc24f480203ba3c2ef06dfae5579536a05744364e7de58822b230
sha512=257cdd5fb90337b3e3682cade1269c1d181f3124e569a731909f49bbfbe581ab529ac401472fb9ef57166ac34d8ebadfa6a32c93665f38f5a335982d5e5dc0e1

doc/ocamlgraph/Graph/Rand/Make/index.html

Module Rand.MakeSource

Random graphs

Parameters

module B : Builder.INT

Signature

Sourcetype graph = B.G.t
Sourcetype vertex = B.G.V.t
Sourcetype edge_label = B.G.E.label
Sourceval graph : ?loops:bool -> v:int -> e:int -> unit -> graph

graph v e generates a random graph with exactly v vertices and e edges. Vertices are labeled with 0 ... v-1. The boolean loops indicates whether loops are allowed; default value is no loop (false).

Sourceval labeled : (vertex -> vertex -> edge_label) -> ?loops:bool -> v:int -> e:int -> unit -> graph

labeled f is similar to graph except that edges are labeled using function f.

The two functions above actually make a choice between two different implementations according to the ratio e/(v*v). When this ratio is small, random_few_edges is selected; otherwise random_many_edges is selected.

Sourceval random_few_edges : loops:bool -> v:int -> e:int -> graph
Sourceval random_many_edges : loops:bool -> v:int -> e:int -> graph
Sourceval gnp : ?loops:bool -> v:int -> prob:float -> unit -> graph

random graph using the G(n,p) model. gnp v prob generates a random graph with exactly v vertices and where each edge is selected with probability prob

Sourceval gnp_labeled : (vertex -> vertex -> edge_label) -> ?loops:bool -> v:int -> prob:float -> unit -> graph

gnp_labeled add_edge v e is similar to gnp except that edges are labeled using function f.