diff options
| author | Clifford Wolf <clifford@clifford.at> | 2013-03-02 14:34:00 +0100 |
|---|---|---|
| committer | Clifford Wolf <clifford@clifford.at> | 2013-03-02 14:34:00 +0100 |
| commit | 8689f5d339c31b542d94ef52c856c3a3938c750c (patch) | |
| tree | 2e174df001fd9a6bccd574884944815d4de1aa80 /libs/subcircuit/README | |
| parent | 84cdfa55fc81c233a308c82c5fa6d482b8661ca0 (diff) | |
subcircuit library: implied allExtern for mining
Diffstat (limited to 'libs/subcircuit/README')
| -rw-r--r-- | libs/subcircuit/README | 4 |
1 files changed, 0 insertions, 4 deletions
diff --git a/libs/subcircuit/README b/libs/subcircuit/README index d1bdb1f6..a2467f6a 100644 --- a/libs/subcircuit/README +++ b/libs/subcircuit/README @@ -333,10 +333,6 @@ at most maxNodes nodes that occurs at least minMatches times: std::vector<SubCircuit::Solver::MineResult> results; mySolver.mine(results, minNodes, maxNodes, minMatches); -The miner works by finding frequent pairs of nodes and then combining them -to larger subcircuits. Because of this incremental strategy the miner only -works as expected on graphs with markAllExtern() set. - The mine() method has an optional fifth parameter that limits the number of matches counted in one graph. This can be useful when mining for circuits that are found in at least a number of graphs. E.g. the following call |