/**
 * @file tests/boost_graph/graph_manager.hpp
 * @author The PARADEVS Development Team
 * See the AUTHORS or Authors.txt file
 */

/*
 * PARADEVS - the multimodeling and simulation environment
 * This file is a part of the PARADEVS environment
 *
 * Copyright (C) 2013 ULCO http://www.univ-litoral.fr
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#ifndef __TESTS_BOOST_GRAPH_GRAPH_MANAGER_HPP
#define __TESTS_BOOST_GRAPH_GRAPH_MANAGER_HPP 1

#include <boost/graph/adjacency_list.hpp>

#include <common/scheduler/HeapScheduler.hpp>
#include <common/scheduler/VectorScheduler.hpp>

#include <pdevs/Coordinator.hpp>
#include <pdevs/GraphManager.hpp>
#include <pdevs/Simulator.hpp>

#include <tests/boost_graph/models.hpp>

namespace paradevs { namespace tests { namespace boost_graph {

struct VertexProperties
{
    double _weight;
    DynamicsType _type;

    VertexProperties() : _weight(0), _type(NORMAL_PIXEL)
    { }
    VertexProperties(double weight, DynamicsType type) :
        _weight(weight), _type(type)
    { }
};

typedef boost::property < boost::edge_weight_t, double > EdgeProperty;
typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::directedS,
                                VertexProperties, EdgeProperty> Graph;
typedef std::vector < Graph > Graphs;
typedef std::pair < int, int > Edge;
typedef std::vector < Edge > Edges;
typedef std::vector < Edges > EdgeList;

struct GraphParameters
{
    Graph _graph;
    Edges _edges;

    GraphParameters(const Graph& graph, const Edges& edges) :
        _graph(graph), _edges(edges)
    { }
};

template < class Parameters >
class FlatGraphManager :
    public paradevs::pdevs::GraphManager < MyTime, Parameters >
{
public:
    FlatGraphManager(common::Coordinator < MyTime >* coordinator,
        const Parameters& parameters) :
        paradevs::pdevs::GraphManager < MyTime, Parameters >(
            coordinator, parameters)
    { }

    virtual ~FlatGraphManager()
    {
        // TODO
    }

    void build_flat_graph(const Graph& g)
    {
        Graph::vertex_iterator vertexIt, vertexEnd;

        boost::tie(vertexIt, vertexEnd) = boost::vertices(g);
	for (; vertexIt != vertexEnd; ++vertexIt)
	{
            std::ostringstream ss;

            ss << "a" << *vertexIt;

            switch (g[*vertexIt]._type) {
            case TOP_PIXEL:
                _top_simulators[*vertexIt] =
                    new pdevs::Simulator <
                        MyTime, TopPixel, TopPixelParameters >(
                            ss.str(), TopPixelParameters());
                FlatGraphManager < Parameters >::add_child(
                    _top_simulators[*vertexIt]);
                break;
            case NORMAL_PIXEL:
                unsigned int n = 0;
                Graph::adjacency_iterator neighbourIt, neighbourEnd;

                boost::tie(neighbourIt, neighbourEnd) =
                    boost::adjacent_vertices(*vertexIt, g);
                for (; neighbourIt != neighbourEnd; ++neighbourIt) {
                    ++n;
                }
                _normal_simulators[*vertexIt] =
                    new pdevs::Simulator <
                        MyTime, NormalPixel, NormalPixelParameters >(
                            ss.str(), NormalPixelParameters(n));
                FlatGraphManager < Parameters >::add_child(
                        _normal_simulators[*vertexIt]);
                break;
            };
        }

        boost::tie(vertexIt, vertexEnd) = boost::vertices(g);
	for (; vertexIt != vertexEnd; ++vertexIt)
	{
            Graph::adjacency_iterator neighbourIt, neighbourEnd;

            boost::tie(neighbourIt, neighbourEnd) =
                boost::adjacent_vertices(*vertexIt, g);
            for (; neighbourIt != neighbourEnd; ++neighbourIt) {
                paradevs::common::Model < MyTime >* a = 0;
                paradevs::common::Model < MyTime >* b = 0;

                if (g[*vertexIt]._type == TOP_PIXEL) {
                    a = _top_simulators[*vertexIt];
                } else {
                    a = _normal_simulators[*vertexIt];
                }
                if (g[*neighbourIt]._type == TOP_PIXEL) {
                    b = _top_simulators[*neighbourIt];
                } else {
                    b = _normal_simulators[*neighbourIt];
                }
                FlatGraphManager < Parameters >::add_link(b, "out", a, "in");
            }
	}
    }

private:
    std::map < int, pdevs::Simulator <
                        MyTime, TopPixel,
                        TopPixelParameters >* > _top_simulators;
    std::map < int, pdevs::Simulator <
                        MyTime, NormalPixel,
                        NormalPixelParameters>* > _normal_simulators;
};

class BuiltFlatGraphManager :
    public FlatGraphManager < GraphParameters >
{
public:
    BuiltFlatGraphManager(common::Coordinator < MyTime >* coordinator,
                          const GraphParameters& parameters) :
        FlatGraphManager < GraphParameters >(
            coordinator, parameters)
    {
        build_flat_graph(parameters._graph);
    }

    virtual ~BuiltFlatGraphManager()
    { }
};

template < class GraphBuilder >
class InBuildFlatGraphManager :
    public FlatGraphManager < paradevs::common::NoParameters >
{
public:
    InBuildFlatGraphManager(common::Coordinator < MyTime >* coordinator,
                            const paradevs::common::NoParameters& parameters) :
        FlatGraphManager < paradevs::common::NoParameters >(
            coordinator, parameters)
    {
        GraphBuilder builder;
        Graphs graphs;
        EdgeList edges;

        builder.build(graphs, edges);
        build_flat_graph(graphs.front());
    }

    virtual ~InBuildFlatGraphManager()
    { }
};

class FlatGraphBuilder
{
public:
    FlatGraphBuilder()
    { }

    void build(Graphs& graphs, EdgeList& /* edges */)
    {
        Graph graph;

        Graph::vertex_descriptor v0 = boost::add_vertex(graph);
        Graph::vertex_descriptor v1 = boost::add_vertex(graph);
        Graph::vertex_descriptor v2 = boost::add_vertex(graph);
        Graph::vertex_descriptor v3 = boost::add_vertex(graph);
        Graph::vertex_descriptor v4 = boost::add_vertex(graph);
        Graph::vertex_descriptor v5 = boost::add_vertex(graph);
        Graph::vertex_descriptor v6 = boost::add_vertex(graph);
        Graph::vertex_descriptor v7 = boost::add_vertex(graph);
        Graph::vertex_descriptor v8 = boost::add_vertex(graph);
        Graph::vertex_descriptor v9 = boost::add_vertex(graph);
        Graph::vertex_descriptor v10 = boost::add_vertex(graph);

        boost::add_edge(v0, v1, 1, graph);
	boost::add_edge(v0, v2, 1, graph);
	boost::add_edge(v0, v3, 1, graph);
	boost::add_edge(v1, v2, 1, graph);
	boost::add_edge(v1, v4, 1, graph);
	boost::add_edge(v1, v5, 1, graph);
	boost::add_edge(v1, v6, 1, graph);
	boost::add_edge(v2, v6, 1, graph);
	boost::add_edge(v2, v3, 1, graph);
	boost::add_edge(v3, v9, 1, graph);
	boost::add_edge(v3, v10, 1, graph);
	boost::add_edge(v4, v5, 1, graph);
	boost::add_edge(v5, v6, 1, graph);
	boost::add_edge(v4, v7, 1, graph);
	boost::add_edge(v4, v8, 1, graph);
	boost::add_edge(v7, v8, 1, graph);
	boost::add_edge(v9, v10, 1, graph);

        graph[v6] = VertexProperties(1, TOP_PIXEL);
        graph[v8] = VertexProperties(1, TOP_PIXEL);
        graph[v10] = VertexProperties(1, TOP_PIXEL);
        graph[v0] = VertexProperties(1, NORMAL_PIXEL);
        graph[v1] = VertexProperties(1, NORMAL_PIXEL);
        graph[v2] = VertexProperties(1, NORMAL_PIXEL);
        graph[v3] = VertexProperties(1, NORMAL_PIXEL);
        graph[v4] = VertexProperties(1, NORMAL_PIXEL);
        graph[v5] = VertexProperties(1, NORMAL_PIXEL);
        graph[v7] = VertexProperties(1, NORMAL_PIXEL);
        graph[v9] = VertexProperties(1, NORMAL_PIXEL);

        graphs.push_back(graph);
    }
};

