Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::SetRangeWithCardinality< Set > Class Template Reference

#include <hamiltonian_path.h>

Public Types

typedef Set SetType

Public Member Functions

 SetRangeWithCardinality (int card, int max_card)
SetRangeIterator< SetRangeWithCardinalitybegin () const
 STL iterator-related methods.
SetRangeIterator< SetRangeWithCardinalityend () const

Detailed Description

template<typename Set>
class operations_research::SetRangeWithCardinality< Set >

Definition at line 262 of file hamiltonian_path.h.

Member Typedef Documentation

◆ SetType

template<typename Set>
typedef Set operations_research::SetRangeWithCardinality< Set >::SetType

Definition at line 264 of file hamiltonian_path.h.

Constructor & Destructor Documentation

◆ SetRangeWithCardinality()

template<typename Set>
operations_research::SetRangeWithCardinality< Set >::SetRangeWithCardinality ( int card,
int max_card )
inline

The end_ set is the first set with cardinality card, that does not fit in max_card bits. Thus, its bit at position max_card is set, and the rightmost (card - 1) bits are set.

Definition at line 268 of file hamiltonian_path.h.

Member Function Documentation

◆ begin()

STL iterator-related methods.

Definition at line 278 of file hamiltonian_path.h.

◆ end()

Definition at line 281 of file hamiltonian_path.h.


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