chomp::homology::diGraph< wType >::edgeTriple Struct Reference

An edge with a weight (used by the Edmonds algorithm). More...

Public Attributes
int_t	vert1
	The starting and ending vertices of the edge. More...
int_t	vert2
wType	weight
	The weight of the edge. More...

Friends
bool	operator< (const edgeTriple &x, const edgeTriple &y)
	The < operator for comparing the weights of edges. More...

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 495 of file digraph.h.

Friends And Related Function Documentation

operator<

template<class wType = int>

bool operator< ( const edgeTriple &  x, const edgeTriple &  y  )

friend

The < operator for comparing the weights of edges.

Definition at line 505 of file digraph.h.

                {
                        return (x. weight < y. weight);
                }

Member Data Documentation

vert1

template<class wType = int>

int_t chomp::homology::diGraph< wType >::edgeTriple::vert1

The starting and ending vertices of the edge.

Definition at line 498 of file digraph.h.

vert2

template<class wType = int>

int_t chomp::homology::diGraph< wType >::edgeTriple::vert2

Definition at line 499 of file digraph.h.

weight

template<class wType = int>

wType chomp::homology::diGraph< wType >::edgeTriple::weight

The weight of the edge.

Definition at line 502 of file digraph.h.

---

The documentation for this struct was generated from the following file:

• chomp/struct/digraph.h