graph_extractor.h

#ifndef GRAPH_EXTRACTOR_H_
#define GRAPH_EXTRACTOR_H_

#include <vector>
#include <utility> // pair

#include "AdjacencyList.h"

namespace Layout {
  
  const int UNUSED_TREENODE_ID = -1;

  struct tree_node {
    unsigned int id;
    
    tree_node* parent;
    std::vector<tree_node*> children;
    unsigned int num_tree_nodes;

    int x;
    int y;
    

    tree_node() {
      id = UNUSED_TREENODE_ID;
    }

  };
  
  AdjacencyList* make_undirected(AdjacencyList& g);
  
  std::vector<tree_node*>* make_trees(AdjacencyList& g);

  std::vector<tree_node*>* make_trees(AdjacencyList& g, unsigned int start);
  
  tree_node* make_tree(AdjacencyList& g, unsigned int start);

  void get_positions(tree_node* tn, std::vector<std::pair<int, int> >& pos);

  void move_positions(tree_node* tn, int x_offset, int y_offset);
  
  void del_tree(tree_node* tn);
}

#endif