//-*-c++-*-
#ifndef _TREELEAFLAYOUT_H
#define _TREELEAFLAYOUT_H

#if (__GNUC__ < 3)
#include <hash_map>
#else
#include <ext/hash_map>
#endif

#include <tulip/TulipPlugin.h>

class MetricProxy;
class SizesProxy;



/// TreeMap.h - An implementation of the tree map layout.
/** This plugin is an implementation of the tree map layout
 *  algorithm first published as:
 *
 *  Shneiderman, B. (March 1991)
 *  Tree visualization with treemaps: a 2-d space-filling approach
 *  ACM Transactions on Graphics, vol. 11, 1 (Jan. 1992) 92-99.
 *  HCIL-91-03, CS-TR-2645, CAR-TR-548 
 *
 *  HISTORY:
 *
 *  01/04/99 Verson 0.0.1: Initial release
 *
 *  NOTES:
 *
 *  This algorithm only work on trees.
 *  This version use the "viewMetric" property to determine
 *  The size of elements.
 *  Let n be the number of nodes, the algorithm complexity is in O(n).
 *
 *  AUTHOR:
 *
 *  David Auber University Bordeaux I France: Email:auber@tulip-software.com
 *
 *  LICENCE:
 *
 *  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 2 of the License, or     
 *  (at your option) any later version.
 *
*/
class TreeMap:public Layout { 
public:
  TreeMap(PropertyContext *);
  ~TreeMap();
  bool run();
  bool check(std::string &);
  void reset();


private:
  void dfsPlacement(node n, int depth, double x, double y, double width, double height,
		    bool direction, STL_EXT_NS::hash_map<node,double> &value);
  double initVal(node n, STL_EXT_NS::hash_map<node,double> &value);
  SizesProxy *size;
  MetricProxy *metric;
  ColorsProxy *color;
};

#endif