Graph Drawing Toolkit

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

---

struct_border_step Class Reference

#include <rm3_plan_undi_graph.h>

Collaboration diagram for struct_border_step:

[legend]

List of all members.

Public Member Functions
	struct_border_step ()
	~struct_border_step ()
Static Public Attributes
static int	counter
Friends
class	struct_face
class	plan_undi_graph

---

Detailed Description

GLOBALTYPE struct_border_step Local-plan_undi structure for border_step. In this context, a border_step represents an gdtedge with an associated moving direction. Namely, each gdtedge e=(v1,v2) has associated exactly two border_steps: 'bs1' moving from v1 and 'bs2' moving from v2. Nodes v1 and v2 are called 'start' ('stop') of border_steps bs1(bs2) and bs2(bs1), respectively (don't confuse with the start and stop nodes of directed edges). bs1(bs2) is said to be the the 'opposite' border_step of bs2(bs1). Also, the right face that we see moving along gdtedge e from gdtnode v1(v2) will be called the 'face of border_step bs1 (bs2)'. Finally, gdtedge e is called 'gdtedge of border steps bs1 and bs2'.

Definition at line 154 of file rm3_plan_undi_graph.h.

---

Constructor & Destructor Documentation

struct_border_step::struct_border_step

(

)

struct_border_step::~struct_border_step

(

)

---

Friends And Related Function Documentation

friend class struct_face [friend]

Definition at line 157 of file rm3_plan_undi_graph.h.

friend class plan_undi_graph [friend]

Definition at line 158 of file rm3_plan_undi_graph.h.

---

Member Data Documentation

int struct_border_step::counter [static]

Definition at line 169 of file rm3_plan_undi_graph.h.

---

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

• rm3_plan_undi_graph.h

---