#include <GraphType.h>
Inheritance diagram for IntLabeledEdge:
Public Member Functions | |
IntLabeledEdge (int target, int label) | |
Constructor for an edge. Argument t is a number of the target. | |
IntLabeledEdge () | |
Dummy constructor, not to be used, required for STL::map. Also, can be used to denote "failure" or "dead-end" edge. | |
IntLabeledEdge | inverse (int origin) |
Invert an edge. | |
bool | operator< (const IntLabeledEdge &e) const |
Check if one edge is less than the other. | |
bool | operator== (const IntLabeledEdge &e) const |
Check if two edges equal. | |
bool | operator!= (const IntLabeledEdge &e) const |
Check if two edges are not equal. | |
Public Attributes | |
int | theLabel |
The label of the edge. |
Definition at line 101 of file GraphType.h.
|
Constructor for an edge. Argument t is a number of the target.
Definition at line 104 of file GraphType.h. |
|
Dummy constructor, not to be used, required for STL::map. Also, can be used to denote "failure" or "dead-end" edge.
Definition at line 107 of file GraphType.h. Referenced by inverse(). |
|
Invert an edge.
Reimplemented from GraphEdge. Definition at line 111 of file GraphType.h. References IntLabeledEdge(), and theLabel. |
|
Check if two edges are not equal.
Definition at line 126 of file GraphType.h. References GraphEdge::operator!=(), and theLabel. |
|
Check if one edge is less than the other.
Definition at line 114 of file GraphType.h. References theLabel, and GraphEdge::theTarget. |
|
Check if two edges equal.
Definition at line 122 of file GraphType.h. References GraphEdge::operator==(), and theLabel. |
|
The label of the edge.
Definition at line 130 of file GraphType.h. Referenced by inverse(), operator!=(), operator<(), and operator==(). |