geomgraph/PlanarGraph.h

/**********************************************************************
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.osgeo.org
 *
 * Copyright (C) 2005-2006 Refractions Research Inc.
 * Copyright (C) 2001-2002 Vivid Solutions 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: geomgraph/PlanarGraph.java r428 (JTS-1.12+)
 *
 **********************************************************************/
 
 
#ifndef GEOS_GEOMGRAPH_PLANARGRAPH_H
#define GEOS_GEOMGRAPH_PLANARGRAPH_H
 
#include <geos/export.h>
#include <map>
#include <vector>
#include <memory>
 
#include <geos/geom/Coordinate.h>
#include <geos/geomgraph/PlanarGraph.h>
#include <geos/geomgraph/NodeMap.h> // for typedefs
#include <geos/geomgraph/DirectedEdgeStar.h> // for inlines
 
#include <geos/inline.h>
 
// Forward declarations
namespace geos {
        namespace geom {
                class Coordinate;
        }
        namespace geomgraph {
                class Edge;
                class Node;
                class EdgeEnd;
                class NodeFactory;
        }
}
 
namespace geos {
namespace geomgraph { // geos.geomgraph

class GEOS_DLL PlanarGraph {
public:

  template <typename It>
  static void linkResultDirectedEdges(It first, It last)
    // throw(TopologyException);
  {
    for ( ; first!=last; ++first )
    {
      Node *node=*first;
      assert(node);
 
      EdgeEndStar* ees = node->getEdges();
      assert(ees);
      DirectedEdgeStar* des = dynamic_cast<DirectedEdgeStar*>(ees);
      assert(des);
 
      // this might throw an exception
      des->linkResultDirectedEdges();
    }
  }
 
        PlanarGraph(const NodeFactory &nodeFact);
 
        PlanarGraph();
 
        virtual ~PlanarGraph();
 
        virtual std::vector<Edge*>::iterator getEdgeIterator();
 
        virtual std::vector<EdgeEnd*>* getEdgeEnds();
 
        virtual bool isBoundaryNode(int geomIndex, const geom::Coordinate& coord);
 
        virtual void add(EdgeEnd *e);
 
        virtual NodeMap::iterator getNodeIterator();
 
        virtual void getNodes(std::vector<Node*>&);
 
        virtual Node* addNode(Node *node);
 
        virtual Node* addNode(const geom::Coordinate& coord);

        virtual Node* find(geom::Coordinate& coord);

        virtual void addEdges(const std::vector<Edge*> &edgesToAdd);
 
        virtual void linkResultDirectedEdges();
 
        virtual void linkAllDirectedEdges();

        virtual EdgeEnd* findEdgeEnd(Edge *e);

        virtual Edge* findEdge(const geom::Coordinate& p0,
                        const geom::Coordinate& p1);

        virtual Edge* findEdgeInSameDirection(const geom::Coordinate& p0,
                        const geom::Coordinate& p1);
 
        virtual std::string printEdges();
 
        virtual NodeMap* getNodeMap();
 
protected:
 
        std::vector<Edge*> *edges;
 
        NodeMap *nodes;
 
        std::vector<EdgeEnd*> *edgeEndList;
 
        virtual void insertEdge(Edge *e);
 
private:

        bool matchInSameDirection(const geom::Coordinate& p0,
                        const geom::Coordinate& p1,
                        const geom::Coordinate& ep0,
                        const geom::Coordinate& ep1);
};
 
 
 
} // namespace geos.geomgraph
} // namespace geos
 
//#ifdef GEOS_INLINE
//# include "geos/geomgraph/PlanarGraph.inl"
//#endif
 
#endif // ifndef GEOS_GEOMGRAPH_PLANARGRAPH_H