Closed orimarco closed 7 years ago
Given a Node, figure out what is its closest pattern.
Given a set of patterns p_1, ..., p_k and a node n, for each p_i try matching p_i and n:
return p_i which for, d_i is maximal.
Great idea @orimarco, maybe another time.
Indeed, amazing idea: you can advise student how to do it
Given a Node, figure out what is its closest pattern.
Option 1:
Given a set of patterns p_1, ..., p_k and a node n, for each p_i try matching p_i and n:
return p_i which for, d_i is maximal.