package fix

  1. Overview
  2. Docs
Algorithmic building blocks for memoization, recursion, and more

Install 

dune-project
 Dependency

gitlab.inria.fr Readme Changelog Edit opam file Versions (10)

Authors

  1. F
    François Pottier <francois.pottier@inria.fr>

Maintainers

  1. F
    francois.pottier@inria.fr

Sources

archive.tar.gz
md5=af7099d1cf24654bd379953b8e3d063f
sha512=147bde60a96191f5f0090842df37a12509d78cf6e9dda482fbd000f61215c3d12115854fc331ae39009f26948d6d527187adade160e7ab27a6c4f0d8b324490a

doc/fix/Fix/GraphNumbering/index.html

Module Fix.GraphNumberingSource

This module offers a facility for discovering and numbering the reachable vertices in a finite directed graph.

Sourcemodule Make (M : sig ... end) (G : sig ... end) : sig ... end

Make(M)(G) produces a numbering of the graph G, or more precisely, of the subset of the vertices of G that are reachable from the roots. The type of the vertices must be equipped with an implementation of imperative maps.

Sourcemodule ForOrderedType (T : Map.OrderedType) (G : sig ... end) : sig ... end

ForOrderedType is a special case of Make where it suffices for the vertices of G to be ordered.

Sourcemodule ForHashedType (T : Hashtbl.HashedType) (G : sig ... end) : sig ... end

ForHashedType is a special case of Make where it suffices for the vertices of G to be hashed.

Sourcemodule ForType (T : sig ... end) (G : sig ... end) : sig ... end

ForType is a special case of Make where the vertices of G can have arbitrary type. OCaml's built-in generic equality and hash functions are used.