graph.h

Go to the documentation of this file.

/*
Copyright (C) 2013-2017
Rafael Guglielmetti, rafael.guglielmetti@unifr.ch
*/
 
/*
This file is part of CoxIter.
 
CoxIter is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as
published by the Free Software Foundation, either version 3 of the
License, or (at your option) any later version.
 
CoxIter is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
 
You should have received a copy of the GNU General Public License
along with CoxIter. If not, see <http://www.gnu.org/licenses/>.
*/
 
#ifndef GRAPH_H
#define GRAPH_H
 
#include <algorithm>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
 
using namespace std;
 
class Graph {
public:
  vector<short unsigned int> vertices; 
  vector<bool>
      linkableVertices; 
 
  unsigned int type; 
 
  unsigned int dataSupp; 
 
  bool isSpherical; 
 
private:
  vector<string>
      *ptr_map_vertices_indexToLabel; 
  bool b_map_vertices_indexToLabelIsEmpty;
 
public:
  Graph(const vector<short unsigned int> &vertices,
        vector<string> *ptr_map_vertices_indexToLabel,
        const vector<bool> &linkableVertices, const unsigned int &type,
        const bool &isSpherical, const unsigned int &dataSupp = 0);
 
  bool isSubgraphOf(const Graph *grBig) const;
 
  bool isSubgraphOf_spherical_spherical(const Graph *grBig) const;
 
  bool isSubgraphOf_spherical_euclidean(const Graph *grBig) const;
 
  friend bool operator==(const Graph &g1, const Graph &g2);
  friend bool operator<(const Graph &g1, const Graph &g2);
 
private:
  static bool isAnSubAm(const vector<short unsigned int> &subGraphVertices,
                        const vector<short unsigned int> &bigGraphVertices);
 
public:
  friend ostream &operator<<(ostream &, Graph const &);
};
 
struct GraphPtrComp {
  bool operator()(const Graph *g1, const Graph *g2) const {
    return (*g1 < *g2);
  }
};
 
#endif // GRAPH_H