sgm::GraphMatching Class Reference

Interface graph isomorphism. More...

#include <GraphMatching.hh>

Inheritance diagram for sgm::GraphMatching:

Public Member Functions
virtual size_t	findMatches (const Pattern_Interface &pattern, const Graph_Interface &target, Match_Reporter &reporter, const size_t maxHits)=0
virtual size_t	findMatches (const std::vector< const Pattern_Interface * > &patterns, const Graph_Interface &target, Match_Reporter &reporter, const size_t maxHits)=0
virtual size_t	findMatches (const std::vector< const Pattern_Interface * > &patterns, const Graph_Interface &target, std::vector< Match_Reporter * > &reporters, const size_t maxHits)=0
virtual	~GraphMatching ()

Detailed Description

     This class defines the interface of graph matching algorithms of
     the sgm library, i.e. algorithms solving the graph-isomorphism
     problem.

Author

Martin Mann (c) 2008 http://www.bioinf.uni-freiburg.de/~mmann/

Definition at line 19 of file GraphMatching.hh.

Constructor & Destructor Documentation

virtual sgm::GraphMatching::~GraphMatching ( )

inlinevirtual

Definition at line 24 of file GraphMatching.hh.

Member Function Documentation

virtual size_t sgm::GraphMatching::findMatches ( const Pattern_Interface &  pattern, const Graph_Interface &  target, Match_Reporter &  reporter, const size_t  maxHits  )

pure virtual

Performs exact graph matching to find maxHits occurrences of the pattern graph within the target graph. Each hit is reported to the Match_Reporter object.

Parameters

pattern	the pattern graph to search for
target	the graph to search the pattern within
reporter	all hits are reported to that object
maxHits	the maximal number of hits to find

Returns

the number of exact matches found

Implemented in sgm::GM_vf2.

virtual size_t sgm::GraphMatching::findMatches ( const std::vector< const Pattern_Interface * > &  patterns, const Graph_Interface &  target, Match_Reporter &  reporter, const size_t  maxHits  )

pure virtual

Performs exact graph matching to find maxHits occurrences of the pattern graphs within the target graph. Each hit is reported to the Match_Reporter object. NOTE, the first maxHits matches of the pattern graphs according to their order in the patterns container are reported, i.e. first all occurrences of the first pattern are identified. If this does not exceed the maxHits limit, the next pattern is matched and so on until either no pattern is left or the maxHits limit is exceeded.

Parameters

patterns	the container of the pattern graphs to search for
target	the graph to search the pattern within
reporter	all hits are reported to that object
maxHits	the maximal number of hits to find

Returns

the number of exact matches found

Implemented in sgm::GM_vf2.

virtual size_t sgm::GraphMatching::findMatches ( const std::vector< const Pattern_Interface * > &  patterns, const Graph_Interface &  target, std::vector< Match_Reporter * > &  reporters, const size_t  maxHits  )

pure virtual

Performs exact graph matching to find maxHits occurrences of the pattern graphs within the target graph. Each hit is reported to the Match_Reporter object. NOTE, the first maxHits matches of the pattern graphs according to their order in the patterns container are reported, i.e. first all occurrences of the first pattern are identified. If this does not exceed the maxHits limit, the next pattern is matched and so on until either no pattern is left or the maxHits limit is exceeded.

Parameters

patterns	the container of the pattern graphs to search for
target	the graph to search the pattern within
reporters	each hit is reported to the corresponding object, the container has to have the same length as patterns
maxHits	the maximal number of hits to find

Returns

the number of exact matches found

Implemented in sgm::GM_vf2.

---

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

• src/sgm/GraphMatching.hh