Package org.gephi.graph.dhns.node.iterators

Examples of org.gephi.graph.dhns.node.iterators.TreeListIterator

139
140
141
142
143
144
145
     * @return an iterator over the list
     */
    @Override
    public Iterator<AbstractNode> iterator() {
        // override to go 75% faster
        return new TreeListIterator(this);
    }
View Full Code Here
144
145
146
147
148
149
150
        return new TreeListIterator(this);
    }

    public Iterator<AbstractNode> iterator(int fromIndex) {
        // override to go 75% faster
        return new TreeListIterator(this, fromIndex);
    }
View Full Code Here
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
    public void testNewView() {
//        dhnsGlobal.getGraphStructure().getMainView().getStructure().showTreeAsTable();
        GraphViewImpl view = dhnsGlobal.getGraphStructure().getNewView();
//        view.getStructure().showTreeAsTable();

        for (TreeListIterator itr = new TreeListIterator(view.getStructure().getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            assertEquals(view.getViewId(), node.getViewId());
            AbstractNode mainNode = node.getInView(0);
            assertNotNull(mainNode);
            assertNotSame(node, mainNode);
            assertSame(node.getNodeData(), mainNode.getNodeData());
            if (mainNode.parent != null) {
                assertNotNull(node.parent);
                assertEquals(node.parent.getViewId(), view.getViewId());
            }
        }

        for (TreeListIterator itr = new TreeListIterator(view.getStructure().getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            AbstractNode mainNode = node.getInView(0);
            assertEquals(node.getEdgesInTree().getCount(), mainNode.getEdgesInTree().getCount());
            assertEquals(node.getEdgesOutTree().getCount(), mainNode.getEdgesOutTree().getCount());
            for (AbstractEdge edge : node.getEdgesInTree()) {
                assertSame(edge, mainNode.getEdgesInTree().getItem(edge.getSource().getNumber()));
View Full Code Here
199
200
201
202
203
204
205
206
207
208
209
210
    }

    public AbstractEdge[] clearAllEdges() {
        AbstractEdge[] edges = new AbstractEdge[view.getEdgesCountTotal()];
        int i = 0;
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree()); itr.hasNext();) {
            AbstractNode node = itr.next();
            edgeIterator.setNode(node.getEdgesOutTree());
            while (edgeIterator.hasNext()) {
                AbstractEdge edge = edgeIterator.next();
                dhns.getGraphStructure().removeFromDictionnary(edge);
                edges[i++] = edge;
View Full Code Here
222
223
224
225
226
227
228
229
230
231
232
233
        view.setMutualEdgesTotal(0);
        return edges;
    }

    public void clearAllMetaEdges() {
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree()); itr.hasNext();) {
            AbstractNode node = itr.next();
            node.clearMetaEdges();
            node.setMutualMetaEdgeDegree(0);
        }
        view.setMetaEdgesCountTotal(0);
        view.setMutualMetaEdgesTotal(0);
View Full Code Here
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
    public void resetViewToLeaves() {
        dhns.writeLock();
        edgeProcessor.clearAllMetaEdges();
        view.setNodesEnabled(0);
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            node.setEnabled(node.size == 0);
            if (node.isEnabled()) {
                view.incNodesEnabled(1);
            }
            edgeProcessor.resetEdgesCounting(node);
        }
        view.setEdgesCountEnabled(0);
        view.setMutualEdgesEnabled(0);
        for (TreeIterator itr = new TreeIterator(treeStructure, true, Tautology.instance); itr.hasNext();) {
            AbstractNode node = itr.next();
            edgeProcessor.computeMetaEdges(node, node);
            edgeProcessor.computeEdgesCounting(node);
        }
        graphVersion.incNodeAndEdgeVersion();
        dhns.writeUnlock();
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
    public void resetViewToTopNodes() {
        dhns.writeLock();
        edgeProcessor.clearAllMetaEdges();
        view.setNodesEnabled(0);
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            node.setEnabled(node.parent == treeStructure.root);
            if (node.isEnabled()) {
                view.incNodesEnabled(1);
            }
            edgeProcessor.resetEdgesCounting(node);
        }
        view.setEdgesCountEnabled(0);
        view.setMutualEdgesEnabled(0);
        for (TreeIterator itr = new TreeIterator(treeStructure, true, Tautology.instance); itr.hasNext();) {
            AbstractNode node = itr.next();
            edgeProcessor.computeMetaEdges(node, node);
            edgeProcessor.computeEdgesCounting(node);
        }
        graphVersion.incNodeAndEdgeVersion();
        dhns.writeUnlock();
View Full Code Here
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
    public void resetViewToLevel(int level) {
        dhns.writeLock();
        edgeProcessor.clearAllMetaEdges();
        view.setNodesEnabled(0);
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            node.setEnabled(node.level == level);
            if (node.isEnabled()) {
                view.incNodesEnabled(1);
            }
            edgeProcessor.resetEdgesCounting(node);
        }
        view.setEdgesCountEnabled(0);
        view.setMutualEdgesEnabled(0);
        for (TreeIterator itr = new TreeIterator(treeStructure, true, Tautology.instance); itr.hasNext();) {
            AbstractNode node = itr.next();
            edgeProcessor.computeMetaEdges(node, node);
            edgeProcessor.computeEdgesCounting(node);
        }
        graphVersion.incNodeAndEdgeVersion();
        dhns.writeUnlock();
View Full Code Here
340
341
342
343
344
345
346
347
348
349
350
351
            }

            List<AbstractNode> nodesToDelete = new ArrayList<AbstractNode>();
            List<AbstractNode> nodesToKeep = new ArrayList<AbstractNode>();

            for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), 1); itr.hasNext();) {
                AbstractNode node = itr.next();
                if (!node.isEnabled()) {
                    nodesToDelete.add(node);
                } else {
                    nodesToKeep.add(node);
                }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
        destination.writeLock();
        TreeStructure treeStructure = view.getStructure();
        GraphStructure newGraphStructure = destination.getGraphStructure();
        TreeStructure newStructure = newGraphStructure.getMainView().getStructure();
        //Nodes
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            AbstractNode nodeCopy = factory.newNode();
            duplicateNodeData(node.getNodeData(), nodeCopy.getNodeData());
            nodeCopy.setEnabled(node.isEnabled());
            nodeCopy.setEnabledInDegree(node.getEnabledInDegree());
            nodeCopy.setEnabledOutDegree(node.getEnabledOutDegree());
            nodeCopy.setEnabledMutualDegree(node.getEnabledMutualDegree());
            AbstractNode parentCopy = node.parent != null ? newStructure.getNodeAt(node.parent.getPre()) : null;
            newStructure.insertAsChild(nodeCopy, parentCopy);
            newGraphStructure.addToDictionnary(nodeCopy);
        }

        //Edges
        ParamAVLIterator<AbstractEdge> edgeIterator = new ParamAVLIterator<AbstractEdge>();
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            if (!node.getEdgesOutTree().isEmpty()) {
                for (edgeIterator.setNode(node.getEdgesOutTree()); edgeIterator.hasNext();) {
                    AbstractEdge edge = edgeIterator.next();
                    AbstractEdge edgeCopy;
                    AbstractNode sourceCopy = newStructure.getNodeAt(edge.getSource(view.getViewId()).getPre());
View Full Code Here
TOP

Related Classes of org.gephi.graph.dhns.node.iterators.TreeListIterator

  • org.gephi.graph.dhns.core.DhnsTestClusteredGraph
  • org.gephi.graph.dhns.core.DhnsTestDirectedGraph
  • org.gephi.graph.dhns.core.DuplicateManager
  • org.gephi.graph.dhns.core.DurableTreeList
  • org.gephi.graph.dhns.core.EdgeProcessor
  • org.gephi.graph.dhns.core.GraphStructure
  • org.gephi.graph.dhns.core.GraphStructure$ViewDestructorThread
  • org.gephi.graph.dhns.core.StructureModifier
  • org.gephi.graph.dhns.core.StructureModifier$Business
  • org.gephi.graph.dhns.core.TreeStructure
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.