/* -*- C++ -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library

 *

 * Copyright (C) 2003-2007

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#include <iostream>

#include <fstream>

#include <lemon/smart_graph.h>

#include <lemon/dijkstra.h>

#include <lemon/maps.h>

#include <lemon/dim2.h>

#include <lemon/graph_reader.h>

#include <lemon/time_measure.h>

#include <cmath>

/// \ingroup demos

/// \file

/// \brief Minimal route on a planar graph with eucledian distances.

///

/// Minimal route on a planar graph with eucledian distances.

///

/// \include min_route.cc

using namespace lemon;

template <typename CoordMap>

class PotentialMap {

public:

  typedef double Value;

  typedef typename CoordMap::Key Key;

  PotentialMap(const CoordMap& _coord, const dim2::Point<double>& _target)

    : coord(_coord), target(_target) {}

  double operator[](const Key& node) const {

    return std::sqrt((coord[node].x - target.x) * (coord[node].x - target.x) + 

		     (coord[node].y - target.y) * (coord[node].y - target.y));

  }

private:

  const CoordMap& coord;

  dim2::Point<double> target;

};

template <typename Graph, typename LengthMap, typename PotentialMap>

class ReducedLengthMap {

public:

  typedef double Value;

  typedef typename LengthMap::Key Key;

  ReducedLengthMap(const Graph& _graph, const LengthMap& _length, 

		   const PotentialMap& _pot) 

    : graph(_graph), length(_length), pot(_pot) {}

  Value operator[](const Key& edge) const {

    return length[edge] - (pot[graph.source(edge)] - pot[graph.target(edge)]);

  }

private:

  const Graph& graph;

  const LengthMap& length;

  const PotentialMap& pot;

};

int main() {

  typedef SmartGraph Graph;

  typedef Graph::Edge Edge;

  typedef Graph::Node Node;

  typedef Graph::EdgeIt EdgeIt;

  typedef Graph::NodeIt NodeIt;

  typedef Graph::EdgeMap<double> LengthMap;

  typedef Graph::NodeMap<dim2::Point<double> > CoordMap;

  SmartGraph graph;

  std::ifstream is("route.lgf");

  GraphReader<Graph> reader(is, graph);

  CoordMap coord(graph);

  dim2::XMap<CoordMap> xcoord = xMap(coord);

  reader.readNodeMap("coordinates_x", xcoord);

  dim2::YMap<CoordMap> ycoord = yMap(coord);

  reader.readNodeMap("coordinates_y", ycoord);

  LengthMap length(graph);

  reader.readEdgeMap("length", length);

  Node source, target;

  reader.readNode("source", source);

  reader.readNode("target", target);

  reader.run();

  {

    Timer timer;

    Dijkstra<Graph, LengthMap> dijkstra(graph, length);

    dijkstra.init();

    dijkstra.addSource(source);

    dijkstra.start(target);

    std::cout << dijkstra.dist(target) << std::endl;

    std::cout << timer << std::endl;

  }

  {

    Timer timer;

    typedef PotentialMap<CoordMap> Potential;

    Potential potential(coord, coord[target]);

    typedef ReducedLengthMap<Graph, LengthMap, Potential> ReducedLength;

    ReducedLength reduced(graph, length, potential);

    Dijkstra<Graph, ReducedLength> dijkstra(graph, reduced);

    dijkstra.init();

    dijkstra.addSource(source);

    dijkstra.start(target);

    std::cout << dijkstra.dist(target) + potential[source] << std::endl;

    std::cout << timer << std::endl;

  }

  return 0;

}