PlanarGraphEdge Struct Reference

Defines non-labelled edge of the directed planar graph. More...

#include <GraphType.h>

Inheritance diagram for PlanarGraphEdge:
GraphEdge PlanarGraphIntLabelledEdge

List of all members.

Public Member Functions

 PlanarGraphEdge (int target, int cell1=-1, int cell2=-1)
 Constructor for an edge. Argument t is a number of the target.
 PlanarGraphEdge ()
 Dummy constructor, not to be used, required for STL::map. Also, can be used to denote "failure" or "dead-end" edge.
PlanarGraphEdge inverse (int origin)
 Invert an edge.
bool operator< (const PlanarGraphEdge &e) const
 Check if one edge is less than the other.
bool operator== (const PlanarGraphEdge &e) const
 Check if two edges equal.
bool operator!= (const PlanarGraphEdge &e) const
 Check if two edges are not equal.

Public Attributes

int theCell1
 The left neighbor-cell of the edge. Numbering of cells starts from 0, -1 denotes the outer face.
int theCell2
 The right neighbor-cell of the edge. Numbering of cells starts from 0, -1 denotes the outer face.

Detailed Description

Defines non-labelled edge of the directed planar graph.

Definition at line 150 of file GraphType.h.


Constructor & Destructor Documentation

PlanarGraphEdge::PlanarGraphEdge ( int  target,
int  cell1 = -1,
int  cell2 = -1 
) [inline]

Constructor for an edge. Argument t is a number of the target.

Definition at line 154 of file GraphType.h.

PlanarGraphEdge::PlanarGraphEdge (  )  [inline]

Dummy constructor, not to be used, required for STL::map. Also, can be used to denote "failure" or "dead-end" edge.

Definition at line 158 of file GraphType.h.

Referenced by inverse().


Member Function Documentation

PlanarGraphEdge PlanarGraphEdge::inverse ( int  origin  )  [inline]

Invert an edge.

Reimplemented from GraphEdge.

Reimplemented in PlanarGraphIntLabelledEdge.

Definition at line 162 of file GraphType.h.

References PlanarGraphEdge(), theCell1, and theCell2.

bool PlanarGraphEdge::operator!= ( const PlanarGraphEdge e  )  const [inline]

Check if two edges are not equal.

Reimplemented from GraphEdge.

Reimplemented in PlanarGraphIntLabelledEdge.

Definition at line 180 of file GraphType.h.

References theCell1, theCell2, and GraphEdge::theTarget.

bool PlanarGraphEdge::operator< ( const PlanarGraphEdge e  )  const [inline]

Check if one edge is less than the other.

Reimplemented from GraphEdge.

Reimplemented in PlanarGraphIntLabelledEdge.

Definition at line 166 of file GraphType.h.

References theCell1, theCell2, and GraphEdge::theTarget.

bool PlanarGraphEdge::operator== ( const PlanarGraphEdge e  )  const [inline]

Check if two edges equal.

Reimplemented from GraphEdge.

Reimplemented in PlanarGraphIntLabelledEdge.

Definition at line 176 of file GraphType.h.

References theCell1, theCell2, and GraphEdge::theTarget.


Member Data Documentation

The left neighbor-cell of the edge. Numbering of cells starts from 0, -1 denotes the outer face.

Definition at line 184 of file GraphType.h.

Referenced by PlanarGraphIntLabelledEdge::inverse(), inverse(), PlanarGraphIntLabelledEdge::operator!=(), operator!=(), PlanarGraphIntLabelledEdge::operator<(), operator<(), PlanarGraphIntLabelledEdge::operator==(), and operator==().

The right neighbor-cell of the edge. Numbering of cells starts from 0, -1 denotes the outer face.

Definition at line 188 of file GraphType.h.

Referenced by PlanarGraphIntLabelledEdge::inverse(), inverse(), PlanarGraphIntLabelledEdge::operator!=(), operator!=(), PlanarGraphIntLabelledEdge::operator<(), operator<(), PlanarGraphIntLabelledEdge::operator==(), and operator==().


The documentation for this struct was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines

Generated on Mon Sep 26 18:43:49 2011 for CRyptography And Groups (CRAG) by  doxygen 1.6.1