Class xlifepp::Graph#

class Graph : public std::vector<std::vector<number_t>>#

Inheritence diagram for xlifepp::Graph:

Collaboration diagram for xlifepp::Graph:

class to deal with general graphs

Public Functions

inline Graph(number_t dim)#: basic constructor

number_t bandWidth() const#: compute band width (maximum distance between connected nodes)

number_t maximumDegree() const#

compute maximum Degree i.e.

maximum number of neighbors taken over all nodes compute band width (maximum distance between connected nodes) and length of skyline storage associated to sets

inline number_t nodeDegree(number_t n) const#: degree of node n

void print(const string_t &title = "") const#: print utility

void print(std::ostream&, const string_t&) const#: print utility

void printNodes(const std::vector<number_t>&)#: print utility

void printNodes(std::ostream&, const std::vector<number_t>&)#: print utility

std::vector<number_t> renumber(number_t nb_Nodes)#: renumbering algorithm to minimize band width

number_t renumEngine(std::vector<bool> &markers, std::vector<number_t> &n_tree, number_t &itree, number_t max_degree, number_t &i_begin, number_t &i_level)#: renumbering algorithm to minimize band width

number_t skylineSize() const#: compute length of skyline storage associated to sets

void sortByAscendingDegree()#

sort Graph by ascending degree (i.e.

by vector<number_t> size)