Subgraph.h

Go to the documentation of this file.

/**********************************************************************
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.osgeo.org
 *
 * Copyright (C) 2001-2002 Vivid Solutions Inc.
 * Copyright (C) 2005-2006 Refractions Research Inc.
 *
 * This is free software; you can redistribute and/or modify it under
 * the terms of the GNU Lesser General Public Licence as published
 * by the Free Software Foundation.
 * See the COPYING file for more information.
 *
 **********************************************************************/

#ifndef GEOS_PLANARGRAPH_SUBGRAPH_H
#define GEOS_PLANARGRAPH_SUBGRAPH_H

#include <geos/export.h>
#include <geos/planargraph/NodeMap.h> // for composition

#include <vector>

#ifdef _MSC_VER
#pragma warning(push)
#pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class
#endif

// Forward declarations
namespace geos {
namespace planargraph {
class PlanarGraph;
class DirectedEdge;
class Edge;
}
}

namespace geos {
namespace planargraph { // geos.planargraph

class GEOS_DLL Subgraph {
public:
    Subgraph(PlanarGraph& parent)
        :
        parentGraph(parent)
    {}

    PlanarGraph&
    getParent() const
    {
        return parentGraph;
    }

    std::pair<std::set<Edge*>::iterator, bool> add(Edge* e);

    std::vector<const DirectedEdge*>::iterator
    getDirEdgeBegin()
    {
        return dirEdges.begin();
    }


    std::set<Edge*>::iterator
    edgeBegin()
    {
        return edges.begin();
    }
    std::set<Edge*>::iterator
    edgeEnd()
    {
        return edges.end();
    }

    NodeMap::container::iterator
    nodeBegin()
    {
        return nodeMap.begin();
    }
    NodeMap::container::const_iterator
    nodeEnd() const
    {
        return nodeMap.end();
    }
    NodeMap::container::iterator
    nodeEnd()
    {
        return nodeMap.end();
    }
    NodeMap::container::const_iterator
    nodeBegin() const
    {
        return nodeMap.begin();
    }

    bool
    contains(Edge* e)
    {
        return (edges.find(e) != edges.end());
    }

protected:

    PlanarGraph& parentGraph;
    std::set<Edge*> edges;
    std::vector<const DirectedEdge*> dirEdges;
    NodeMap nodeMap;

    // Declare type as noncopyable
    Subgraph(const Subgraph& other) = delete;
    Subgraph& operator=(const Subgraph& rhs) = delete;
};

} // namespace geos::planargraph
} // namespace geos

#ifdef _MSC_VER
#pragma warning(pop)
#endif

#endif // GEOS_PLANARGRAPH_SUBGRAPH_H