All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | List of all members
NetworKit::IndependentSetFinder Class Referenceabstract

DEPRECATED: put into code archive, nobody seems to be using it Abstract base class for independent set algorithms. More...

#include <IndependentSetFinder.h>

Public Member Functions

virtual ~IndependentSetFinder ()=default
 Default destructor. More...
 
virtual std::vector< bool > run (const Graph &G)=0
 Returns a boolean vector of length n where vec[v] is true iff v is in the independent sets. More...
 
virtual std::string toString () const
 Get string representation of the algorithm. More...
 
bool isIndependentSet (const std::vector< bool > &set, const Graph &G) const
 Checks whether a set is independent. More...
 

Detailed Description

DEPRECATED: put into code archive, nobody seems to be using it Abstract base class for independent set algorithms.

Constructor & Destructor Documentation

virtual NetworKit::IndependentSetFinder::~IndependentSetFinder ( )
virtualdefault

Default destructor.

Member Function Documentation

bool NetworKit::IndependentSetFinder::isIndependentSet ( const std::vector< bool > &  set,
const Graph G 
) const

Checks whether a set is independent.

Parameters
setThe set which is supposed to be independent.
Thegraph.
Returns
true iff set is independent.
virtual std::vector<bool> NetworKit::IndependentSetFinder::run ( const Graph G)
pure virtual

Returns a boolean vector of length n where vec[v] is true iff v is in the independent sets.

Parameters
[in]GThe graph.
Returns
A boolean vector of length n.

Implemented in NetworKit::Luby.

std::string NetworKit::IndependentSetFinder::toString ( ) const
virtual

Get string representation of the algorithm.

Returns
The string representation of the algorithm.

Reimplemented in NetworKit::Luby.


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