File: disjoint_set_test.cpp

package info (click to toggle)
boost1.83 1.83.0-4.2
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 545,456 kB
  • sloc: cpp: 3,857,086; xml: 125,552; ansic: 34,414; python: 25,887; asm: 5,276; sh: 4,799; ada: 1,681; makefile: 1,629; perl: 1,212; pascal: 1,139; sql: 810; yacc: 478; ruby: 102; lisp: 24; csh: 6
file content (74 lines) | stat: -rw-r--r-- 2,273 bytes parent folder | download | duplicates (13)
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
//  (C) Copyright Jeremy Siek 2002.
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

#include <boost/pending/disjoint_sets.hpp>
#include <boost/core/lightweight_test.hpp>
#include <boost/cstdlib.hpp>

template < typename DisjointSet > struct test_disjoint_set
{
    static void do_test()
    {
        // The following tests are pretty lame, just a basic sanity check.
        // Industrial strength tests still need to be written.

#if !defined(__MWERKS__) || __MWERKS__ > 0x3003
        std::size_t elts[]
#else
        std::size_t elts[4]
#endif
            = { 0, 1, 2, 3 };

        const int N = sizeof(elts) / sizeof(*elts);

        DisjointSet ds(N);

        ds.make_set(elts[0]);
        ds.make_set(elts[1]);
        ds.make_set(elts[2]);
        ds.make_set(elts[3]);

        BOOST_TEST(ds.find_set(0) != ds.find_set(1));
        BOOST_TEST(ds.find_set(0) != ds.find_set(2));
        BOOST_TEST(ds.find_set(0) != ds.find_set(3));
        BOOST_TEST(ds.find_set(1) != ds.find_set(2));
        BOOST_TEST(ds.find_set(1) != ds.find_set(3));
        BOOST_TEST(ds.find_set(2) != ds.find_set(3));

        ds.union_set(0, 1);
        ds.union_set(2, 3);
        BOOST_TEST(ds.find_set(0) != ds.find_set(3));
        int a = ds.find_set(0);
        BOOST_TEST(a == ds.find_set(1));
        int b = ds.find_set(2);
        BOOST_TEST(b == ds.find_set(3));

        ds.link(a, b);
        BOOST_TEST(ds.find_set(a) == ds.find_set(b));
        BOOST_TEST(1 == ds.count_sets(elts, elts + N));

        ds.normalize_sets(elts, elts + N);
        ds.compress_sets(elts, elts + N);
        BOOST_TEST(1 == ds.count_sets(elts, elts + N));
    }
};

int main(int, char*[])
{
    using namespace boost;
    {
        typedef disjoint_sets_with_storage< identity_property_map,
            identity_property_map, find_with_path_halving >
            ds_type;
        test_disjoint_set< ds_type >::do_test();
    }
    {
        typedef disjoint_sets_with_storage< identity_property_map,
            identity_property_map, find_with_full_path_compression >
            ds_type;
        test_disjoint_set< ds_type >::do_test();
    }
    return boost::report_errors();
}