// (C) Copyright 2008-2009 SDML (www.sdml.info)
//
// Use, modification and distribution is subject to 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)

// Copyright Andrew Sutton 2007
//
// Use, modification and distribution are subject to 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)

#ifndef BOOST_FCA_WRITE_GRAPHVIZ_HPP
#define BOOST_FCA_WRITE_GRAPHVIZ_HPP

#include <iostream>
#include <string>

#include <boost/fca/lattice.hpp>

namespace boost {
namespace fca {

    template <typename Lattice>
    void write_graphviz(std::ostream& os, const Lattice& lat)
    {
        using namespace std;
        using namespace boost;

        // Useful types
        typedef typename Lattice::graph_type Graph;
        typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
        typedef typename graph_traits<Graph>::edge_descriptor Edge;
        typedef typename graph_traits<Graph>::vertex_iterator VertexIterator;
        typedef typename graph_traits<Graph>::edge_iterator EdgeIterator;
        typedef typename property_map<Graph, vertex_index_t>::type IndexMap;

        typedef typename Lattice::concept_type Concept;
        typedef typename Lattice::object_set ObjectSet;
        typedef typename Lattice::attribute_set AttributeSet;
        typedef typename Lattice::object_type ObjectType;
        typedef typename Lattice::attribute_type AttributeType;

        const Graph& g = lat.graph();
        IndexMap indices = get(vertex_index, g);

        os << "digraph G {" << endl;
        os << "  rankdir = BT;" << endl;
        os << "  node [shape=box];" << endl;

        // Start by writing all vertices...
        pair<VertexIterator, VertexIterator> verts = vertices(g);
        for(; verts.first != verts.second; ++verts.first) {
            const Concept& c = *g[*verts.first].value;
            const ObjectSet& cobjs = c.objects();
            const AttributeSet& catts = c.attributes();

            os << "  " << get(indices, *verts.first) << " [";

            // Build a label for the vertex.
            stringstream ss;
            ss << "atts { ";
            copy(begin(catts), end(catts), ostream_iterator<AttributeType>(ss, " "));
            ss << "}\\n";

            ss << "objs { ";
            copy(begin(cobjs), end(cobjs), ostream_iterator<ObjectType>(ss, " "));
            ss << "}";

            os  << "label=\"" << ss.str() << "\"";
            os << "];" << endl;
        }

        // Now, write all the edges (by index)
        pair<EdgeIterator, EdgeIterator> eds = edges(g);
        for( ; eds.first != eds.second; ++eds.first) {
            Edge e = *eds.first;
            Vertex u = source(e, g), v = target(e, g);

            os << get(indices, u) << " -> " << get(indices, v) << ";" << endl;
        }

        os << "}" << endl;
    }

} /* namespace fca */
} /* namespace boost */

#endif