Files @ r356:236b1902e5cc

Location: LEMON/LEMON-official/test/unionfind_test.cc

Load file history 
r356:236b1902e5cc
3.0 KiB
text/x-c++src
Show annotation Show as raw Download as raw
gravatar
kpeter (Peter Kovacs)
More improvement in the migration script - Rename (U)GRAPH_TYPEDEFS. - Rename "directed graph" to "digraph".
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2008

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */



#include <lemon/list_graph.h>

#include <lemon/maps.h>

#include <lemon/unionfind.h>

#include "test_tools.h"



using namespace lemon;

using namespace std;



typedef UnionFindEnum<ListGraph::NodeMap<int> > UFE;



int main() {

  ListGraph g;

  ListGraph::NodeMap<int> base(g);

  UFE U(base);

  vector<ListGraph::Node> n;



  for(int i=0;i<20;i++) n.push_back(g.addNode());



  U.insert(n[1]);

  U.insert(n[2]);



  check(U.join(n[1],n[2]) != -1, "Something is wrong with UnionFindEnum");



  U.insert(n[3]);

  U.insert(n[4]);

  U.insert(n[5]);

  U.insert(n[6]);

  U.insert(n[7]);





  check(U.join(n[1],n[4]) != -1, "Something is wrong with UnionFindEnum");

  check(U.join(n[2],n[4]) == -1, "Something is wrong with UnionFindEnum");

  check(U.join(n[3],n[5]) != -1, "Something is wrong with UnionFindEnum");





  U.insert(n[8],U.find(n[5]));





  check(U.size(U.find(n[4])) == 3, "Something is wrong with UnionFindEnum");

  check(U.size(U.find(n[5])) == 3, "Something is wrong with UnionFindEnum");

  check(U.size(U.find(n[6])) == 1, "Something is wrong with UnionFindEnum");

  check(U.size(U.find(n[2])) == 3, "Something is wrong with UnionFindEnum");





  U.insert(n[9]);

  U.insert(n[10],U.find(n[9]));





  check(U.join(n[8],n[10])  != -1, "Something is wrong with UnionFindEnum");





  check(U.size(U.find(n[4])) == 3, "Something is wrong with UnionFindEnum");

  check(U.size(U.find(n[9])) == 5, "Something is wrong with UnionFindEnum");



  check(U.size(U.find(n[8])) == 5, "Something is wrong with UnionFindEnum");



  U.erase(n[9]);

  U.erase(n[1]);



  check(U.size(U.find(n[10])) == 4, "Something is wrong with UnionFindEnum");

  check(U.size(U.find(n[2]))  == 2, "Something is wrong with UnionFindEnum");



  U.erase(n[6]);

  U.split(U.find(n[8]));





  check(U.size(U.find(n[4])) == 2, "Something is wrong with UnionFindEnum");

  check(U.size(U.find(n[3])) == 1, "Something is wrong with UnionFindEnum");

  check(U.size(U.find(n[2])) == 2, "Something is wrong with UnionFindEnum");





  check(U.join(n[3],n[4]) != -1, "Something is wrong with UnionFindEnum");

  check(U.join(n[2],n[4]) == -1, "Something is wrong with UnionFindEnum");





  check(U.size(U.find(n[4])) == 3, "Something is wrong with UnionFindEnum");

  check(U.size(U.find(n[3])) == 3, "Something is wrong with UnionFindEnum");

  check(U.size(U.find(n[2])) == 3, "Something is wrong with UnionFindEnum");



  U.eraseClass(U.find(n[4]));

  U.eraseClass(U.find(n[7]));



  return 0;

}