A Dynamic Task Scheduling Algorithm for Airborne Device Clouds

Algorithm 2

Definition of data structures for task structure graphs.

class Graph{

string name;   //name of the function

int anum;    //number of arguments to the function

vector<string> argname;       //list of arguments of the function

int begin_pos;      //start position of the node

int end_pos;      //end position of the node

bool isok;     //Is the function built?

string type;      //The type of the node

int relation;       //To determine the relation of the node to the previous node when traversing from the bottom up.

string content;       //Content of the node

Graph * next;       //Points to the next node which is the node of the iterative relation.

Graph * brother;        //Points to the brother node, the node in the juxtaposition relationship.

Graph * father;      //Points to the father node.

Graph * child;      //Points to the child node.

};