Class Graph::EdgeWeightIterator¶

Nested Relationships¶

This class is a nested type of Class Graph.

Inheritance Relationships¶

Class Documentation¶

class EdgeWeightIterator : public NetworKit::Graph::EdgeIteratorBase

Class to iterate over the edges of the graph and their weights. If the graph is undirected, operator*() returns a WeightedEdge struct with u <= v.

Public Types

using value_type = WeightedEdge

using reference = value_type&

using pointer = value_type*

using iterator_category = std::forward_iterator_tag

using difference_type = ptrdiff_t

using self = EdgeWeightIterator

Public Functions

inline EdgeWeightIterator(const Graph *G, NodeIterator nodeIter)

inline EdgeWeightIterator()

WARNING: This constructor is required for Python and should not be used as the iterator is not initialized.

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

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

inline EdgeWeightIterator &operator++()

inline EdgeWeightIterator operator++(int)

inline EdgeWeightIterator operator--()

inline EdgeWeightIterator operator--(int)

inline WeightedEdge operator*() const noexcept