40namespace energybased {
109 template<
typename Comp>
Includes declaration of graph class.
Declaration of doubly linked lists and iterators.
Declaration and implementation of NodeArray class.
Declaration of class NodeAttributes.
Data type for general directed graphs (adjacency list representation).
Dynamic arrays indexed with nodes.
Class for the representation of nodes.
Helping data structure that holds set S_node of nodes in the range [0, G.number_of_nodes()-1] (needed...
node get_random_node_with_lowest_star_mass(int rand_tries)
Gets rand_tries random elements from S_node and selects the one with the lowest mass_of_star and upda...
node * S_node
representation of the node set S_node[0,G.number_of_nodes()-1]
void set_seed(int rand_seed)
the the random seed to rand_seed
node get_random_node_with_highest_star_mass(int rand_tries)
Gets rand_tries random elements from S_node and selects the one with the highest mass_of_star and upd...
void delete_node(node v)
Deletes the node v from S_node.
NodeArray< int > mass_of_star
the sum of the masses of a node and its neighbours
node get_random_node()
Selects a random element from S_node with uniform probability and updates S_node and position_in_node...
void init_node_set(Graph &G, NodeArray< NodeAttributes > &A)
Same as init_node_set(G), but additionally the array mass_of_star is caculated.
int last_selectable_index_of_S_node
index of the last randomly choosable element in S_node (this value is decreased after each select ope...
NodeArray< int > position_in_node_set
holds for each node of G the index of its position in S_node
node get_random_node_common(int, int &)
Common updates for each get_random_node method.
bool is_deleted(node v)
Returns true if and only if v is deleted from S_node.
bool empty_node_set()
Returns whether S_node is empty or not.
node get_random_node_with_some_star_mass(int rand_tries, Comp comp=Comp())
Helper function for get_random_node methods with lowest or highest star mass.
void init_node_set(Graph &G)
Inits S_node[0,...,G.number_of_nodes()-1] and stores the i-th node of P at position S_node[i] and in ...
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.