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

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

---

Friends And Related Function Documentation

template<class wType = int>

bool operator<	(	const edgeTriple &	x,
		const edgeTriple &	y
	)			[friend]

The < operator for comparing the weights of edges.

Definition at line 489 of file digraph.h.

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

---

Member Data Documentation

template<class wType = int>

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

The starting and ending vertices of the edge.

Definition at line 482 of file digraph.h.

template<class wType = int>

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

Definition at line 483 of file digraph.h.

template<class wType = int>

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

The weight of the edge.

Definition at line 486 of file digraph.h.

---

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

• chomp/struct/digraph.h