#include <Rule.hh>
Public Types | |
typedef std::set< std::string > | LabelSet |
the type that defines a set of labels More... | |
Public Member Functions | |
bool | operator< (const RuleCnP &larger) const |
RuleCnP () | |
RuleCnP (const size_t source, const size_t pasteID) | |
RuleCnP (const size_t source, const size_t pasteID, const size_t target) | |
RuleCnP (const size_t source, const size_t pasteID, const LabelSet &edgeLabels) | |
RuleCnP (const size_t source, const size_t pasteID, const size_t target, const LabelSet &edgeLabels) | |
Data Fields | |
LabelSet | edgeLabels |
size_t | pasteID |
the node where the dangling edges will be reconnected to More... | |
size_t | source |
size_t | target |
optional: the target id of the edges to copy-and-paste More... | |
Class to define copy-and-Paste operations for adjacent edges of nodes to be removed. They are used to relink dangling edges to other nodes of the result graph.
typedef std::set< std::string > ggl::Rule::RuleCnP::LabelSet |
ggl::Rule::RuleCnP::RuleCnP | ( | ) |
Default construction initializting with INT_MAX
ggl::Rule::RuleCnP::RuleCnP | ( | const size_t | source, |
const size_t | pasteID | ||
) |
Construction
source | the node that will be deleted and which is the source of the dangling edges |
pasteID | the node where the dangling edges will be reconnected to |
ggl::Rule::RuleCnP::RuleCnP | ( | const size_t | source, |
const size_t | pasteID, | ||
const size_t | target | ||
) |
Construction
source | the node that will be deleted and which is the source of the dangling edges |
pasteID | the node where the dangling edges will be reconnected to |
target | the target node id of the edges to copy-and-paste |
ggl::Rule::RuleCnP::RuleCnP | ( | const size_t | source, |
const size_t | pasteID, | ||
const LabelSet & | edgeLabels | ||
) |
Construction
source | the node that will be deleted and which is the source of the dangling edges |
pasteID | the node where the dangling edges will be reconnected to |
edgeLabels | the labels of edges that have to be copy-and-pasted; if the set is empty, all edges will be copied. |
ggl::Rule::RuleCnP::RuleCnP | ( | const size_t | source, |
const size_t | pasteID, | ||
const size_t | target, | ||
const LabelSet & | edgeLabels | ||
) |
Construction
source | the node that will be deleted and which is the source of the dangling edges |
pasteID | the node where the dangling edges will be reconnected to |
target | the target node id of the edges to copy-and-paste |
edgeLabels | the labels of edges that have to be copy-and-pasted; if the set is empty, all edges will be copied. |
bool ggl::Rule::RuleCnP::operator< | ( | const RuleCnP & | larger | ) | const |
Order comparison: this object is smaller iff (this.source < larger.source) or (this.source == larger.source and this.target < larger.target).
larger | the copy-and-paste object to compare to |
LabelSet ggl::Rule::RuleCnP::edgeLabels |
size_t ggl::Rule::RuleCnP::source |