Abstract base class for independent set algorithms.
Checks whether a given set is an independent set in graph G.
G (networkit.Graph) – The input graph.
nodeSet (list(bool)) – Input list, where each entry represents a node. If entry is True, the node is part of the set; False if not.
Returns a list, where an entry indicates whether node i is part of an independent set.
G (networkit.Graph) – The graph.
A list of bools.
Luby’s parallel maximal independent set algorithm.