ckpttn-cpp/tree_8hpp_source.html

#ifndef CKPTTN_MIDLEVEL_TREE_HPP

#define CKPTTN_MIDLEVEL_TREE_HPP


#include <list>

#include <vector>


#include "vertex.hpp"


class MidTree {

  public:

    explicit MidTree(const MidVertex& x);

    bool flip_tree();

    void rotate();

    void to_bitstring(int x[]) const;


  private:

    int num_vertices_;

    int root_;

    std::vector<std::list<int>> children_;

    std::vector<int> parent_;


    int deg(int u) const;

    int num_children(int u) const;

    int ith_child(int u, int i) const;

    bool is_tau_preimage() const;

    bool is_tau_image() const;

    void tau();

    void tau_inverse();

    void move_leaf(int leaf, int new_parent, int pos);

    void rotate_to_vertex(int u);

    void rotate_children();

    void rotate_children(int k);

    void root_canonically();

    void compute_center(int& c1, int& c2) const;

    bool is_flip_tree_tau();

    bool is_star() const;

    bool is_light_dumbbell() const;

    bool is_thin_leaf(int u) const;

    bool has_thin_leaf() const;

    int count_pending_edges(int u) const;

    void to_bitstring_rec(int x[], int u, int& pos) const;

    int min_string_rotation(int x[], int length);

};


#endif

MidTree
Tree data structure for mid-level Gray code algorithm.
Definition tree.hpp:29

MidTree::rotate
void rotate()
Rotate the tree to a canonical form.

MidTree::MidTree
MidTree(const MidVertex &x)
Construct a MidTree from a MidVertex bitstring.

MidTree::flip_tree
bool flip_tree()
Perform a flip-tree operation (tau transformation)

MidTree::to_bitstring
void to_bitstring(int x[]) const
Convert the tree to a bitstring representation.

MidVertex
Bitstring vertex for middle-levels Gray code algorithm.
Definition vertex.hpp:24

vertex.hpp
Bitstring vertex representation for middle-levels Gray code.