RhodeCode

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

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

 *

 * Copyright (C) 2003-2009

 * 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.

 *

 */

#ifndef LEMON_GRAPH_TO_EPS_H

#define LEMON_GRAPH_TO_EPS_H

#include<iostream>

#include<fstream>

#include<sstream>

#include<algorithm>

#include<vector>

#ifndef WIN32

#include<sys/time.h>

#include<ctime>

#else

#define WIN32_LEAN_AND_MEAN

#define NOMINMAX

#include<windows.h>

#endif

#include<lemon/math.h>

#include<lemon/core.h>

#include<lemon/dim2.h>

#include<lemon/maps.h>

#include<lemon/color.h>

#include<lemon/bits/bezier.h>

#include<lemon/error.h>

///\ingroup eps_io

///\file

///\brief A well configurable tool for visualizing graphs

namespace lemon {

  namespace _graph_to_eps_bits {

    template<class MT>

    class _NegY {

    public:

      typedef typename MT::Key Key;

      typedef typename MT::Value Value;

      const MT ↦

      int yscale;

      _NegY(const MT &m,bool b) : map(m), yscale(1-b*2) {}

      Value operator[](Key n) { return Value(map[n].x,map[n].y*yscale);}

    };

  }

///Default traits class of GraphToEps

///Default traits class of \ref GraphToEps.

///

///\c G is the type of the underlying graph.

template<class G>

struct DefaultGraphToEpsTraits

{

  typedef G Graph;

  typedef typename Graph::Node Node;

  typedef typename Graph::NodeIt NodeIt;

  typedef typename Graph::Arc Arc;

  typedef typename Graph::ArcIt ArcIt;

  typedef typename Graph::InArcIt InArcIt;

  typedef typename Graph::OutArcIt OutArcIt;

  const Graph &g;

  std::ostream& os;

  typedef ConstMap<typename Graph::Node,dim2::Point<double> > CoordsMapType;

  CoordsMapType _coords;

  ConstMap<typename Graph::Node,double > _nodeSizes;

  ConstMap<typename Graph::Node,int > _nodeShapes;

  ConstMap<typename Graph::Node,Color > _nodeColors;

  ConstMap<typename Graph::Arc,Color > _arcColors;

  ConstMap<typename Graph::Arc,double > _arcWidths;

  double _arcWidthScale;

  double _nodeScale;

  double _xBorder, _yBorder;

  double _scale;

  double _nodeBorderQuotient;

  bool _drawArrows;

  double _arrowLength, _arrowWidth;

  bool _showNodes, _showArcs;

  bool _enableParallel;

  double _parArcDist;

  bool _showNodeText;

  ConstMap<typename Graph::Node,bool > _nodeTexts;

  double _nodeTextSize;

  bool _showNodePsText;

  ConstMap<typename Graph::Node,bool > _nodePsTexts;

  char *_nodePsTextsPreamble;

  bool _undirected;

  bool _pleaseRemoveOsStream;

  bool _scaleToA4;

  std::string _title;

  std::string _copyright;

  enum NodeTextColorType

    { DIST_COL=0, DIST_BW=1, CUST_COL=2, SAME_COL=3 } _nodeTextColorType;

  GraphToEps<T> &distantColorNodeTexts()

  {_nodeTextColorType=DIST_COL;return *this;}

  ///Sets the color of the node texts to be black or white and always visible.

  ///Sets the color of the node texts to be black or white according to

  ///which is more different from the node color.

  GraphToEps<T> &distantBWNodeTexts()

  {_nodeTextColorType=DIST_BW;return *this;}

  ///Gives a preamble block for node Postscript block.

  ///Gives a preamble block for node Postscript block.

  ///

  ///\sa nodePsTexts()

  GraphToEps<T> & nodePsTextsPreamble(const char *str) {

    _nodePsTextsPreamble=str ;return *this;

  }

  ///Sets whether the graph is undirected

  ///Sets whether the graph is undirected.

  ///

  ///This setting is the default for undirected graphs.

  ///

  ///\sa directed()

   GraphToEps<T> &undirected(bool b=true) {_undirected=b;return *this;}

  ///Sets whether the graph is directed

  ///Sets whether the graph is directed.

  ///Use it to show the edges as a pair of directed ones.

  ///

  ///This setting is the default for digraphs.

  ///

  ///\sa undirected()

  GraphToEps<T> &directed(bool b=true) {_undirected=!b;return *this;}

  ///Sets the title.

  ///Sets the title of the generated image,

  ///namely it inserts a <tt>%%Title:</tt> DSC field to the header of

  ///the EPS file.

  GraphToEps<T> &title(const std::string &t) {_title=t;return *this;}

