Graph Drawing Toolkit

An object-oriented C++ library for handling and drawing graphs

---

split_component Class Reference

#include <rm3_SPQR_tree.h>

Inheritance diagram for split_component:

[legend]

Collaboration diagram for split_component:

[legend]

List of all members.

Public Member Functions
	~split_component ()
	split_component (plan_undi_graph &pug)
split_component &	operator= (plan_undi_graph &)
void	local_get (plan_undi_graph *&, split_component_type &, gdt::gdtnode_map< bool > *&, gdt::gdtlist< separation_pair > *&, gdt::gdtnode_map< struct_split_node_info > *&, gdt::gdtedge_map< struct_split_edge_info > *&)
plan_undi_graph &	get_owner_graph () const
split_component_type	get_type () const
split_component_edge_type	get_type_of_edge (gdtedge e) const
split_component *	get_twin_edge_owner_split_component (gdtedge e) const
gdt::gdtlist < separation_pair >	get_separation_pairs () const
bool	get_node_is_present (gdtnode v) const
bool	contain_separation_pair (separation_pair sp) const
gdtnode	get_twin_node (gdtnode v) const
gdtedge	get_twin_edge (gdtedge e) const
gdtedge	edge_associated_to_owner_graph_edge (gdtedge e) const
void	clear ()
void	mirror (split_component &)
void	forget ()
bool	split_on_separation_pair (separation_pair sp, split_component *&sc1_pointer, int new_id=AUTO_ID)
bool	merge_with_polygon_on_edge (split_component *&sc1_pointer, gdtedge e)
gdt::gdtlist < split_component * >	decompose_into_triconnected_components ()
void	print (print_mode mode=BY_FACES, bool split_component_information=true, std::ostream &os=std::cout)
Protected Member Functions
	split_component ()
	split_component (const split_component &)
split_component &	operator= (const split_component &)
gdtnode	new_node (gdtedge, int new_id=AUTO_ID)
gdtedge	new_edge (gdtnode, gdtnode, face, int new_id=AUTO_ID)
void	del_node (gdtnode)
void	del_edge (gdtedge)
gdt::gdtlist < split_component * >	decomposition_in_triconnected_components ()
Friends
class	skeleton

---

Detailed Description

Definition at line 234 of file rm3_SPQR_tree.h.

---

Constructor & Destructor Documentation

split_component::split_component

(

)

[protected]

split_component::split_component

(

const split_component &

)

[protected]

split_component::~split_component

(

)

split_component::split_component

(

plan_undi_graph &

pug

)

---

Member Function Documentation

split_component& split_component::operator=

(

const split_component &

)

[protected]

gdtnode split_component::new_node	(	gdtedge	e,
		int	new_id = AUTO_ID
	)			[protected]

Split gdtedge with a new gdtnode with identifier new_id, and return such gdtnode.

Reimplemented from plan_undi_graph.

gdtedge split_component::new_edge	(	gdtnode	v1,
		gdtnode	v2,
		face	f,
		int	new_id = AUTO_ID
	)			[protected]

Insert a new undirected gdtedge with source v1 and terget v2, and id new_id, by splitting face f, and return it. PRECONDITIONS: both v1 and v2 belongs to f.

Reimplemented from plan_undi_graph.

void split_component::del_node

(

gdtnode

v

)

[protected]

Delete gdtnode and return the face obtained by recursively merging the faces of the deleted edges.

Reimplemented from plan_undi_graph.

void split_component::del_edge

(

gdtedge

e

)

[protected]

Delete gdtedge and return the face obtained by merging the two previous faces of the deleted gdtedge.

Reimplemented from plan_undi_graph.

gdt::gdtlist<split_component*> split_component::decomposition_in_triconnected_components

(

)

[protected]

split_component& split_component::operator=

(

plan_undi_graph &

)

void split_component::local_get	(	plan_undi_graph *&	,
		split_component_type &	,
		gdt::gdtnode_map< bool > *&	,
		gdt::gdtlist< separation_pair > *&	,
		gdt::gdtnode_map< struct_split_node_info > *&	,
		gdt::gdtedge_map< struct_split_edge_info > *&
	)

plan_undi_graph& split_component::get_owner_graph

(

)

const

split_component_type split_component::get_type

(

)

const

split_component_edge_type split_component::get_type_of_edge

(

gdtedge

e

)

const

split_component* split_component::get_twin_edge_owner_split_component

(

gdtedge

e

)

const

gdt::gdtlist<separation_pair> split_component::get_separation_pairs

(

)

const

bool split_component::get_node_is_present

(

gdtnode

v

)

const

bool split_component::contain_separation_pair

(

separation_pair

sp

)

const

gdtnode split_component::get_twin_node

(

gdtnode

v

)

const

gdtedge split_component::get_twin_edge

(

gdtedge

e

)

const

gdtedge split_component::edge_associated_to_owner_graph_edge

(

gdtedge

e

)

const

void split_component::clear

(

)

Delete all nodes and edges.

Reimplemented from plan_undi_graph.

Reimplemented in skeleton.

void split_component::mirror

(

split_component &

)

void split_component::forget

(

)

Cut all private variables in *this.

Reimplemented from plan_undi_graph.

bool split_component::split_on_separation_pair	(	separation_pair	sp,
		split_component *&	sc1_pointer,
		int	new_id = AUTO_ID
	)

bool split_component::merge_with_polygon_on_edge	(	split_component *&	sc1_pointer,
		gdtedge	e
	)

gdt::gdtlist<split_component*> split_component::decompose_into_triconnected_components

(

)

void split_component::print	(	print_mode	mode = BY_FACES,
		bool	split_component_information = true,
		std::ostream &	os = std::cout
	)

Reimplemented in skeleton.

---

Friends And Related Function Documentation

friend class skeleton [friend]

Definition at line 237 of file rm3_SPQR_tree.h.

---

The documentation for this class was generated from the following file:

• rm3_SPQR_tree.h

---