Next: Cluster Graphs ( ClusterGraph Up: Graphs and Generators Previous: Node Hierarchies ( Hierarchy Contents Index

Clusters ( Cluster )

Baseclasses

$\begin{picture}(6.5,2.5) \thicklines \put(0,1.5){\framebox (5,1){\bf Cluster}} \end{picture}$

Definition

An instance C of type Cluster offers operations for the member nodes of C and its subclusters.

#include < AGD/Cluster.h >

Creation

Cluster C creates an empty cluster with no member nodes and no parent cluster.

Operations

Cluster* C.get_supercluster() returns the parent cluster of C.

void C.set_supercluster(Cluster* cl)

makes cl the parent cluster of C. Attention: this function does not add C to the children list of cl.

const leda_list<Cluster*>& C.get_subclusters() returns a list of subclusters of C.

void C.add_subcluster(Cluster* cl)

makes cl a subcluster of C.

void C.remove_subcluster(Cluster* cl)

removes cl from the list of subcluster of C. Attention: cl is unchanged.

const leda_list<leda_node>& C.get_nodes() returns a list of member nodes of C.

void C.add_node(leda_node v) makes node v a member of C.

bool C.remove_node(leda_node v)

removes node v from the list of member nodes.

void C.set_edge_order(leda_list<leda_edge> cl_edge_order)

sets the order of the cluster incident edges around C to the order of the edges in cl_edge_order.

const leda_list<leda_edge>& C.get_edge_order() returns a ordered list of cluster incident edges around cluster C.

Next: Cluster Graphs ( ClusterGraph Up: Graphs and Generators Previous: Node Hierarchies ( Hierarchy Contents Index

Cluster*	C.get_supercluster()	returns the parent cluster of C.
void	C.set_supercluster(Cluster* cl)
		makes cl the parent cluster of C. Attention: this function does not add C to the children list of cl.
const leda_list<Cluster*>&	C.get_subclusters()	returns a list of subclusters of C.
void	C.add_subcluster(Cluster* cl)
		makes cl a subcluster of C.
void	C.remove_subcluster(Cluster* cl)
		removes cl from the list of subcluster of C. Attention: cl is unchanged.
const leda_list<leda_node>&	C.get_nodes()	returns a list of member nodes of C.
void	C.add_node(leda_node v)	makes node v a member of C.
bool	C.remove_node(leda_node v)
		removes node v from the list of member nodes.
void	C.set_edge_order(leda_list<leda_edge> cl_edge_order)
		sets the order of the cluster incident edges around C to the order of the edges in cl_edge_order.
const leda_list<leda_edge>&	C.get_edge_order()	returns a ordered list of cluster incident edges around cluster C.