Class Graph::NeighborWeightIterator¶

Nested Relationships¶

This class is a nested type of Class Graph.

Class Documentation¶

class NeighborWeightIterator

Class to iterate over the in/out neighbors of a node including the edge weights. Values are std::pair<node, edgeweight>.

Public Types

using value_type = std::pair<node, edgeweight>

using reference = value_type&

using pointer = value_type*

using iterator_category = std::forward_iterator_tag

using difference_type = ptrdiff_t

using self = NeighborWeightIterator

Public Functions

inline NeighborWeightIterator(std::vector<node>::const_iterator nodesIter, std::vector<edgeweight>::const_iterator weightIter)

inline NeighborWeightIterator()

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

inline NeighborWeightIterator &operator++()

inline NeighborWeightIterator operator++(int)

inline NeighborWeightIterator operator--()

inline NeighborWeightIterator operator--(int)

inline bool operator==(const NeighborWeightIterator &rhs) const

inline bool operator!=(const NeighborWeightIterator &rhs) const

inline std::pair<node, edgeweight> operator*() const