set_graph Class Reference

Public Member Functions
void	init_edge (int edge, int dep_sz, int *dep_list)
void	dependancy_sort (int *dependancy_list, int *check)
void	delete_tree ()
void	print ()

Private Member Functions
void	recur_graph (int set_id, int *dependancy_list, int current_tree, int *check)

Private Attributes
vector< struct Edge >	set_gr
int	depend_stack

Detailed Description

Definition at line 40 of file set_graph.cpp.

Member Function Documentation

delete_tree()

void set_graph::delete_tree ( )

inline

Definition at line 154 of file set_graph.cpp.

    {
      std::vector<struct Edge>().swap(set_gr);
    }

dependancy_sort()

void set_graph::dependancy_sort ( int * dependancy_list, int * check )

inline

Definition at line 124 of file set_graph.cpp.

    {
      depend_stack=0;
 
      for (auto edge = set_gr.begin(); edge != set_gr.end(); edge++){
         int edg_id = edge -> id;
 
         if ( edge->dep_size == 0 && edge->color == 0){
 
            edge->color =edge->id;
            dependancy_list[depend_stack] = edg_id;
            depend_stack++;
 
         }else { 
                 recur_graph(edg_id, dependancy_list, edg_id ,check); 
                  if (*check < 0) return;                                            // Error occurred do not continue
         }
      }
    }

init_edge()

void set_graph::init_edge ( int edge, int dep_sz, int * dep_list )

inline

Definition at line 94 of file set_graph.cpp.

    {
       struct Edge edg;
       edg.id=edge;
       edg.dep_size=dep_sz;
       edg.color=0;
       edg.closed_tree_check = 0;
 
       edg.set_list = new int [dep_sz];
     
       for (int i=0;i<dep_sz;i++)
       { 
         edg.set_list[i] = dep_list[i];
         
        }
        set_gr.push_back(edg);
    }

print()

void set_graph::print ( )

inline

Definition at line 159 of file set_graph.cpp.

    {
      for (auto edge = set_gr.begin(); edge != set_gr.end(); edge++){
        cout << "id: " << edge->id << " color: " << edge->color << " size: " << edge->dep_size  << endl;
        cout << "    ";
        int * list = edge-> set_list;
        for (int i=0; i< edge->dep_size ; i++){
           cout << list[i] << "," ;
        }
        cout << endl;
      }
    }

recur_graph()

void set_graph::recur_graph ( int set_id, int * dependancy_list, int current_tree, int * check )

inlineprivate

Definition at line 48 of file set_graph.cpp.

    {
 
      if (*check < 0) return;                                                 // Error occurred do not continue
 
      auto edge = set_gr.begin()+set_id-1;   
      if (edge -> color > 0) return;                                          // Current set appears already in list
 
      if (edge->closed_tree_check == current_tree) {                         
        // cout << "error infinite dependency in SET found" << endl;          // if check fails this SET has been visited twice for Same Root SET.
        *check = -current_tree;                                               // Do not continue
        return;
      }
 
      edge->closed_tree_check=current_tree;                                   // closed_check is colored with the Root SET of the tree
 
      for (int i=0; i< edge->dep_size; i++) {
         int new_set = edge->set_list[i];
         // cout << "curr_tree= "<< edge->closed_tree_check  <<  " cur_set= " << set_id << " new_set= " <<  new_set << endl;
         recur_graph(new_set, dependancy_list, current_tree,check );
 
         if (*check < 0) return;                                              // Error occurred do not continue
      }
 
 
      if (  edge->color == 0){                                                // If leave store it in dependency list
            edge->color =edge->id;
            dependancy_list[depend_stack] = edge -> id;
            // cout << "Stack " <<  edge -> id << endl;
            depend_stack++;
       }
        
    }

Field Documentation

depend_stack

int set_graph::depend_stack

private

Definition at line 44 of file set_graph.cpp.

set_gr

vector<struct Edge> set_graph::set_gr

private

Definition at line 43 of file set_graph.cpp.

---

The documentation for this class was generated from the following file:

• common_source/tools/set_operation/set_graph.cpp