Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <hamiltonian_path.h>
Public Types | |
typedef Set | SetType |
Public Member Functions | |
SetRangeWithCardinality (int card, int max_card) | |
SetRangeIterator< SetRangeWithCardinality > | begin () const |
STL iterator-related methods. | |
SetRangeIterator< SetRangeWithCardinality > | end () const |
Definition at line 256 of file hamiltonian_path.h.
Set operations_research::SetRangeWithCardinality< Set >::SetType |
Definition at line 258 of file hamiltonian_path.h.
|
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 262 of file hamiltonian_path.h.
|
inline |
STL iterator-related methods.
Definition at line 272 of file hamiltonian_path.h.
|
inline |
Definition at line 275 of file hamiltonian_path.h.