public static Node getNearestNode(Network network, Coord coord) { return NetworkUtils.getNearestNode(network, coord) ; } public static Collection<Node> getNearestNodes(Network network, Coord coord, double distance) {
@Override public double calcDistance(Coord from, Coord to) { Network networkImpl = (Network)network; final Coord coord = from; Node fromNode = NetworkUtils.getNearestNode(networkImpl, coord); final Coord coord1 = to; Node toNode = NetworkUtils.getNearestNode(networkImpl, coord1); return dijkstraTree.calcLeastCostPath(fromNode, toNode, 0, null, null).travelCost; } };
Node nearestNode = NetworkUtils.getNearestNode((network),coord); if ( nearestNode == null ) { log.warn("[nearestNode not found. Will probably crash eventually. Maybe run NetworkCleaner? " +
progressBar.update(); Node nearestNode = NetworkUtils.getNearestNode(network, opportunity.getCoord()); double distance_m = NetworkUtils.getEuclideanDistance(opportunity.getCoord(), nearestNode.getCoord());
/** * MATSIM-278, 13jun2015: adding a node if quadtree is empty * * @author droeder / Senozon Deutschland GmbH */ @Test public void testAddTwoNodes_initializedEmptyQuadtree() { Network network = new NetworkImpl(); Node node1 = NetworkUtils.createNode(Id.create(1, Node.class), new Coord((double) 500, (double) 400)); Node node2 = NetworkUtils.createNode(Id.create(2, Node.class), new Coord((double) 600, (double) 500)); Node n = NetworkUtils.getNearestNode(network,new Coord((double) 550, (double) 450)); Assert.assertNull(n); network.addNode(node1); Assert.assertEquals(1, network.getNodes().size()); n = NetworkUtils.getNearestNode(network,new Coord((double) 550, (double) 450)); Assert.assertEquals(node1, n); network.addNode(node2); Assert.assertEquals(2, network.getNodes().size()); n = NetworkUtils.getNearestNode(network,new Coord((double) 590, (double) 490)); Assert.assertEquals(node2, n); }
/** * MATSIM-278, 10jun2015: adding a node if quadtree only contained one node * * @author mrieser / Senozon AG */ @Test public void testAddNode_singleNodeFirstOnly() { Network network = new NetworkImpl(); Node node1 = NetworkUtils.createNode(Id.create(1, Node.class), new Coord((double) 500, (double) 400)); Node node2 = NetworkUtils.createNode(Id.create(2, Node.class), new Coord((double) 600, (double) 500)); network.addNode(node1); Assert.assertEquals(1, network.getNodes().size()); Node n = NetworkUtils.getNearestNode(network,new Coord((double) 550, (double) 450)); Assert.assertEquals(node1, n); network.addNode(node2); Assert.assertEquals(2, network.getNodes().size()); n = NetworkUtils.getNearestNode(network,new Coord((double) 590, (double) 490)); Assert.assertEquals(node2, n); }
Link nearestRightLink = null; Link nearestOverallLink = null; Node nearestNode = NetworkUtils.getNearestNode((network),coord);