#include <dai/weightedgraph.h>
Public Member Functions | |
UEdge () | |
Default constructor. | |
UEdge (size_t m1, size_t m2) | |
Constructs an undirected edge between m1 and m2. | |
UEdge (const DEdge &e) | |
Construct from DEdge. | |
bool | operator== (const UEdge &x) |
Tests for inequality (disregarding the ordering of the nodes). | |
bool | operator< (const UEdge &x) const |
Smaller-than operator. | |
Public Attributes | |
size_t | first |
First node index. | |
size_t | second |
Second node index. | |
Friends | |
std::ostream & | operator<< (std::ostream &os, const UEdge &e) |
Writes an undirected edge to an output stream. |
dai::UEdge::UEdge | ( | ) | [inline] |
Default constructor.
dai::UEdge::UEdge | ( | size_t | m1, | |
size_t | m2 | |||
) | [inline] |
Constructs an undirected edge between m1 and m2.
bool dai::UEdge::operator== | ( | const UEdge & | x | ) | [inline] |
Tests for inequality (disregarding the ordering of the nodes).
bool dai::UEdge::operator< | ( | const UEdge & | x | ) | const [inline] |
Smaller-than operator.
std::ostream& operator<< | ( | std::ostream & | os, | |
const UEdge & | e | |||
) | [friend] |
Writes an undirected edge to an output stream.
size_t dai::UEdge::first |
First node index.
size_t dai::UEdge::second |
Second node index.