//-*-c++-*-
#ifndef _ARITYSEGMENTRECCLUSTERING_H
#define _ARITYSEGMENTRECCLUSTERING_H
#include <tulip/TulipPlugin.h>
/// AritySegmentRecClustering.h - a tree clustering algorithm.
/** This plugin implement the statistical tree clustering algorithm 
 *  first published as :
 *
 *  D. Auber and M. Delest,
 *  "A clustering algorithm for huge trees",
 *  "Advances in Applied Mathematics",
 *  "To appear (Accepted 2002)",
 *  pages "1--14"
 *  publisher "Academic press"
 *
 *  HISTORY:
 *
 *  01/01/2002 Verson 0.0.1: Initial release
 *
 *  NOTES:
 *
 *  This version is the one which use maximum segment length and aity to make clustering.
 *
 *  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 AritySegmentRecClustering:public Clustering {
public:
  AritySegmentRecClustering(ClusterContext);
  ~AritySegmentRecClustering();
  bool run();
  bool check(std::string &);
  void reset();

private:
  bool DfsClustering (node ,SelectionProxy *,SelectionProxy *);
  void getRecurseChild(node,SelectionProxy *,SelectionProxy *);
  MetricProxy *arityM;
  MetricProxy *leafM;
  MetricProxy *nodeM;
  MetricProxy *segmentM;
  int mResult;
  double inter;
};

#endif