template < class GraphBuilder >
class HierarchicalGraphManager :
    public paradevs::pdevs::GraphManager < MyTime,
                                           paradevs::common::NoParameters >
{
public:
    HierarchicalGraphManager(common::Coordinator < MyTime >* coordinator,
                             const paradevs::common::NoParameters& parameters) :
        paradevs::pdevs::GraphManager < MyTime,
                                        paradevs::common::NoParameters >(
                                            coordinator, parameters)
    {
        GraphBuilder graph_builder;
        Graphs graphs;
        EdgeList edges;

        graph_builder.build(graphs, edges);

        // build coordinators (graphs)
        for (unsigned int i = 0; i < graphs.size(); ++i) {
            Coordinator* coordinator = 0;
            std::ostringstream ss;

            ss << "S" << i;
            coordinator =
                new Coordinator(ss.str(), paradevs::common::NoParameters(),
                                GraphParameters(graphs[i], edges[i]));
            _coordinators.push_back(coordinator);
            HierarchicalGraphManager < GraphBuilder >::add_child(
                coordinator);

        }

        // builds internal connections (edges)
        for (unsigned int i = 0; i < edges.size(); ++i) {
            // TODO
        }
    }

    virtual ~HierarchicalGraphManager()
    {
        // TODO
    }

private:
    typedef paradevs::pdevs::Coordinator <
    MyTime,
    paradevs::common::scheduler::VectorScheduler < MyTime >,
    BuiltFlatGraphManager, paradevs::common::NoParameters,
    GraphParameters > Coordinator;

    std::vector < Coordinator* > _coordinators;
};

