package fix

You can search for identifiers within the package.

in-package search v0.2.0

Algorithmic building blocks for memoization, recursion, and more

Install

Dune Dependency

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

Authors

F

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

Maintainers

F

francois.pottier@inria.fr

Sources

archive.tar.gz

md5=75aeb28e58d5a2c8b8c2590d23d1122d

sha512=744b08403beb22d8d960976792dd2f80ee9b47c9b3d3977d98e09aa127c3e21531acb305ab42c734ad1067b0ababa43b251afd3e111d296e3b07fbe2c187b082

doc/fix/Fix/GraphNumbering/index.html

Module `Fix.GraphNumbering`Source

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.