Module approximate 

Approximate fuzzy subgraph matching (Ma, Li & Ma ch 5.3) — find the mapping of a query pattern’s nodes onto a data graph that best matches it, tolerantly and ranked by a fuzzy score. This is the machine-proposes half of “machine proposes closeMatch, signed human ratifies exactMatch”: it returns a mapping and a degree, never a resolved identity (the out-of-band-remainder invariant).

The search reuses optimization::metaheuristics::hill_climbing over node assignments (no new optimizer). Kernel-class Divergent.

Structs

MatchResult

A proposed (never asserted) correspondence: which data node each pattern node maps to, and the fuzzy match score that earned it.

Functions

approximate_match

Find the best correspondence of n_pattern_nodes pattern nodes onto n_data_nodes data nodes by restarts hill-climbing runs from random seeds. Returns the highest-scoring mapping. None on a degenerate problem.