File: serialize.cpp

package info (click to toggle)
boost1.83 1.83.0-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 545,632 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 (88 lines) | stat: -rw-r--r-- 2,116 bytes parent folder | download | duplicates (10)
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
// Copyright (C) 2006 Trustees of Indiana University
//
// 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/config.hpp>
#include <iostream>
#include <fstream>
#include <string>
#include <boost/tuple/tuple.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/visitors.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <map>
#include <boost/graph/adj_list_serialize.hpp>
#include <boost/archive/xml_iarchive.hpp>
#include <boost/archive/xml_oarchive.hpp>

struct vertex_properties
{
    std::string name;

    template < class Archive >
    void serialize(Archive& ar, const unsigned int /*version*/)
    {
        ar& BOOST_SERIALIZATION_NVP(name);
    }
};

struct edge_properties
{
    std::string name;

    template < class Archive >
    void serialize(Archive& ar, const unsigned int /*version*/)
    {
        ar& BOOST_SERIALIZATION_NVP(name);
    }
};

using namespace boost;

typedef adjacency_list< vecS, vecS, undirectedS, vertex_properties,
    edge_properties >
    Graph;

typedef graph_traits< Graph >::vertex_descriptor vd_type;

typedef adjacency_list< vecS, vecS, undirectedS, vertex_properties >
    Graph_no_edge_property;

int main()
{
    {
        std::ofstream ofs("./kevin-bacon2.dat");
        archive::xml_oarchive oa(ofs);
        Graph g;
        vertex_properties vp;
        vp.name = "A";
        vd_type A = add_vertex(vp, g);
        vp.name = "B";
        vd_type B = add_vertex(vp, g);

        edge_properties ep;
        ep.name = "a";
        add_edge(A, B, ep, g);

        oa << BOOST_SERIALIZATION_NVP(g);

        Graph_no_edge_property g_n;
        oa << BOOST_SERIALIZATION_NVP(g_n);
    }

    {
        std::ifstream ifs("./kevin-bacon2.dat");
        archive::xml_iarchive ia(ifs);
        Graph g;
        ia >> BOOST_SERIALIZATION_NVP(g);

        if (!(g[*(vertices(g).first)].name == "A"))
            return -1;

        Graph_no_edge_property g_n;
        ia >> BOOST_SERIALIZATION_NVP(g_n);
    }
    return 0;
}