|
| HsTreeNode (const std::unordered_set< int > &x, const std::vector< std::unordered_set< int >> &s) |
|
size_t | size () const |
|
bool | isHittingSet () const |
|
void | add (const HsTreeNode &node) |
|
void | expandNode () |
|
std::string | toDot () |
|
Add a new hitting set tree node to this node's children
- Parameters
-
bool HsTreeNode::isHittingSet |
( |
| ) |
const |
Check whether or not, it is a hitting set
- Returns
- true if is a hitting set, false otherwise
size_t HsTreeNode::size |
( |
| ) |
const |
Getter for the size of the hitting set
- Returns
- The size of the hitting set
std::string HsTreeNode::toDot |
( |
| ) |
|
Create a dot file representing the hitting set (by calling this method recursively on its children)
- Returns
- A string containing the representation
std::unordered_set< int > HsTreeNode::hSmallest |
|
static |
int HsTreeNode::maxNodeNum = 0 |
|
static |
The number of hitting set tree nodes already created
The documentation for this class was generated from the following files:
- /Users/janpeleska/SharedFoldersWin/fsmlib-cpp/src/sets/HsTreeNode.h
- /Users/janpeleska/SharedFoldersWin/fsmlib-cpp/src/sets/HsTreeNode.cpp