GraphSets.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphList.h> // IWYU pragma: keep
#include <ogdf/basic/RegisteredSet.h>
#include <ogdf/basic/basic.h>
 
#include <iterator>
#include <utility>
 
namespace ogdf {
 
 
template<bool SupportFastSizeQuery = true>
class NodeSet : public RegisteredSet<internal::GraphNodeRegistry, SupportFastSizeQuery> {
    using RS = RegisteredSet<internal::GraphNodeRegistry, SupportFastSizeQuery>;
 
public:
    using RS::RS;
 
    explicit NodeSet(const Graph& graph) : RS((const internal::GraphNodeRegistry&)graph) {};
 
    explicit NodeSet() = default;
 
    const typename RS::list_type& nodes() { return RS::elements(); }
 
    const Graph& graphOf() const {
        OGDF_ASSERT(RS::registeredAt());
        return *RS::registeredAt();
    }
};
 
 
template<bool SupportFastSizeQuery = true>
class EdgeSet : public RegisteredSet<internal::GraphEdgeRegistry, SupportFastSizeQuery> {
    using RS = RegisteredSet<internal::GraphEdgeRegistry, SupportFastSizeQuery>;
 
public:
    using RS::RS;
 
    explicit EdgeSet(const Graph& graph) : RS((const internal::GraphEdgeRegistry&)graph) {};
 
    explicit EdgeSet() = default;
 
    const typename RS::list_type& edges() { return RS::elements(); }
 
    const Graph& graphOf() const {
        OGDF_ASSERT(RS::registeredAt());
        return *RS::registeredAt();
    }
};
 
 
template<bool SupportFastSizeQuery = true>
class AdjEntrySet : public RegisteredSet<internal::GraphAdjRegistry, SupportFastSizeQuery> {
    using RS = RegisteredSet<internal::GraphAdjRegistry, SupportFastSizeQuery>;
 
public:
    using RS::RS;
 
    explicit AdjEntrySet(const Graph& graph) : RS((const internal::GraphAdjRegistry&)graph) {};
 
    explicit AdjEntrySet() = default;
 
    const typename RS::list_type& adjEntries() { return RS::elements(); }
 
    const Graph& graphOf() const {
        OGDF_ASSERT(RS::registeredAt());
        return *RS::registeredAt();
    }
};
 
template<OGDF_NODE_LIST NL>
std::pair<int, int> Graph::insert(const NL& nodeList, const EdgeSet<true>& edgeSet,
        NodeArray<node>& nodeMap, EdgeArray<edge>& edgeMap) {
    using std::size;
    m_regNodeArrays.reserveSpace(size(nodeList));
    m_regEdgeArrays.reserveSpace(size(edgeSet));
    m_regAdjArrays.reserveSpace(size(edgeSet));
    using std::begin;
    using std::end;
    return insert(begin(nodeList), end(nodeList), edgeSet, nodeMap, edgeMap);
}
 
template<OGDF_NODE_LIST NL>
std::pair<int, int> Graph::insert(const NL& nodeList, const EdgeSet<false>& edgeSet,
        NodeArray<node>& nodeMap, EdgeArray<edge>& edgeMap) {
    using std::size;
    m_regNodeArrays.reserveSpace(size(nodeList));
    using std::begin;
    using std::end;
    return insert(begin(nodeList), end(nodeList), edgeSet, nodeMap, edgeMap);
}
 
}