/********************************************************************** * $Id: planarNode.cpp,v 1.4 2004/10/19 19:51:14 strk Exp $ * * GEOS - Geometry Engine Open Source * http://geos.refractions.net * * 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 Licence as published * by the Free Software Foundation. * See the COPYING file for more information. * **********************************************************************/ #include namespace geos { //namespace planargraph { /** * Returns all Edges that connect the two nodes (which are assumed to be different). */ vector* planarNode::getEdgesBetween(planarNode *node0, planarNode *node1) { // vector *edges0=planarDirectedEdge::toEdges(node0->getOutEdges()->getEdges()); //Set commonEdges = new HashSet(edges0); //List edges1 = DirectedEdge.toEdges(node1.getOutEdges().getEdges()); //commonEdges.retainAll(edges1); //return commonEdges; return NULL; } /** * Constructs a Node with the given location. */ planarNode::planarNode(const Coordinate& newPt) { #ifdef DEBUG_ALLOC cerr<<"["<add(de); } /** * Returns the collection of DirectedEdges that leave this Node. */ planarDirectedEdgeStar* planarNode::getOutEdges() { return deStar; } /** * Returns the number of edges around this Node. */ int planarNode::getDegree() { return deStar->getDegree(); } /** * Returns the zero-based index of the given Edge, after sorting in ascending order * by angle with the positive x-axis. */ int planarNode::getIndex(planarEdge *edge){ return deStar->getIndex(edge); } planarNode::~planarNode() { #ifdef DEBUG_ALLOC cerr<<"["<