A pair of distinct graph elements, ordered by their index. More...
#include <ogdf/k-planarity/1-planarity_backtracking/EdgePairPartition.h>
Public Member Functions | |
| OrderedPair (GraphElementPointer a, GraphElementPointer b) | |
Creates a new pair that consists of a and b. | |
| bool | contains (GraphElementPointer el) const |
Returns whether el is contained in the pair. | |
| GraphElementPointer | first () const |
| Returns the element with smaller index. | |
| const Graph * | graphOf () const |
| bool | operator!= (const OrderedPair &rhs) const |
| bool | operator< (const OrderedPair &rhs) const |
| bool | operator== (const OrderedPair &rhs) const |
| GraphElementPointer | second () const |
| Returns the element with larger index. | |
Private Attributes | |
| GraphElementPointer | m_first |
| GraphElementPointer | m_second |
A pair of distinct graph elements, ordered by their index.
Definition at line 49 of file EdgePairPartition.h.
|
inline |
Creates a new pair that consists of a and b.
Definition at line 55 of file EdgePairPartition.h.
|
inline |
Returns whether el is contained in the pair.
Definition at line 75 of file EdgePairPartition.h.
|
inline |
Returns the element with smaller index.
Definition at line 69 of file EdgePairPartition.h.
|
inline |
Definition at line 98 of file EdgePairPartition.h.
|
inline |
Definition at line 85 of file EdgePairPartition.h.
|
inline |
Definition at line 87 of file EdgePairPartition.h.
|
inline |
Definition at line 77 of file EdgePairPartition.h.
|
inline |
Returns the element with larger index.
Definition at line 72 of file EdgePairPartition.h.
|
private |
Definition at line 51 of file EdgePairPartition.h.
|
private |
Definition at line 51 of file EdgePairPartition.h.