Graph Drawing Toolkit

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

---

struct_constraint_uncrossable_edge Class Reference

#include <rm3_constraints.h>

Inheritance diagram for struct_constraint_uncrossable_edge:

[legend]

Collaboration diagram for struct_constraint_uncrossable_edge:

[legend]

List of all members.

Public Member Functions
	~struct_constraint_uncrossable_edge ()
gdtedge	get_uncrossable_edge () const
constraint	copy (undi_graph &)
void	print (std::ostream &os=std::cout) const
Protected Member Functions
bool	update_after_del_edge (gdtedge e)
bool	update_after_del_node (gdtnode v)
bool	update_after_split_edge (gdtedge e, gdtedge e1, gdtedge e2)
bool	update_after_split_node (gdtnode v, gdtnode v1, gdtnode v2)
bool	update_after_merge_edges (gdtedge e1, gdtedge e2, gdtedge e)
bool	update_after_merge_nodes (gdtnode v1, gdtnode v2, gdtnode v)
void	update_after_edge_translation (gdtedge e, gdtnode ve1, gdtnode ve2, gdtedge d, gdtnode vd1, gdtnode vd2)
void	update_on_path_replacing_edge (gdtedge e, gdt::gdtlist< gdtedge > path, undi_graph &ug)
Friends
class	undi_graph

---

Detailed Description

Definition at line 244 of file rm3_constraints.h.

---

Constructor & Destructor Documentation

struct_constraint_uncrossable_edge::~struct_constraint_uncrossable_edge

(

)

---

Member Function Documentation

bool struct_constraint_uncrossable_edge::update_after_del_edge

(

gdtedge

e

)

[protected, virtual]

Implements struct_constraint.

bool struct_constraint_uncrossable_edge::update_after_del_node

(

gdtnode

v

)

[protected, virtual]

Implements struct_constraint.

bool struct_constraint_uncrossable_edge::update_after_split_edge	(	gdtedge	e,
		gdtedge	e1,
		gdtedge	e2
	)			[protected, virtual]

Implements struct_constraint.

bool struct_constraint_uncrossable_edge::update_after_split_node	(	gdtnode	v,
		gdtnode	v1,
		gdtnode	v2
	)			[protected, virtual]

Implements struct_constraint.

bool struct_constraint_uncrossable_edge::update_after_merge_edges	(	gdtedge	e1,
		gdtedge	e2,
		gdtedge	e
	)			[protected, virtual]

Implements struct_constraint.

bool struct_constraint_uncrossable_edge::update_after_merge_nodes	(	gdtnode	v1,
		gdtnode	v2,
		gdtnode	v
	)			[protected, virtual]

Implements struct_constraint.

void struct_constraint_uncrossable_edge::update_after_edge_translation	(	gdtedge	e,
		gdtnode	ve1,
		gdtnode	ve2,
		gdtedge	d,
		gdtnode	vd1,
		gdtnode	vd2
	)			[protected, virtual]

Implements struct_constraint.

void struct_constraint_uncrossable_edge::update_on_path_replacing_edge	(	gdtedge	e,
		gdt::gdtlist< gdtedge >	path,
		undi_graph &	ug
	)			[protected, virtual]

Implements struct_constraint.

gdtedge struct_constraint_uncrossable_edge::get_uncrossable_edge

(

)

const

constraint struct_constraint_uncrossable_edge::copy

(

undi_graph &

)

[virtual]

Implements struct_constraint.

void struct_constraint_uncrossable_edge::print

(

std::ostream &

os = std::cout

)

const [virtual]

Implements struct_constraint.

---

Friends And Related Function Documentation

friend class undi_graph [friend]

Reimplemented from struct_constraint.

Definition at line 248 of file rm3_constraints.h.

---

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

• rm3_constraints.h

---