All functions |
|
|---|---|
Find all minimally consistent covers of a set subject to the specified DAG constraint |
|
Internal routine to find all rank-1 communities |
|
Internal routine to find all rank-j communities, using a list of rank-1 communities as building blocks |
|
Find all rank-1 communities under an extended DAG |
|
Creates a list of all possible partitions of an extended-choice DAG |
|
From a community, get the indices representing elder nodes |
|
Internal helper function for getting input data |
|
User utility to determine if a specified community is a valid cover |
|
Determines if given adjacency matrix represents a DAG |
|
Determines if a specified community is dominant |
|
Determines if one community is a superset of another |
|
Determines if a specified community is "well-formed" |
|
Main internal routine for enumeration |
|
Returns the S-flags for a given community |
|
TBD |
|
Internal helper function for validating input data |
|
Returns the X-flags for a given community |
|