Class Graph::EdgeIterator¶

Nested Relationships¶

This class is a nested type of Class Graph.

Inheritance Relationships¶

Class Documentation¶

class EdgeIterator : public NetworKit::Graph::EdgeIteratorBase

Class to iterate over the edges of the graph. If the graph is undirected, operator*() returns the edges (u, v) s.t. u <= v.

Public Types

using value_type = Edge

using reference = value_type&

using pointer = value_type*

using iterator_category = std::forward_iterator_tag

using difference_type = ptrdiff_t

using self = EdgeIterator

Public Functions

inline EdgeIterator(const Graph *G, NodeIterator nodeIter)

inline EdgeIterator()

inline bool operator==(const EdgeIterator &rhs) const noexcept

inline bool operator!=(const EdgeIterator &rhs) const noexcept

inline Edge operator*() const noexcept

inline EdgeIterator &operator++()

inline EdgeIterator operator++(int)

inline EdgeIterator operator--()

inline EdgeIterator operator--(int)