UnCoVer (Using Coverability for Verification)
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Pages
SubgraphOrder.h
1 /***************************************************************************
2  * Copyright (C) 2014 by Jan Stückrath <jan.stueckrath@uni-due.de> *
3  * *
4  * This program is free software; you can redistribute it and/or modify *
5  * it under the terms of the GNU General Public License as published by *
6  * the Free Software Foundation; either version 2 of the License, or *
7  * (at your option) any later version. *
8  * *
9  * This program is distributed in the hope that it will be useful, *
10  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
12  * GNU General Public License for more details. *
13  * *
14  * You should have received a copy of the GNU General Public License *
15  * along with this program; if not, write to the *
16  * Free Software Foundation, Inc., *
17  * 51 Franklin St, Fifth Floor, Boston, MA 02110, USA *
18  ***************************************************************************/
19 
20 #ifndef SUBGRAPHORDER_H_
21 #define SUBGRAPHORDER_H_
22 
23 #include "../basic_types/Order.h"
24 #include "../rule_engine/StdMatchFinder.h"
25 
26 namespace uncover {
27  namespace subgraphs {
28 
35 
36  public:
37 
41  SubgraphOrder();
42 
46  virtual ~SubgraphOrder();
47 
55  virtual bool isLessOrEq(graphs::Hypergraph const& smaller, graphs::Hypergraph const& bigger) const override;
56 
57  private:
58 
63 
64  };
65 
66  } /* namespace subgraphs */
67 } /* namespace uncover */
68 
69 #endif /* SUBGRAPHORDER_H_ */
StdMatchFinder provides a simple algorithm which takes two arbitrary graphs and calculates all matchi...
Definition: StdMatchFinder.h:38
rule_engine::StdMatchFinder matchFinder
This matchfinder is used to find an injective embedding of the smaller graph in the larger graph...
Definition: SubgraphOrder.h:62
virtual bool isLessOrEq(graphs::Hypergraph const &smaller, graphs::Hypergraph const &bigger) const override
Checks whether the smaller graph is a subgraph of the larger graph.
Definition: SubgraphOrder.cpp:32
virtual ~SubgraphOrder()
Destroys the current instance of this SubgraphOrder.
Definition: SubgraphOrder.cpp:30
A Hypergraph represents a graph with a unique identifier.
Definition: Hypergraph.h:35
SubgraphOrder()
Creates a new SubgraphOrder object.
Definition: SubgraphOrder.cpp:28
This class implement the "standard" subgraph ordering.
Definition: SubgraphOrder.h:34
This class presents a generic ordering relation on Hypergraphs.
Definition: Order.h:32