PlanarGraphIntLabelledEdge Struct Reference

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

#include <GraphType.h>

Inheritance diagram for PlanarGraphIntLabelledEdge:
PlanarGraphEdge IntLabeledEdge GraphEdge GraphEdge

List of all members.

Public Member Functions

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

Detailed Description

Defines non-labelled edge of the directed planar graph.

Definition at line 198 of file GraphType.h.


Constructor & Destructor Documentation

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

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

Definition at line 202 of file GraphType.h.

PlanarGraphIntLabelledEdge::PlanarGraphIntLabelledEdge (  )  [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 206 of file GraphType.h.

Referenced by inverse().


Member Function Documentation

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

Invert an edge.

Reimplemented from IntLabeledEdge.

Definition at line 210 of file GraphType.h.

References PlanarGraphIntLabelledEdge(), PlanarGraphEdge::theCell1, PlanarGraphEdge::theCell2, and IntLabeledEdge::theLabel.

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

Check if two edges are not equal.

Reimplemented from IntLabeledEdge.

Definition at line 230 of file GraphType.h.

References PlanarGraphEdge::theCell1, PlanarGraphEdge::theCell2, IntLabeledEdge::theLabel, and GraphEdge::theTarget.

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

Check if one edge is less than the other.

Reimplemented from IntLabeledEdge.

Definition at line 214 of file GraphType.h.

References PlanarGraphEdge::theCell1, PlanarGraphEdge::theCell2, IntLabeledEdge::theLabel, and GraphEdge::theTarget.

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

Check if two edges equal.

Reimplemented from IntLabeledEdge.

Definition at line 226 of file GraphType.h.

References PlanarGraphEdge::theCell1, PlanarGraphEdge::theCell2, IntLabeledEdge::theLabel, and GraphEdge::theTarget.


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