public void addClosureAndUpdateLinks(Set<InternalNode> internalNodes, Set<Node> addedNodes) { logger.debug("<enter"); if (addedNodes == null) addedNodes = new HashSet<>(); long start = System.currentTimeMillis(); float elapsedTimeSec; if (internalNodes != null) { Node[] nodes = internalNodes.toArray(new Node[0]); for (Node node : nodes) if (this.idToNodeMap.containsKey(node.getId())) addNodeClosure(node, addedNodes); } long addNodesClosure = System.currentTimeMillis(); elapsedTimeSec = (addNodesClosure - start)/1000F; logger.debug("time to add nodes closure: " + elapsedTimeSec); updateLinks(); long updateLinks = System.currentTimeMillis(); elapsedTimeSec = (updateLinks - addNodesClosure)/1000F; logger.debug("time to update links of the graph: " + elapsedTimeSec); logger.debug("total number of nodes in graph: " + this.graph.vertexSet().size()); logger.debug("total number of links in graph: " + this.graph.edgeSet().size()); logger.debug("exit>"); }
addNodeClosure(node, addedNodes);