Next: Leveled Graphs ( LeveledGraph Up: Graphs and Generators Previous: Plane Graph Copies ( Contents Index

Plane Cluster Graph Copies ( PlaneClusterGraphCopy )

Baseclasses

$\begin{picture}(8,5.5) \thicklines \put(0,4.5){\framebox (5,1){\bf graph}}\... ...1){1}}\put(1.5,0){\framebox (8.0,1){\bf PlaneClusterGraphCopy}} \end{picture}$

Definition

An instanz PCG of PlaneClusterGraphCopy represents a copy of a planar clustergraph.

#include < AGD/PlaneClusterGraphCopy.h >

Creation

PlaneClusterGraphCopy PCG(const PlaneClusterGraphCopy& pcg)

creates an instance PCG of type PlaneClusterGraphCopy initialized to a copy of pcg.

PlaneClusterGraphCopy PCG(const ClusterGraph& CG)

creates an instance PCG of type PlaneClusterGraphCopy initialized to a copy of CG.

PlaneClusterGraphCopy PCG(const ClusterGraph& CG, leda_list<leda_edge>& E)

creates an instance PCG of type PlaneClusterGraphCopy initialized to a copy of CG without the edges in E. Precondition: Each e $\in$ E is an edge in CG.

Operations

Cluster* PCG.new_cluster(void) creates a new cluster as a child of the root-cluster and returns it.

Cluster* PCG.new_cluster(Cluster* cl)

creates a new cluster as a child of cluster cl and returns it.

leda_node PCG.new_node(Cluster* cl) creates a new node and makes it a member of cluster cl.

Cluster* PCG.get_rootcluster(void) returns the root-cluster.

Cluster* PCG.cluster_of(leda_node v)

returns the cluster node v belongs too.

Cluster* PCG.original(Cluster* cl) returns the corresponding cluster for cl in the original clustergraph.

const ClusterGraph& PCG.original() returns the underlying clustergraph.

leda_list<Cluster*> PCG.all_clusters() returns a list of all cluster.

leda_list<Cluster*> PCG.all_subcluster(Cluster* cl)

returns a list of all subcluster of T(c).

bool PCG.is_member(Cluster* cl, leda_node v)

returns true if node v is a member of a subcluster of cl, otherwise false.

Cluster* PCG.copy(Cluster* cl) returns the copy of cluster cl. Precondition is that cl is a cluster in the original graph.

Next: Leveled Graphs ( LeveledGraph Up: Graphs and Generators Previous: Plane Graph Copies ( Contents Index

PlaneClusterGraphCopy	PCG(const PlaneClusterGraphCopy& pcg)
		creates an instance PCG of type PlaneClusterGraphCopy initialized to a copy of pcg.
PlaneClusterGraphCopy	PCG(const ClusterGraph& CG)
		creates an instance PCG of type PlaneClusterGraphCopy initialized to a copy of CG.
PlaneClusterGraphCopy	PCG(const ClusterGraph& CG, leda_list<leda_edge>& E)
		creates an instance PCG of type PlaneClusterGraphCopy initialized to a copy of CG without the edges in E. Precondition: Each e $\in$ E is an edge in CG.

Cluster*	PCG.new_cluster(void)	creates a new cluster as a child of the root-cluster and returns it.
Cluster*	PCG.new_cluster(Cluster* cl)
		creates a new cluster as a child of cluster cl and returns it.
leda_node	PCG.new_node(Cluster* cl)	creates a new node and makes it a member of cluster cl.
Cluster*	PCG.get_rootcluster(void)	returns the root-cluster.
Cluster*	PCG.cluster_of(leda_node v)
		returns the cluster node v belongs too.
Cluster*	PCG.original(Cluster* cl)	returns the corresponding cluster for cl in the original clustergraph.
const ClusterGraph&	PCG.original()	returns the underlying clustergraph.
leda_list<Cluster*>	PCG.all_clusters()	returns a list of all cluster.
leda_list<Cluster*>	PCG.all_subcluster(Cluster* cl)
		returns a list of all subcluster of T(c).
bool	PCG.is_member(Cluster* cl, leda_node v)
		returns true if node v is a member of a subcluster of cl, otherwise false.
Cluster*	PCG.copy(Cluster* cl)	returns the copy of cluster cl. Precondition is that cl is a cluster in the original graph.