private Node getNode(Coordinate pt) { Node node = findNode(pt); if (node == null) { node = new Node(pt); // ensure node is only added once to graph add(node); } return node; }
private Node getNode(Coordinate coordinate) { Node node = findNode(coordinate); if (node == null) { node = new Node(coordinate); add(node); } return node; } }
public void testDirectedEdgeToEdges() { DirectedEdge d1 = new DirectedEdge(new Node(new Coordinate(0, 0)), new Node(new Coordinate(10, 10)), new Coordinate(10, 10), true); DirectedEdge d2 = new DirectedEdge(new Node(new Coordinate(20, 0)), new Node(new Coordinate(20, 10)), new Coordinate(20, 10), false); List edges = DirectedEdge.toEdges(Arrays.asList(new Object[]{d1, d2})); assertEquals(2, edges.size()); assertNull(edges.get(0)); assertNull(edges.get(1)); }
public void testDirectedEdgeComparator() { DirectedEdge d1 = new DirectedEdge(new Node(new Coordinate(0, 0)), new Node(new Coordinate(10, 10)), new Coordinate(10, 10), true); DirectedEdge d2 = new DirectedEdge(new Node(new Coordinate(0, 0)), new Node(new Coordinate(20, 20)), new Coordinate(20, 20), false); assertEquals(0, d2.compareTo(d1)); }