**diff options**

author | Clifford Wolf <clifford@clifford.at> | 2013-03-02 17:44:17 +0100 |
---|---|---|

committer | Clifford Wolf <clifford@clifford.at> | 2013-03-02 17:44:17 +0100 |

commit | 5bb7578c91807292b6046c1168bd9531f45fa342 (patch) | |

tree | d5148e9950b6c137d3aff865e49fddef0f514905 /libs/subcircuit/README | |

parent | 23eb0ba8bc0a64aedfc0326df8202a96742dea9e (diff) |

More fun with subcircuit mining

Diffstat (limited to 'libs/subcircuit/README')

-rw-r--r-- | libs/subcircuit/README | 15 |

1 files changed, 9 insertions, 6 deletions

diff --git a/libs/subcircuit/README b/libs/subcircuit/README index a2467f6a..f304d2a5 100644 --- a/libs/subcircuit/README +++ b/libs/subcircuit/README @@ -333,16 +333,19 @@ at most maxNodes nodes that occurs at least minMatches times: std::vector<SubCircuit::Solver::MineResult> results; mySolver.mine(results, minNodes, maxNodes, minMatches); -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 -would find all subcircuits with 5 nodes that are found in at least 7 of -the registered graphs: +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 would find +all subcircuits with 5 nodes that are found in at least 7 of the registered +graphs: mySolver.mine(results, 5, 5, 7, 1); Note that this miner is not very efficient and therefore its use is not -recommended for large circuits. +recommended for large circuits. Also note that the miner is working under the +assumption that subgraph isomorphism is bidirectional. This is not the case in +circuits with gates with shorted pins. This can result in undetected frequent +subcircuits in some corner cases. Debugging |