|
libDAI
|
Represents a directed edge. More...
#include <dai/weightedgraph.h>
Public Member Functions | |
| DEdge () | |
| Default constructor. | |
| DEdge (size_t m1, size_t m2) | |
| Constructs a directed edge pointing from m1 to m2. | |
| bool | operator== (const DEdge &x) const |
| Tests for equality. | |
| bool | operator< (const DEdge &x) const |
| Smaller-than operator (performs lexicographical comparison) | |
Public Attributes | |
| size_t | first |
| First node index (source of edge) | |
| size_t | second |
| Second node index (target of edge) | |
Friends | |
| std::ostream & | operator<< (std::ostream &os, const DEdge &e) |
| Writes a directed edge to an output stream. | |
Represents a directed edge.
| dai::DEdge::DEdge | ( | ) | [inline] |
Default constructor.
| dai::DEdge::DEdge | ( | size_t | m1, |
| size_t | m2 | ||
| ) | [inline] |
Constructs a directed edge pointing from m1 to m2.
| bool dai::DEdge::operator== | ( | const DEdge & | x | ) | const [inline] |
Tests for equality.
| bool dai::DEdge::operator< | ( | const DEdge & | x | ) | const [inline] |
Smaller-than operator (performs lexicographical comparison)
| std::ostream& operator<< | ( | std::ostream & | os, |
| const DEdge & | e | ||
| ) | [friend] |
Writes a directed edge to an output stream.
| size_t dai::DEdge::first |
First node index (source of edge)
| size_t dai::DEdge::second |
Second node index (target of edge)
1.7.4