Forbids an edge within a match. More...
#include <MC_Edge.hh>
Public Member Functions | |
virtual MC_NoEdge * | clone (void) const |
virtual bool | isConstrainedLabel (const std::string &label) const |
virtual bool | isConstraining (const size_t nodeID) const |
virtual bool | isValidMatch (const Pattern_Interface &pattern, const Graph_Interface &target, const Match &match) const |
MC_NoEdge () | |
MC_NoEdge (const MC_NoEdge &toCopy) | |
MC_NoEdge (const size_t constrainedFromID, const size_t constrainedToID) | |
virtual bool | operator== (const Match_Constraint &toCompare) const =0 |
virtual bool | operator== (const Match_Constraint &toCompare) const |
virtual MC_NoEdge * | remap (const Match &old2newIndexMapping, const size_t unmatchedIndex=UINT_MAX) |
virtual | ~MC_NoEdge () |
destruction More... | |
Data Fields | |
size_t | constrainedFromID |
the source ID of the edge to be constrained More... | |
size_t | constrainedToID |
the target ID of the edge to be constrained More... | |
This match constraint defines a given edge is NOT PRESENT within the target graph. Current idea of GML encoding:
***************************************************** constrainNoEdge [ source ::= INTEGER target ::= INTEGER ] *****************************************************
Definition at line 145 of file MC_Edge.hh.
|
inline |
Default construction of the match constraint : undefined values are initialized with INT_MAX
Definition at line 158 of file MC_Edge.hh.
|
inline |
Copy construction of the match constraint
Definition at line 165 of file MC_Edge.hh.
|
inline |
Construction of the match constraint
constrainedFromID | the index of the source node |
constrainedToID | the index of the target node |
Definition at line 175 of file MC_Edge.hh.
|
inlinevirtual |
Definition at line 183 of file MC_Edge.hh.
|
inlinevirtual |
Creates a new MC_NoEdge heap object that equals the current object. NOTE: YOU have to delete it later on! There is no garbage collection!
Implements sgm::MC_Edge.
Definition at line 230 of file MC_Edge.hh.
|
inlinevirtual |
Checks whether or not a given label is part of the constraint information. This check is needed by some parsers to verify the wildcard definition.
label | the label of interest |
Implements sgm::Pattern_Interface::Match_Constraint.
Definition at line 215 of file MC_Edge.hh.
|
inlinevirtualinherited |
Checks whether or not this constraint covers the node with the given ID.
nodeID | the ID of the node of interest |
Implements sgm::Pattern_Interface::Match_Constraint.
Definition at line 69 of file MC_Edge.hh.
|
inlinevirtual |
Checks whether or not a match on a given target fullfills the additional NO-EDGE constraint for the pattern matching.
pattern | the pattern graph that was matched |
target | the target graph the pattern was matched on |
match | the match information for the left side pattern of the pattern on the target graph |
Implements sgm::Pattern_Interface::Match_Constraint.
Definition at line 199 of file MC_Edge.hh.
|
pure virtualinherited |
Equality comparison to another match constraint.
toCompare | the constraint to compare to |
Implemented in sgm::MC_Node.
|
inlinevirtual |
Equality comparison to another match constraint.
toCompare | the constraint to compare to |
Reimplemented from sgm::MC_Edge.
Definition at line 280 of file MC_Edge.hh.
|
inlinevirtual |
Creates a new MC_NoEdge heap object that equals the current object but uses the new indices given by old2newIndexMapping. NOTE: YOU have to delete it later on! There is no garbage collection!
old2newIndexMapping | the index mapping to be used for the remapping |
unmatchedIndex | an optional specific index that marks unmatched nodes within old2newIndexMapping. if this constrains one of these nodes, no remapping is done and NULL is returned |
Implements sgm::MC_Edge.
Definition at line 251 of file MC_Edge.hh.
|
inherited |
Definition at line 33 of file MC_Edge.hh.
|
inherited |
Definition at line 36 of file MC_Edge.hh.