Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::IntersectingSubsetsIterator Class Reference

#include <set_cover_model.h>

Public Member Functions

 IntersectingSubsetsIterator (const SetCoverModel &model, SubsetIndex seed_subset)
 
bool at_end () const
 Returns (true) whether the iterator is at the end.
 
SubsetIndex operator* () const
 Returns the intersecting subset.
 
IntersectingSubsetsIteratoroperator++ ()
 Move the iterator to the next intersecting subset.
 

Detailed Description

The IntersectingSubsetsIterator is a forward iterator that returns the next intersecting subset for a fixed seed_subset. The iterator is initialized with a model and a seed_subset and allows a speedup in getting the intersecting subsets by not storing them in memory. The iterator is at the end when the last intersecting subset has been returned.

Todo
(user): Add the possibility for range-for loops.

Definition at line 304 of file set_cover_model.h.

Constructor & Destructor Documentation

◆ IntersectingSubsetsIterator()

operations_research::IntersectingSubsetsIterator::IntersectingSubsetsIterator ( const SetCoverModel & model,
SubsetIndex seed_subset )
inline

Definition at line 306 of file set_cover_model.h.

Member Function Documentation

◆ at_end()

bool operations_research::IntersectingSubsetsIterator::at_end ( ) const
inline

Returns (true) whether the iterator is at the end.

Definition at line 320 of file set_cover_model.h.

◆ operator*()

SubsetIndex operations_research::IntersectingSubsetsIterator::operator* ( ) const
inline

Returns the intersecting subset.

Definition at line 325 of file set_cover_model.h.

◆ operator++()

IntersectingSubsetsIterator & operations_research::IntersectingSubsetsIterator::operator++ ( )
inline

Move the iterator to the next intersecting subset.

Definition at line 328 of file set_cover_model.h.


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