FewestNewVerticesTactic chooses RR which adds fewest new vertices to DirectedGraph dg. More...
#include <tactic.h>
Inheritance diagram for libint2::FewestNewVerticesTactic:
Collaboration diagram for libint2::FewestNewVerticesTactic:
Public Member Functions | |
| FewestNewVerticesTactic (const SafePtr< DirectedGraph > &dg) | |
| RR | optimal_rr (const rr_stack &stack) const |
Additional Inherited Members | |
 Public Types inherited from libint2::Tactic | |
| typedef SafePtr< RecurrenceRelation > | RR |
| typedef vector< RR > | rr_stack |
Detailed Description
FewestNewVerticesTactic chooses RR which adds fewest new vertices to DirectedGraph dg.
The documentation for this class was generated from the following files:
- tactic.h
- tactic.cc
