ANode Class Reference

---

Detailed Description

This class is just a helper class for ANodes, it is not suggested to use it directly. It can be converted easily to node and vice versa. The usage of this class is limited to use just as template parameters for special map types. #include <lemon/concepts/bpugraph.h>

Inheritance diagram for ANode:

[legend]

List of all members.

Public Member Functions
	ANode ()
	Default constructor.
	ANode (const ANode &)
	ANode (const Node &)
	Construct the same node as ANode.
ANode &	operator= (const Node &)
	Assign node to A-node.
	ANode (Invalid)
	Invalid constructor & conversion.
bool	operator== (ANode) const
	Equality operator.
bool	operator!= (ANode) const
	Inequality operator.
bool	operator< (ANode) const
	Artificial ordering operator.

---

Constructor & Destructor Documentation

ANode

(

)

[inline]

Warning:

The default constructor sets the iterator to an undefined value.

ANode

(

const ANode &

)

[inline]

Copy constructor.

ANode

(

const Node &

)

[inline]

Construct the same node as ANode. It may throws assertion when the given node is from the BNode set.

ANode

(

Invalid

)

[inline]

This constructor initializes the iterator to be invalid.

See also:

Invalid for more details.

---

Member Function Documentation

ANode& operator=

(

const Node &

)

[inline]

Besides the core graph item functionality each node should be convertible to the represented A-node if it is it possible.

bool operator==

(

ANode

)

const [inline]

Two iterators are equal if and only if they point to the same object or both are invalid.

bool operator!=

(

ANode

)

const [inline]

See also:

operator==(ANode n)

bool operator<

(

ANode

)

const [inline]

To allow the use of graph descriptors as key type in std::map or similar associative container we require this.

Note:

This operator only have to define some strict ordering of the items; this order has nothing to do with the iteration ordering of the items.