Macaulay2 » Documentation
Packages » EdgeIdeals :: randomHyperGraph(...,BranchLimit=>...)
next | previous | forward | backward | up | index | toc

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

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 BranchLimit^N 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.

See also

Functions with optional argument named BranchLimit:

Further information

  • Default value: 3
  • Function: randomHyperGraph -- returns a random hypergraph
  • Option key: BranchLimit -- optional argument for randomHyperGraph

The source of this document is in EdgeIdeals.m2:4266:0.