GraphEdge Struct Reference
Defines non-labelled edge of the directed graph. More...
#include <GraphRep.h>
Public Member Functions | |
| GraphEdge () | |
| GraphEdge (int t) | |
| bool | operator< (const GraphEdge &e) const |
| bool | operator== (const GraphEdge &e) const |
| GraphEdge (int t) | |
| Constructor for an edge. Argument t is a number of the target. | |
| GraphEdge () | |
| Dummy constructor, not to be used, required for STL::map. Also, can be used to denote "failure" or "dead-end" edge. | |
| GraphEdge | inverse (int origin) |
| Invert an edge. | |
| bool | operator< (const GraphEdge &e) const |
| Check if one edge is less than the other. | |
| bool | operator== (const GraphEdge &e) const |
| Check if two edges equal. | |
| bool | operator!= (const GraphEdge &e) const |
| Check if two edges are not equal. | |
Public Attributes | |
| int | target |
| int | theTarget |
| The target of the edge (for out edges), or origin of the vertex (for in edges). | |
Detailed Description
Defines non-labelled edge of the directed graph.The order on edges must be defined so that the edges with the least labels go first for folding to be correct.
Definition at line 26 of file GraphRep.h.
Constructor & Destructor Documentation
| GraphEdge::GraphEdge | ( | ) | [inline] |
| GraphEdge::GraphEdge | ( | int | t | ) | [inline] |
Definition at line 32 of file GraphRep.h.
| GraphEdge::GraphEdge | ( | int | t | ) | [inline] |
Constructor for an edge. Argument t is a number of the target.
Definition at line 41 of file GraphType.h.
| GraphEdge::GraphEdge | ( | ) | [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 44 of file GraphType.h.
Member Function Documentation
| bool GraphEdge::operator< | ( | const GraphEdge & | e | ) | const [inline] |
| bool GraphEdge::operator== | ( | const GraphEdge & | e | ) | const [inline] |
Definition at line 35 of file GraphRep.h.
References target.
Referenced by IntLabeledEdge::operator==().
| GraphEdge GraphEdge::inverse | ( | int | origin | ) | [inline] |
Invert an edge.
Reimplemented in IntLabeledEdge, PlanarGraphEdge, and PlanarGraphIntLabelledEdge.
Definition at line 49 of file GraphType.h.
References GraphEdge().
| bool GraphEdge::operator< | ( | const GraphEdge & | e | ) | const [inline] |
Check if one edge is less than the other.
Definition at line 53 of file GraphType.h.
References theTarget.
| bool GraphEdge::operator== | ( | const GraphEdge & | e | ) | const [inline] |
| bool GraphEdge::operator!= | ( | const GraphEdge & | e | ) | const [inline] |
Check if two edges are not equal.
Definition at line 61 of file GraphType.h.
References theTarget.
Referenced by IntLabeledEdge::operator!=().
Member Data Documentation
The target of the edge (for out edges), or origin of the vertex (for in edges).
Definition at line 65 of file GraphType.h.
Referenced by Graphs::GraphConceptRep< GraphVertex< IntLabeledEdge >, IntLabeledEdge >::_newVertex(), Graphs::GraphConceptRep< GraphVertex< IntLabeledEdge >, IntLabeledEdge >::eraseVertex(), Graphs::GraphConceptRep< GraphVertex< IntLabeledEdge >, IntLabeledEdge >::newEdge(), PlanarGraphIntLabelledEdge::operator!=(), PlanarGraphEdge::operator!=(), operator!=(), PlanarGraphIntLabelledEdge::operator<(), PlanarGraphEdge::operator<(), IntLabeledEdge::operator<(), operator<(), PlanarGraphIntLabelledEdge::operator==(), PlanarGraphEdge::operator==(), operator==(), and Graphs::GraphConceptRep< GraphVertex< IntLabeledEdge >, IntLabeledEdge >::pinch().
The documentation for this struct was generated from the following files:
- Graph/include/GraphRep.h
- Graph/include/GraphType.h
