madarasip@1350: /* -*- mode: C++; indent-tabs-mode: nil; -*-
madarasip@1350:  *
madarasip@1350:  * This file is a part of LEMON, a generic C++ optimization library.
madarasip@1350:  *
madarasip@1350:  * Copyright (C) 2015
madarasip@1350:  * EMAXA Kutato-fejleszto Kft. (EMAXA Research Ltd.)
madarasip@1350:  *
madarasip@1350:  * Permission to use, modify and distribute this software is granted
madarasip@1350:  * provided that this copyright notice appears in all copies. For
madarasip@1350:  * precise terms see the accompanying LICENSE file.
madarasip@1350:  *
madarasip@1350:  * This software is provided "AS IS" with no warranty of any kind,
madarasip@1350:  * express or implied, and with no claim as to its suitability for any
madarasip@1350:  * purpose.
madarasip@1350:  *
madarasip@1350:  */
madarasip@1350: 
madarasip@1350: #include <lemon/vf2.h>
madarasip@1350: #include <lemon/concepts/digraph.h>
madarasip@1350: #include <lemon/smart_graph.h>
madarasip@1350: #include <lemon/lgf_reader.h>
madarasip@1350: #include <lemon/concepts/maps.h>
madarasip@1350: 
madarasip@1350: #include <test/test_tools.h>
madarasip@1350: #include <sstream>
madarasip@1350: 
madarasip@1350: using namespace lemon;
madarasip@1350: 
madarasip@1350: char petersen_lgf[] =
madarasip@1350:   "@nodes\n"
madarasip@1350:   "label col1 col2\n"
madarasip@1350:   "0 1 1\n"
madarasip@1350:   "1 1 2\n"
madarasip@1350:   "2 1 3\n"
madarasip@1350:   "3 1 4\n"
madarasip@1350:   "4 2 5\n"
madarasip@1350:   "5 2 1\n"
madarasip@1350:   "6 2 2\n"
madarasip@1350:   "7 2 3\n"
madarasip@1350:   "8 2 4\n"
madarasip@1350:   "9 2 5\n"
madarasip@1350:   "@arcs\n"
madarasip@1350:   "     -\n"
madarasip@1350:   "0 1\n"
madarasip@1350:   "1 2\n"
madarasip@1350:   "2 3\n"
madarasip@1350:   "3 4\n"
madarasip@1350:   "4 0\n"
madarasip@1350:   "0 5\n"
madarasip@1350:   "1 6\n"
madarasip@1350:   "2 7\n"
madarasip@1350:   "3 8\n"
madarasip@1350:   "4 9\n"
madarasip@1350:   "5 8\n"
madarasip@1350:   "5 7\n"
madarasip@1350:   "9 6\n"
madarasip@1350:   "9 7\n"
madarasip@1350:   "6 8\n";
madarasip@1350: 
madarasip@1350: char c5_lgf[] =
madarasip@1350:   "@nodes\n"
madarasip@1350:   "label col\n"
madarasip@1350:   "0 1\n"
madarasip@1350:   "1 2\n"
madarasip@1350:   "2 3\n"
madarasip@1350:   "3 4\n"
madarasip@1350:   "4 5\n"
madarasip@1350:   "@arcs\n"
madarasip@1350:   "     -\n"
madarasip@1350:   "0 1\n"
madarasip@1350:   "1 2\n"
madarasip@1350:   "2 3\n"
madarasip@1350:   "3 4\n"
madarasip@1350:   "4 0\n";
madarasip@1350: 
madarasip@1350: char c7_lgf[] =
madarasip@1350:   "@nodes\n"
madarasip@1350:   "label\n"
madarasip@1350:   "0\n"
madarasip@1350:   "1\n"
madarasip@1350:   "2\n"
madarasip@1350:   "3\n"
madarasip@1350:   "4\n"
madarasip@1350:   "5\n"
madarasip@1350:   "6\n"
madarasip@1350:   "@arcs\n"
madarasip@1350:   "     -\n"
madarasip@1350:   "0 1\n"
madarasip@1350:   "1 2\n"
madarasip@1350:   "2 3\n"
madarasip@1350:   "3 4\n"
madarasip@1350:   "4 5\n"
madarasip@1350:   "5 6\n"
madarasip@1350:   "6 0\n";
madarasip@1350: 
madarasip@1350: char c10_lgf[] =
madarasip@1350:   "@nodes\n"
madarasip@1350:   "label\n"
madarasip@1350:   "0\n"
madarasip@1350:   "1\n"
madarasip@1350:   "2\n"
madarasip@1350:   "3\n"
madarasip@1350:   "4\n"
madarasip@1350:   "5\n"
madarasip@1350:   "6\n"
madarasip@1350:   "7\n"
madarasip@1350:   "8\n"
madarasip@1350:   "9\n"
madarasip@1350:   "@arcs\n"
madarasip@1350:   "     -\n"
madarasip@1350:   "0 1\n"
madarasip@1350:   "1 2\n"
madarasip@1350:   "2 3\n"
madarasip@1350:   "3 4\n"
madarasip@1350:   "4 5\n"
madarasip@1350:   "5 6\n"
madarasip@1350:   "6 7\n"
madarasip@1350:   "7 8\n"
madarasip@1350:   "8 9\n"
madarasip@1350:   "9 0\n";
madarasip@1350: 
madarasip@1350: char p10_lgf[] =
madarasip@1350:   "@nodes\n"
madarasip@1350:   "label\n"
madarasip@1350:   "0\n"
madarasip@1350:   "1\n"
madarasip@1350:   "2\n"
madarasip@1350:   "3\n"
madarasip@1350:   "4\n"
madarasip@1350:   "5\n"
madarasip@1350:   "6\n"
madarasip@1350:   "7\n"
madarasip@1350:   "8\n"
madarasip@1350:   "9\n"
madarasip@1350:   "@arcs\n"
madarasip@1350:   "     -\n"
madarasip@1350:   "0 1\n"
madarasip@1350:   "1 2\n"
madarasip@1350:   "2 3\n"
madarasip@1350:   "3 4\n"
madarasip@1350:   "4 5\n"
madarasip@1350:   "5 6\n"
madarasip@1350:   "6 7\n"
madarasip@1350:   "7 8\n"
madarasip@1350:   "8 9\n";
madarasip@1350: 
madarasip@1350: SmartGraph petersen, c5, c7, c10, p10;
madarasip@1350: SmartGraph::NodeMap<int> petersen_col1(petersen);
madarasip@1350: SmartGraph::NodeMap<int> petersen_col2(petersen);
madarasip@1350: SmartGraph::NodeMap<int> c5_col(c5);
madarasip@1350: 
madarasip@1350: void make_graphs() {
madarasip@1350:   std::stringstream ss(petersen_lgf);
madarasip@1350:   graphReader(petersen, ss)
madarasip@1350:     .nodeMap("col1",petersen_col1)
madarasip@1350:     .nodeMap("col2",petersen_col2)
madarasip@1350:     .run();
madarasip@1350: 
madarasip@1350:   ss.clear();
madarasip@1350:   ss.str("");
madarasip@1350:   ss<<c5_lgf;
madarasip@1350:   //std::stringstream ss2(c5_lgf);
madarasip@1350:   graphReader(c5, ss)
madarasip@1350:     .nodeMap("col",c5_col)
madarasip@1350:     .run();
madarasip@1350: 
madarasip@1350:   ss.clear();
madarasip@1350:   ss.str("");
madarasip@1350:   ss<<c7_lgf;
madarasip@1350:   graphReader(c7, ss).run();
madarasip@1350: 
madarasip@1350:   ss.clear();
madarasip@1350:   ss.str("");
madarasip@1350:   ss<<c10_lgf;
madarasip@1350:   graphReader(c10, ss).run();
madarasip@1350: 
madarasip@1350:   ss.clear();
madarasip@1350:   ss.str("");
madarasip@1350:   ss<<p10_lgf;
madarasip@1350:   graphReader(p10, ss).run();
madarasip@1350: 
madarasip@1350: }
madarasip@1350: 
madarasip@1350: class EqComparable {
madarasip@1350: public:
madarasip@1350:   bool operator==(const EqComparable&) { return false; }
madarasip@1350: };
madarasip@1350: 
madarasip@1350: template<class A, class B>
madarasip@1350: class EqClass {
madarasip@1350: public:
madarasip@1350:   bool operator()(A, B) { return false; }
madarasip@1350: };
madarasip@1350: 
madarasip@1350: template<class G1,class G2>
madarasip@1350: void checkVf2Compile()
madarasip@1350: {
madarasip@1350:   G1 g;
madarasip@1350:   G2 h;
madarasip@1350:   concepts::ReadWriteMap<typename G1::Node, typename G2::Node> r;
madarasip@1350:   bool succ;
madarasip@1350:   ::lemon::ignore_unused_variable_warning(succ);
madarasip@1350: 
madarasip@1350:   succ = vf2(g,h).run();
madarasip@1350:   succ = vf2(g,h).induced().run();
madarasip@1350:   succ = vf2(g,h).iso().run();
madarasip@1350:   succ = vf2(g,h).mapping(r).run();
madarasip@1350:   succ = vf2(g,h).induced().mapping(r).run();
madarasip@1350:   succ = vf2(g,h).iso().mapping(r).run();
madarasip@1350:   concepts::ReadMap<typename G1::Node, EqComparable> l1;
madarasip@1350:   concepts::ReadMap<typename G2::Node, EqComparable> l2;
madarasip@1350:   succ = vf2(g,h).nodeLabels(l1,l2).mapping(r).run();
madarasip@1350:   succ = vf2(g,h).nodeEq(EqClass<typename G1::Node,typename G2::Node>())
madarasip@1350:     .mapping(r).run();
madarasip@1350: }
madarasip@1350: 
madarasip@1350: void justCompile()
madarasip@1350: {
madarasip@1350:   checkVf2Compile<concepts::Graph,concepts::Graph>();
madarasip@1350:   checkVf2Compile<concepts::Graph,SmartGraph>();
madarasip@1350:   checkVf2Compile<SmartGraph,concepts::Graph>();
madarasip@1350: }
madarasip@1350: 
madarasip@1350: template<class G1, class G2, class I>
madarasip@1350: void checkSub(const G1 &g1, const G2 &g2, const I &i)
madarasip@1350: {
madarasip@1350:   {
madarasip@1350:     std::set<typename G2::Node> image;
madarasip@1350:     for(typename G1::NodeIt n(g1);n!=INVALID;++n)
madarasip@1350:       {
madarasip@1350:           check(i[n]!=INVALID, "Wrong isomorphism: incomplete mapping.");
madarasip@1350:           check(image.count(i[n])==0,"Wrong isomorphism: not injective.");
madarasip@1350:           image.insert(i[n]);
madarasip@1350:       }
madarasip@1350:   }
madarasip@1350:   for(typename G1::EdgeIt e(g1);e!=INVALID;++e)
madarasip@1350:     check(findEdge(g2,i[g1.u(e)],i[g1.v(e)])!=INVALID,
madarasip@1350:           "Wrong isomorphism: missing edge(checkSub).");
madarasip@1350: }
madarasip@1350: 
madarasip@1350: template<class G1, class G2, class I>
madarasip@1350: void checkInd(const G1 &g1, const G2 &g2, const I &i)
madarasip@1350:   {
madarasip@1350:   std::set<typename G2::Node> image;
madarasip@1350:   for(typename G1::NodeIt n(g1);n!=INVALID;++n)
madarasip@1350:     {
madarasip@1350:     check(i[n]!=INVALID, "Wrong isomorphism: incomplete mapping.");
madarasip@1350:     check(image.count(i[n])==0,"Wrong isomorphism: not injective.");
madarasip@1350:     image.insert(i[n]);
madarasip@1350:     }
madarasip@1350:   for(typename G1::NodeIt n(g1); n!=INVALID; ++n)
madarasip@1350:     for(typename G1::NodeIt m(g1); m!=INVALID; ++m)
madarasip@1350:       if((findEdge(g1,n,m)==INVALID) != (findEdge(g2,i[n],i[m])==INVALID))
madarasip@1350:         {
madarasip@1350:         std::cout << "Wrong isomorphism: edge mismatch";
madarasip@1350:         exit(1);
madarasip@1350:         }
madarasip@1350:   }
madarasip@1350: 
madarasip@1350: template<class G1,class G2>
madarasip@1350: int checkSub(const G1 &g1, const G2 &g2)
madarasip@1350: {
madarasip@1350:   typename G1:: template NodeMap<typename G2::Node> iso(g1,INVALID);
madarasip@1350:   if(vf2(g1,g2).mapping(iso).run())
madarasip@1350:     {
madarasip@1350:       checkSub(g1,g2,iso);
madarasip@1350:       return true;
madarasip@1350:     }
madarasip@1350:   else return false;
madarasip@1350: }
madarasip@1350: 
madarasip@1350: template<class G1,class G2>
madarasip@1350: int checkInd(const G1 &g1, const G2 &g2)
madarasip@1350: {
madarasip@1350:   typename G1:: template NodeMap<typename G2::Node> iso(g1,INVALID);
madarasip@1350:   if(vf2(g1,g2).induced().mapping(iso).run())
madarasip@1350:     {
madarasip@1350:       checkInd(g1,g2,iso);
madarasip@1350:       return true;
madarasip@1350:     }
madarasip@1350:   else return false;
madarasip@1350: }
madarasip@1350: 
madarasip@1350: template<class G1,class G2>
madarasip@1350: int checkIso(const G1 &g1, const G2 &g2)
madarasip@1350: {
madarasip@1350:   typename G1:: template NodeMap<typename G2::Node> iso(g1,INVALID);
madarasip@1350:   if(vf2(g1,g2).iso().mapping(iso).run())
madarasip@1350:     {
madarasip@1350:       check(countNodes(g1)==countNodes(g2),
madarasip@1350:             "Wrong iso alg.: they are not isomophic.");
madarasip@1350:       checkInd(g1,g2,iso);
madarasip@1350:       return true;
madarasip@1350:     }
madarasip@1350:   else return false;
madarasip@1350: }
madarasip@1350: 
madarasip@1350: template<class G1, class G2, class L1, class L2, class I>
madarasip@1350: void checkLabel(const G1 &g1, const G2 &,
madarasip@1350:                 const L1 &l1, const L2 &l2,const I &i)
madarasip@1350: {
madarasip@1350:   for(typename G1::NodeIt n(g1);n!=INVALID;++n)
madarasip@1350:     {
madarasip@1350:       check(l1[n]==l2[i[n]],"Wrong isomorphism: label mismatch.");
madarasip@1350:     }
madarasip@1350: }
madarasip@1350: 
madarasip@1350: template<class G1,class G2,class L1,class L2>
madarasip@1350: int checkSub(const G1 &g1, const G2 &g2, const L1 &l1, const L2 &l2)
madarasip@1350: {
madarasip@1350:   typename G1:: template NodeMap<typename G2::Node> iso(g1,INVALID);
madarasip@1350:   if(vf2(g1,g2).nodeLabels(l1,l2).mapping(iso).run())
madarasip@1350:     {
madarasip@1350:       checkSub(g1,g2,iso);
madarasip@1350:       checkLabel(g1,g2,l1,l2,iso);
madarasip@1350:       return true;
madarasip@1350:     }
madarasip@1350:   else return false;
madarasip@1350: }
madarasip@1350: 
madarasip@1350: int main() {
madarasip@1350:   make_graphs();
madarasip@1350:   check(checkSub(c5,petersen), "There should exist a C5->Petersen mapping.");
madarasip@1350:   check(!checkSub(c7,petersen),
madarasip@1350:         "There should not exist a C7->Petersen mapping.");
madarasip@1350:   check(checkSub(p10,petersen), "There should exist a P10->Petersen mapping.");
madarasip@1350:   check(!checkSub(c10,petersen),
madarasip@1350:         "There should not exist a C10->Petersen mapping.");
madarasip@1350:   check(checkSub(petersen,petersen),
madarasip@1350:         "There should exist a Petersen->Petersen mapping.");
madarasip@1350: 
madarasip@1350:   check(checkInd(c5,petersen),
madarasip@1350:         "There should exist a C5->Petersen spanned mapping.");
madarasip@1350:   check(!checkInd(c7,petersen),
madarasip@1350:         "There should exist a C7->Petersen spanned mapping.");
madarasip@1350:   check(!checkInd(p10,petersen),
madarasip@1350:         "There should not exist a P10->Petersen spanned mapping.");
madarasip@1350:   check(!checkInd(c10,petersen),
madarasip@1350:         "There should not exist a C10->Petersen spanned mapping.");
madarasip@1350:   check(checkInd(petersen,petersen),
madarasip@1350:         "There should exist a Petersen->Petersen spanned mapping.");
madarasip@1350: 
madarasip@1350:   check(!checkSub(petersen,c10),
madarasip@1350:         "There should not exist a Petersen->C10 mapping.");
madarasip@1350:   check(checkSub(p10,c10),
madarasip@1350:         "There should exist a P10->C10 mapping.");
madarasip@1350:   check(!checkInd(p10,c10),
madarasip@1350:         "There should not exist a P10->C10 spanned mapping.");
madarasip@1350:   check(!checkSub(c10,p10),
madarasip@1350:         "There should not exist a C10->P10 mapping.");
madarasip@1350: 
madarasip@1350:   check(!checkIso(p10,c10),
madarasip@1350:         "P10 and C10 are not isomorphic.");
madarasip@1350:   check(checkIso(c10,c10),
alpar@1352:         "C10 and C10 are isomorphic.");
alpar@1352: 
alpar@1352:   check(!vf2(p10,c10).iso().run(),
alpar@1352:         "P10 and C10 are not isomorphic.");
alpar@1352:   check(vf2(c10,c10).iso().run(),
alpar@1352:         "C10 and C10 are isomorphic.");
madarasip@1350: 
madarasip@1350:   check(!checkSub(c5,petersen,c5_col,petersen_col1),
madarasip@1350:         "There should exist a C5->Petersen mapping.");
madarasip@1350:   check(checkSub(c5,petersen,c5_col,petersen_col2),
madarasip@1350:         "There should exist a C5->Petersen mapping.");
madarasip@1350: }