next | previous | forward | backward | up | top | index | toc | Macaulay2 web site

randomHyperGraph(..., BranchLimit => ...) -- limit recursive branching in randomHyperGraph

Synopsis

Description

The randomHyperGraph method follows a backtracking algorithm to generate edges with no inclusions between them. At each step in the recursive tree, randomHyperGraph will make BranchLimit attempts to complete its list of edges. Thus, if a hypergraph with N edges is required, randomHyperGraph may take BranchLimitN steps before terminating. To be more precise, the method is implemented so that it makes BranchLimit + L attempts at level L of the recursion. The default value is 3.

Further information

See also