class HierarchicalGraphBuilder
{
public:
    HierarchicalGraphBuilder()
    { }

    void build(Graphs& graphs, EdgeList& edges)
    {
        // S1
        {
            Graph graph;

            Graph::vertex_descriptor v1 = boost::add_vertex(graph);
            Graph::vertex_descriptor v2 = boost::add_vertex(graph);
            Graph::vertex_descriptor v4 = boost::add_vertex(graph);
            Graph::vertex_descriptor v5 = boost::add_vertex(graph);
            Graph::vertex_descriptor v6 = boost::add_vertex(graph);
            Graph::vertex_descriptor v7 = boost::add_vertex(graph);
            Graph::vertex_descriptor v8 = boost::add_vertex(graph);

            boost::add_edge(v1, v2, 1, graph);
            boost::add_edge(v1, v4, 1, graph);
            boost::add_edge(v1, v5, 1, graph);
            boost::add_edge(v1, v6, 1, graph);
            boost::add_edge(v2, v6, 1, graph);
            boost::add_edge(v4, v5, 1, graph);
            boost::add_edge(v5, v6, 1, graph);
            boost::add_edge(v4, v7, 1, graph);
            boost::add_edge(v4, v8, 1, graph);
            boost::add_edge(v7, v8, 1, graph);

            graph[v6] = VertexProperties(1, TOP_PIXEL);
            graph[v8] = VertexProperties(1, TOP_PIXEL);
            graph[v1] = VertexProperties(1, NORMAL_PIXEL);
            graph[v2] = VertexProperties(1, NORMAL_PIXEL);
            graph[v4] = VertexProperties(1, NORMAL_PIXEL);
            graph[v5] = VertexProperties(1, NORMAL_PIXEL);
            graph[v7] = VertexProperties(1, NORMAL_PIXEL);

            graphs.push_back(graph);
        }
        // S2
        {
            Graph graph;

            Graph::vertex_descriptor v0 = boost::add_vertex(graph);
            Graph::vertex_descriptor v3 = boost::add_vertex(graph);
            Graph::vertex_descriptor v9 = boost::add_vertex(graph);
            Graph::vertex_descriptor v10 = boost::add_vertex(graph);

            boost::add_edge(v0, v3, 1, graph);
            boost::add_edge(v3, v10, 1, graph);
            boost::add_edge(v9, v10, 1, graph);
            boost::add_edge(v3, v9, 1, graph);

            graph[v10] = VertexProperties(1, TOP_PIXEL);
            graph[v0] = VertexProperties(1, NORMAL_PIXEL);
            graph[v3] = VertexProperties(1, NORMAL_PIXEL);
            graph[v9] = VertexProperties(1, NORMAL_PIXEL);

            graphs.push_back(graph);
        }
        {
            // S1 -> S2
            edges.push_back(std::vector < std::pair < int, int >>());
            edges[0].push_back(std::pair < int, int >(1, 0));
            edges[0].push_back(std::pair < int, int >(2, 0));
            // S2 -> S1
            edges.push_back(std::vector < std::pair < int, int >>());
            edges[1].push_back(std::pair < int, int >(3, 2));
        }
    }
};

} } } // namespace paradevs tests boost_graph

#endif