An edge with a weight (used by the Edmonds algorithm).
More...
List of all members.
Public Attributes |
| int_t | vert1 |
| | The starting and ending vertices of the edge.
|
| int_t | vert2 |
| wType | weight |
| | The weight of the edge.
|
Friends |
| bool | operator< (const edgeTriple &x, const edgeTriple &y) |
| | The < operator for comparing the weights of edges.
|
Detailed Description
template<class wType = int>
struct chomp::homology::diGraph< wType >::edgeTriple
An edge with a weight (used by the Edmonds algorithm).
Definition at line 480 of file digraph.h.
Friends And Related Function Documentation
template<class wType = int>
The < operator for comparing the weights of edges.
Definition at line 490 of file digraph.h.
Member Data Documentation
template<class wType = int>
The starting and ending vertices of the edge.
Definition at line 483 of file digraph.h.
template<class wType = int>
template<class wType = int>
The weight of the edge.
Definition at line 487 of file digraph.h.
The documentation for this struct was generated from the following file:
