planargraph/PlanarGraph.h

/**********************************************************************
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.osgeo.org
 *
 * 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.
 *
 **********************************************************************
 *
 * Last port: planargraph/PlanarGraph.java rev. 107/138 (JTS-1.10)
 *
 **********************************************************************/
 
#ifndef GEOS_PLANARGRAPH_PLANARGRAPH_H
#define GEOS_PLANARGRAPH_PLANARGRAPH_H
 
#include <geos/export.h>
#include <geos/planargraph/NodeMap.h> // for composition
 
#include <vector> // for typedefs
 
#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 geom { 
                class Coordinate;
        }
        namespace planargraph { 
                class DirectedEdge;
                class Edge;
                class Node;
        }
}
 
namespace geos {
namespace planargraph { // geos.planargraph

class GEOS_DLL PlanarGraph {
 
protected:
 
        std::vector<Edge*> edges;
        std::vector<DirectedEdge*> dirEdges;
        NodeMap nodeMap;

        void add(Node *node) {
                nodeMap.add(node);
        }

        void add(Edge *edge);

        void add(DirectedEdge *dirEdge) {
                dirEdges.push_back(dirEdge);
        }
 
public:
 
        typedef std::vector<Edge *> EdgeContainer;
        typedef EdgeContainer::iterator EdgeIterator;
 

        PlanarGraph() {}
 
        virtual ~PlanarGraph() {}

        Node* findNode(const geom::Coordinate& pt) {
                return nodeMap.find(pt);
        }

        NodeMap::container::iterator nodeIterator() {
                return nodeMap.begin();
        }
 
        NodeMap::container::iterator nodeBegin() {
                return nodeMap.begin();
        }
 
        NodeMap::container::const_iterator nodeBegin() const {
                return nodeMap.begin();
        }
 
        NodeMap::container::iterator nodeEnd() {
                return nodeMap.end();
        }
 
        NodeMap::container::const_iterator nodeEnd() const {
                return nodeMap.end();
        }
  
        void getNodes(std::vector<Node*>& nodes) { nodeMap.getNodes(nodes); }

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

        std::vector<Edge*>::iterator edgeIterator() {
                return edges.begin();
        }

        //
        std::vector<Edge*>::iterator edgeBegin() {
                return edges.begin();
        }

        //
        std::vector<Edge*>::iterator edgeEnd() {
                return edges.end();
        }

        std::vector<Edge*>* getEdges() {
                return &edges;
        }

        void remove(Edge *edge);

        void remove(DirectedEdge *de);

        void remove(Node *node);

        std::vector<Node*>* findNodesOfDegree(std::size_t degree);

        void findNodesOfDegree(std::size_t degree, std::vector<Node*>& to);
};
 
} // namespace geos::planargraph
} // namespace geos
 
#ifdef _MSC_VER
#pragma warning(pop)
#endif
 
#endif // GEOS_PLANARGRAPH_PLANARGRAPH_H