UEdge Class Reference

---

Detailed Description

This class represents the undirected edges of the graph. The undirected graphs can be used as a directed graph which for each edge contains the opposite edge too so the graph is bidirected. The undirected edge represents two opposite directed edges. #include <lemon/concepts/graph_components.h>

Inheritance diagram for UEdge:

[legend]

List of all members.

Public Member Functions
	UEdge ()
	Default constructor.
	UEdge (const UEdge &)
	UEdge (Invalid)
	Invalid constructor & conversion.
	UEdge (const Edge &)
	Converter from edge to undirected edge.
UEdge &	operator= (const Edge &)
	Assign edge to undirected edge.

---

Constructor & Destructor Documentation

UEdge

(

)

[inline]

Warning:

The default constructor is not required to set the item to some well-defined value. So you should consider it as uninitialized.

UEdge

(

const UEdge &

)

[inline]

Copy constructor.

UEdge

(

Invalid

)

[inline]

This constructor initializes the item to be invalid.

See also:

Invalid for more details.

UEdge

(

const Edge &

)

[inline]

Besides the core graph item functionality each edge should be convertible to the represented undirected edge.

---

Member Function Documentation

UEdge& operator=

(

const Edge &

)

[inline]

Besides the core graph item functionality each edge should be convertible to the represented undirected edge.

Reimplemented from GraphItem<'u'>.