  ///Sets the copyright statement.

  ///Sets the copyright statement of the generated image,

  ///namely it inserts a <tt>%%Copyright:</tt> DSC field to the header of

  ///the EPS file.

  GraphToEps<T> &copyright(const std::string &t) {_copyright=t;return *this;}

protected:

  bool isInsideNode(dim2::Point<double> p, double r,int t)

  {

    switch(t) {

    case CIRCLE:

    case MALE:

    case FEMALE:

      return p.normSquare()<=r*r;

    case SQUARE:

      return p.x<=r&&p.x>=-r&&p.y<=r&&p.y>=-r;

    case DIAMOND:

      return p.x+p.y<=r && p.x-p.y<=r && -p.x+p.y<=r && -p.x-p.y<=r;

    }

    return false;

  }

public:

  ~GraphToEps() { }

  ///Draws the graph.

  ///Like other functions using

  ///\ref named-templ-func-param "named template parameters",

  ///this function calls the algorithm itself, i.e. in this case

  ///it draws the graph.

  void run() {

    const double EPSILON=1e-9;

    if(dontPrint) return;

    _graph_to_eps_bits::_NegY<typename T::CoordsMapType>

      mycoords(_coords,_negY);

    os << "%!PS-Adobe-2.0 EPSF-2.0\n";

    if(_title.size()>0) os << "%%Title: " << _title << '\n';

     if(_copyright.size()>0) os << "%%Copyright: " << _copyright << '\n';

    os << "%%Creator: LEMON, graphToEps()\n";

    {

#ifndef WIN32

      timeval tv;

      gettimeofday(&tv, 0);

      char cbuf[26];

      ctime_r(&tv.tv_sec,cbuf);

      os << "%%CreationDate: " << cbuf;

#else

      SYSTEMTIME time;

      GetSystemTime(&time);

      if (GetDateFormat(LOCALE_USER_DEFAULT, 0, &time,

          GetTimeFormat(LOCALE_USER_DEFAULT, 0, &time,

          GetDateFormat(LOCALE_USER_DEFAULT, 0, &time,

        os << "%%CreationDate: " << buf1 << ' '

           << buf2 << ' ' << buf3 << std::endl;

      }

#endif

    }

    if (_autoArcWidthScale) {

      double max_w=0;

      for(ArcIt e(g);e!=INVALID;++e)

        max_w=std::max(double(_arcWidths[e]),max_w);

      if(max_w>EPSILON) {

        _arcWidthScale/=max_w;

      }

    }

    if (_autoNodeScale) {

      double max_s=0;

      for(NodeIt n(g);n!=INVALID;++n)

        max_s=std::max(double(_nodeSizes[n]),max_s);

      if(max_s>EPSILON) {

        _nodeScale/=max_s;

      }

    }

    double diag_len = 1;

    if(!(_absoluteNodeSizes&&_absoluteArcWidths)) {

      dim2::Box<double> bb;

      for(NodeIt n(g);n!=INVALID;++n) bb.add(mycoords[n]);

      if (bb.empty()) {

        bb = dim2::Box<double>(dim2::Point<double>(0,0));

      }

      diag_len = std::sqrt((bb.bottomLeft()-bb.topRight()).normSquare());

      if(diag_len<EPSILON) diag_len = 1;

      if(!_absoluteNodeSizes) _nodeScale*=diag_len;

      if(!_absoluteArcWidths) _arcWidthScale*=diag_len;

    }

    dim2::Box<double> bb;

    for(NodeIt n(g);n!=INVALID;++n) {

      double ns=_nodeSizes[n]*_nodeScale;

      dim2::Point<double> p(ns,ns);

      switch(_nodeShapes[n]) {

      case CIRCLE:

      case SQUARE:

      case DIAMOND:

        bb.add(p+mycoords[n]);

        bb.add(-p+mycoords[n]);

        break;

      case MALE:

        bb.add(-p+mycoords[n]);

        bb.add(dim2::Point<double>(1.5*ns,1.5*std::sqrt(3.0)*ns)+mycoords[n]);

        break;

      case FEMALE:

        bb.add(p+mycoords[n]);

        bb.add(dim2::Point<double>(-ns,-3.01*ns)+mycoords[n]);

        break;

      }

    }

    if (bb.empty()) {

      bb = dim2::Box<double>(dim2::Point<double>(0,0));

    }

    if(_scaleToA4)

      os <<"%%BoundingBox: 0 0 596 842\n%%DocumentPaperSizes: a4\n";

    else {

      if(_preScale) {

        //Rescale so that BoundingBox won't be neither to big nor too small.

        while(bb.height()*_scale>1000||bb.width()*_scale>1000) _scale/=10;

        while(bb.height()*_scale<100||bb.width()*_scale<100) _scale*=10;

      }

      os << "%%BoundingBox: "

         << int(floor(bb.left()   * _scale - _xBorder)) << ' '

         << int(floor(bb.bottom() * _scale - _yBorder)) << ' '

         << int(ceil(bb.right()  * _scale + _xBorder)) << ' '

         << int(ceil(bb.top()    * _scale + _yBorder)) << '\n';

    }

    os << "%%EndComments\n";

    //x1 y1 x2 y2 x3 y3 cr cg cb w

    os << "/lb { setlinewidth setrgbcolor newpath moveto\n"

       << "      4 2 roll 1 index 1 index curveto stroke } bind def\n";

    os << "/l { setlinewidth setrgbcolor newpath moveto lineto stroke }"

       << " bind def\n";

    //x y r

    os << "/c { newpath dup 3 index add 2 index moveto 0 360 arc closepath }"

       << " bind def\n";

    //x y r

    os << "/sq { newpath 2 index 1 index add 2 index 2 index add moveto\n"

       << "      2 index 1 index sub 2 index 2 index add lineto\n"

       << "      2 index 1 index sub 2 index 2 index sub lineto\n"

       << "      2 index 1 index add 2 index 2 index sub lineto\n"

       << "      closepath pop pop pop} bind def\n";

    //x y r

    os << "/di { newpath 2 index 1 index add 2 index moveto\n"

       << "      2 index             2 index 2 index add lineto\n"

       << "      2 index 1 index sub 2 index             lineto\n"

       << "      2 index             2 index 2 index sub lineto\n"

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

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

 *

 * Copyright (C) 2003-2009

 * 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.

 *

 */

#ifndef LEMON_TIME_MEASURE_H

#define LEMON_TIME_MEASURE_H

///\ingroup timecount

///\file

///\brief Tools for measuring cpu usage

#ifdef WIN32

#define WIN32_LEAN_AND_MEAN

#define NOMINMAX

#include <windows.h>

#include <cmath>

#else

#include <sys/times.h>

#include <sys/time.h>

#endif

#include <string>

#include <fstream>

#include <iostream>

namespace lemon {

  /// \addtogroup timecount

  /// @{

  /// A class to store (cpu)time instances.

  /// This class stores five time values.

  /// - a real time

  /// - a user cpu time

  /// - a system cpu time

  /// - a user cpu time of children

  /// - a system cpu time of children

  ///

  /// TimeStamp's can be added to or substracted from each other and

  /// they can be pushed to a stream.

  ///

  /// In most cases, perhaps the \ref Timer or the \ref TimeReport

  /// class is what you want to use instead.

  class TimeStamp

  {

    double utime;

    double stime;

    double cutime;

    double cstime;

    double rtime;

    void _reset() {

      utime = stime = cutime = cstime = rtime = 0;

    }

  public:

    ///Read the current time values of the process

    void stamp()

    {

#ifndef WIN32

      timeval tv;

      gettimeofday(&tv, 0);

      rtime=tv.tv_sec+double(tv.tv_usec)/1e6;

      tms ts;

      double tck=sysconf(_SC_CLK_TCK);

      times(&ts);

      utime=ts.tms_utime/tck;

      stime=ts.tms_stime/tck;

      cutime=ts.tms_cutime/tck;

      cstime=ts.tms_cstime/tck;

#else

      static const double ch = 4294967296.0e-7;

      static const double cl = 1.0e-7;

      FILETIME system;

      GetSystemTimeAsFileTime(&system);

      rtime = ch * system.dwHighDateTime + cl * system.dwLowDateTime;

      FILETIME create, exit, kernel, user;

      if (GetProcessTimes(GetCurrentProcess(),&create, &exit, &kernel, &user)) {

        utime = ch * user.dwHighDateTime + cl * user.dwLowDateTime;

        stime = ch * kernel.dwHighDateTime + cl * kernel.dwLowDateTime;

        cutime = 0;

        cstime = 0;

      } else {

        rtime = 0;

        utime = 0;

        stime = 0;

        cutime = 0;

        cstime = 0;

      }

#endif

    }

    /// Constructor initializing with zero

    TimeStamp()

    { _reset(); }

    ///Constructor initializing with the current time values of the process

    TimeStamp(void *) { stamp();}

    ///Set every time value to zero

    TimeStamp &reset() {_reset();return *this;}

    ///\e

    TimeStamp &operator+=(const TimeStamp &b)

    {

      utime+=b.utime;

      stime+=b.stime;

      cutime+=b.cutime;