package fix
Algorithmic building blocks for memoization, recursion, and more
Install
Dune Dependency
Authors
Maintainers
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.
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.
ForOrderedType
is a special case of Make
where it suffices for the vertices of G
to be ordered.
ForHashedType
is a special case of Make
where it suffices for the vertices of G
to be hashed.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>