Generated on Wed Apr 29 2015 11:51:41 for GGL-4.1.2 by doxygen 1.8.3.1
Public Member Functions | Data Fields
sgm::MC_NoEdge Class Referenceabstract

Forbids an edge within a match. More...

#include <MC_Edge.hh>

Inheritance diagram for sgm::MC_NoEdge:
Inheritance graph
[legend]

Public Member Functions

virtual MC_NoEdgeclone (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_NoEdgeremap (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...
 

Detailed Description

     This match constraint defines a given edge is NOT PRESENT within the
     target graph.

     Current idea of GML encoding:
*****************************************************
 constrainNoEdge [
   source   ::= INTEGER
   target   ::= INTEGER
 ]
*****************************************************
Author
Martin Mann - 2010 - http://www.bioinf.uni-freiburg.de/~mmann/

Definition at line 145 of file MC_Edge.hh.

Constructor & Destructor Documentation

sgm::MC_NoEdge::MC_NoEdge ( )
inline

Default construction of the match constraint : undefined values are initialized with INT_MAX

Definition at line 158 of file MC_Edge.hh.

sgm::MC_NoEdge::MC_NoEdge ( const MC_NoEdge toCopy)
inline

Copy construction of the match constraint

Definition at line 165 of file MC_Edge.hh.

sgm::MC_NoEdge::MC_NoEdge ( const size_t  constrainedFromID,
const size_t  constrainedToID 
)
inline

Construction of the match constraint

Parameters
constrainedFromIDthe index of the source node
constrainedToIDthe index of the target node

Definition at line 175 of file MC_Edge.hh.

virtual sgm::MC_NoEdge::~MC_NoEdge ( )
inlinevirtual

Definition at line 183 of file MC_Edge.hh.

Member Function Documentation

virtual MC_NoEdge* sgm::MC_NoEdge::clone ( void  ) const
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!

Returns
a new allocated MC_NoEdge object that equals *this

Implements sgm::MC_Edge.

Definition at line 230 of file MC_Edge.hh.

virtual bool sgm::MC_NoEdge::isConstrainedLabel ( const std::string &  label) const
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.

Parameters
labelthe label of interest
Returns
true if the label is part of the constraint; false otherwise

Implements sgm::Pattern_Interface::Match_Constraint.

Definition at line 215 of file MC_Edge.hh.

virtual bool sgm::MC_Edge::isConstraining ( const size_t  nodeID) const
inlinevirtualinherited

Checks whether or not this constraint covers the node with the given ID.

Parameters
nodeIDthe ID of the node of interest
Returns
true if the node is covered by the constraint; false otherwise

Implements sgm::Pattern_Interface::Match_Constraint.

Definition at line 69 of file MC_Edge.hh.

virtual bool sgm::MC_NoEdge::isValidMatch ( const Pattern_Interface pattern,
const Graph_Interface target,
const Match match 
) const
inlinevirtual

Checks whether or not a match on a given target fullfills the additional NO-EDGE constraint for the pattern matching.

Parameters
patternthe pattern graph that was matched
targetthe target graph the pattern was matched on
matchthe match information for the left side pattern of the pattern on the target graph
Returns
true if the match is valid; false if the constraint is violated

Implements sgm::Pattern_Interface::Match_Constraint.

Definition at line 199 of file MC_Edge.hh.

virtual bool sgm::Pattern_Interface::Match_Constraint::operator== ( const Match_Constraint toCompare) const
pure virtualinherited

Equality comparison to another match constraint.

Parameters
toComparethe constraint to compare to
Returns
true if the constraints are equal; false otherwise

Implemented in sgm::MC_Node.

virtual bool sgm::MC_NoEdge::operator== ( const Match_Constraint toCompare) const
inlinevirtual

Equality comparison to another match constraint.

Parameters
toComparethe constraint to compare to
Returns
true if the constraints are equal; false otherwise

Reimplemented from sgm::MC_Edge.

Definition at line 280 of file MC_Edge.hh.

virtual MC_NoEdge* sgm::MC_NoEdge::remap ( const Match old2newIndexMapping,
const size_t  unmatchedIndex = UINT_MAX 
)
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!

Parameters
old2newIndexMappingthe index mapping to be used for the remapping
unmatchedIndexan optional specific index that marks unmatched nodes within old2newIndexMapping. if this constrains one of these nodes, no remapping is done and NULL is returned
Returns
a new allocated MC_NoEdge object

Implements sgm::MC_Edge.

Definition at line 251 of file MC_Edge.hh.

Field Documentation

size_t sgm::MC_Edge::constrainedFromID
inherited

Definition at line 33 of file MC_Edge.hh.

size_t sgm::MC_Edge::constrainedToID
inherited

Definition at line 36 of file MC_Edge.hh.


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