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 std::shared_ptr< DirectedGraph > &dg)

RR	optimal_rr (const rr_stack &stack) const

Additional Inherited Members
Public Types inherited from libint2::Tactic
typedef std::shared_ptr< RecurrenceRelation >	RR

typedef std::vector< RR >	rr_stack

Static Public Member Functions inherited from libint2::Tactic
static constexpr bool	class_debug ()

Detailed Description

FewestNewVerticesTactic chooses RR which adds fewest new vertices to DirectedGraph dg.

Member Function Documentation

FewestNewVerticesTactic::RR FewestNewVerticesTactic::optimal_rr ( const rr_stack & stack ) const

virtual

The documentation for this class was generated from the following files: