#include <boost/graph/adjacency_list.hpp>
#include "graphml.hpp"
#include <fstream>

using namespace std;
using namespace boost;

struct VertexProps
{
    string string_prop;
    int int_prop;
    long long_prop;
    bool bool_prop;
    float float_prop;
    double double_prop;
};

int main(int argc, char** argv)
{

    typedef adjacency_list<vecS,vecS,directedS, 
                           VertexProps,
                           property<edge_weight_t,double> > graph_t;
    graph_t g;
    dynamic_properties dp;
    dp.property("string_prop",get(&VertexProps::string_prop,g));
    dp.property("int_prop",get(&VertexProps::int_prop,g));
    dp.property("long_prop",get(&VertexProps::long_prop,g));
    dp.property("bool_prop",get(&VertexProps::bool_prop,g));
    dp.property("float_prop",get(&VertexProps::float_prop,g));
    dp.property("double_prop",get(&VertexProps::double_prop,g));
    dp.property("weight",get(edge_weight_t(),g));

    ifstream ifile("reader-test.xml");
    read_graphml(ifile, g, dp);
    ifile.close();

    assert(num_vertices(g) == 9);
    assert(num_edges(g) == 9);
    assert(g[vertex(2,g)].string_prop == "foo");
    assert(g[vertex(2,g)].int_prop == 100);
    assert(g[vertex(2,g)].long_prop == 3);
    assert(g[vertex(2,g)].bool_prop == true);
    assert(g[vertex(2,g)].float_prop == 1.5);
    assert(g[vertex(2,g)].double_prop == 1.1);

    graph_traits<graph_t>::vertex_iterator v, v_end;
    for (tie(v,v_end) = vertices(g); v != v_end; ++v)
    {
        if (*v == vertex(2,g))
            continue;
        assert(g[*v].string_prop == "default");
        assert(g[*v].int_prop == 42);
        assert(g[*v].long_prop == 42);
        assert(g[*v].bool_prop == false);
        assert(g[*v].float_prop == 0.0);
        assert(g[*v].double_prop == 0.0);
    }
    
    assert(get(edge_weight_t(), g, edge(vertex(0,g),vertex(1,g),g).first) == 0.0);
    assert(get(edge_weight_t(), g, edge(vertex(1,g),vertex(2,g),g).first) == 0.8);

    ofstream ofile("writer-test.xml");
    write_graphml(ofile, g, dp);
    ofile.close();

    graph_t g2;
    dynamic_properties dp2;
    dp2.property("string_prop",get(&VertexProps::string_prop,g2));
    dp2.property("int_prop",get(&VertexProps::int_prop,g2));
    dp2.property("long_prop",get(&VertexProps::long_prop,g2));
    dp2.property("bool_prop",get(&VertexProps::bool_prop,g2));
    dp2.property("float_prop",get(&VertexProps::float_prop,g2));
    dp2.property("double_prop",get(&VertexProps::double_prop,g2));
    dp2.property("weight",get(edge_weight_t(),g2));
    ifile.open("writer-test.xml");
    read_graphml(ifile, g2, dp2);
    ifile.close();

    assert(num_vertices(g) == num_vertices(g2));
    assert(num_edges(g) == num_edges(g2));

    for (tie(v,v_end) = vertices(g); v != v_end; ++v)
    {
	assert(g[*v].string_prop == g2[*v].string_prop);
	assert(g[*v].int_prop == g2[*v].int_prop);
	assert(g[*v].long_prop == g2[*v].long_prop);
	assert(g[*v].bool_prop == g2[*v].bool_prop);
	assert(g[*v].float_prop == g2[*v].float_prop);
	assert(g[*v].double_prop == g2[*v].double_prop);
    }

    graph_traits<graph_t>::edge_iterator e, e_end;
    for (tie(e,e_end) = edges(g); e != e_end; ++e)
	assert(get(edge_weight_t(), g, *e) == get(edge_weight_t(), g2, *e));

    return 0;
}