#ifndef __STRIPPER_H__
#define __STRIPPER_H__

#include <vector>
#include <map>
#include <list>
#include <set>
#include <LEDA/partition.h>
#include <LEDA/graph.h>

#include "PLY.h"
#include "convexhull.h"
#include "dual.h"
#include "dfs.h"
#include "displayer.h"

// Class that takes a PLYObject and obtains its single strip
class Stripper
{
 public:
	Stripper(PLYObject& ply);
	~Stripper();

  void makeDual();
  void draw();
  void preprocessBoundary();
  void findMatching();
  void findJunctionsLoopsPaths();
  void connectJunctions();
  void dfsTraversal();
  void removeCutEdges();

  /* Splitting */
  void splitEdge(int e, bool update_matching = false);
  void splitEdge(int n1, int n2, bool update_matching = false);
  void doubleSplitEdge(int n);
  bool matchededge(int e);
  bool matchednode(int n);

	PLYObject& _ply;
  dual* _dual;
  dfs* _dfs;
  Displayer* _displayer;


  std::vector<bool> _matching;
  std::vector<bool> _matching2;
  std::vector<bool> _matching3;


  /* list of cut edges - DFS */
  std::vector<int> _cutedges;


  /* Junction node crap */

  /* List of junction nodes */
  std::vector<int> _junctions;

  bool isJunction(int n);
  std::vector<int> followTrail(int n, int e, int& ndest, int& edest);
  bool alreadyVisited(std::vector<int>&, int e);

  void splitTrail(std::vector<int> trail);
  void findAlternatingPath(std::vector<int> trail);
  

  /* The junction node graph */
  /* The nodes are in _junctions */
  
};


#endif