Module lib_dachshund::dachshund::candidate

Structs

Candidate	This data structure contains everything that identifies a candidate (fuzzy) clique. To reiterate, a (fuzzy) clique is a subgraph of edges going from some set of "core" nodes to some set of "non_core" nodes. A "true" clique involves this subgraph being complete, whereas a "fuzzy" clique allows for some edges to be missing. Note that the Candidate data structure itself enforces no such consistency guarantees. It just provides a convenient bookkeeping abstraction with which the search algorithm can work.
LocalDensityGuarantee	This data structure represents a guarantee or promise about the local cliqueness for some core nodes. It should be interpreted as saying "Every core node in a candidate clique has at least 'num_edges' possible edges, except maybe the nodes listed in 'exceptions' ("maybe" because we might not have inspected them yet)."
Recipe	A recipe for a candidate is a checksum of another and a node id. This represents the claim that you can generate the candidate in question by adding node node_id to an existing candidate identified with checksum.