ogdf_iterator.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph_d.h>
 
namespace ogdf {
namespace internal {
namespace gcm {
namespace graph {
 
template<typename _Entry>
class OGDFEntryIterator {
public:
    using Entry = _Entry;
    using Iterator = OGDFEntryIterator<Entry>;
 
protected:
    Entry m_cur;
 
public:
    OGDFEntryIterator(Entry _cur) : m_cur(_cur) {
        //nothing to do
    }
 
    Iterator& operator--() {
        m_cur = m_cur->pred();
        return *this;
    }
 
    Iterator& operator++() {
        m_cur = m_cur->succ();
        return *this;
    }
 
    bool operator==(const Iterator& b) const { return m_cur == b.m_cur; }
 
    bool operator!=(const Iterator& b) const { return m_cur != b.m_cur; }
};
 
template<typename Entry>
class EntryIterator : public OGDFEntryIterator<Entry> {
private:
    using parent = OGDFEntryIterator<Entry>;
 
public:
    using T = Entry;
    using parent::parent;
 
    Entry operator*() { return this->m_cur; }
};
 
class IncidentEdgeIterator : public OGDFEntryIterator<adjEntry> {
private:
    using parent = OGDFEntryIterator<adjEntry>;
 
public:
    using T = edge;
    using parent::parent;
 
    edge operator*() { return this->m_cur->theEdge(); }
};
 
/* Iterate over adjacent nodes
 */
class AdjacentNodeIterator : public OGDFEntryIterator<adjEntry> {
private:
    using parent = OGDFEntryIterator<adjEntry>;
 
public:
    using T = node;
    using parent::parent;
 
    node operator*() { return this->m_cur->twin()->theNode(); }
};
 
using AdjEntryIterator = EntryIterator<adjEntry>;
using NodeIterator = EntryIterator<node>;
using EdgeIterator = EntryIterator<edge>;
 
 
}
}
}
}