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+)
 *
 **********************************************************************/


#pragma once

#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

// 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 /* non-final */ {
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();

    std::vector<Edge*>::iterator getEdgeIterator();

    std::vector<EdgeEnd*>* getEdgeEnds();

    bool isBoundaryNode(uint8_t geomIndex, const geom::Coordinate& coord);

    void add(EdgeEnd* e);

    NodeMap::iterator getNodeIterator();

    void getNodes(std::vector<Node*>&);

    Node* addNode(Node* node);

    Node* addNode(const geom::Coordinate& coord);

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

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

    void linkResultDirectedEdges();

    void linkAllDirectedEdges();

    EdgeEnd* findEdgeEnd(Edge* e);

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

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

    std::string printEdges();

    NodeMap* getNodeMap();

protected:

    std::vector<Edge*>* edges;

    NodeMap* nodes;

    std::vector<EdgeEnd*>* edgeEndList;

    void insertEdge(Edge* e);

private:

    bool matchInSameDirection(const geom::Coordinate& p0,
                              const geom::Coordinate& p1,
                              const geom::Coordinate& ep0,
                              const geom::Coordinate& ep1);

    PlanarGraph(const PlanarGraph&) = delete;
    PlanarGraph& operator=(const PlanarGraph&) = delete;
};



} // namespace geos.geomgraph
} // namespace geos