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

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

250
251
252
253
254
255
256
257
258
259
260
261
        assertEquals(oldSize + 1 - groupArray.length, graphGlobal.getNodeCount());
        assertEquals(groupArray.length, group.size);
        assertEquals(graphGlobal.getHeight(), 1);

        int i = 0;
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), group.getPre()); itr.hasNext();) {
            AbstractNode node = itr.next();
            assertEquals(group.pre + i, node.getPre());
            i++;
        }
        try {
            checkHierarchy(treeStructure);
View Full Code Here
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
        int count = 0;
        AbstractNode[] array = new AbstractNode[treeStructure.getTreeSize()];

        //Pre test
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree()); itr.hasNext();) {
            AbstractNode node = itr.next();

            assertEquals("node pre test", node.pre, count);
            array[count] = node;
            count++;
        }
View Full Code Here
133
134
135
136
137
138
139
140
141
142
143
144
    public void writeEdges(XMLStreamWriter writer, TreeStructure treeStructure) throws XMLStreamException {
        writer.writeStartElement(ELEMENT_EDGES);

        ParamAVLIterator<AbstractEdge> edgeIterator = new ParamAVLIterator<AbstractEdge>();
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            for (edgeIterator.setNode(node.getEdgesOutTree()); edgeIterator.hasNext();) {
                AbstractEdge edge = edgeIterator.next();
                if (edge.isSelfLoop()) {
                    writer.writeStartElement(ELEMENT_EDGES_SELFLOOP);
                } else if (edge.isMixed()) {
View Full Code Here
224
225
226
227
228
229
230
231
232
233
234
235
        writer.writeAttribute("mutualedgesenabled", String.valueOf(view.getMutualEdgesEnabled()));
        writer.writeAttribute("mutualedgestotal", String.valueOf(view.getMutualEdgesTotal()));
        writer.writeAttribute("nodesenabled", String.valueOf(view.getNodesEnabled()));

        writer.writeStartElement(ELEMENT_TREESTRUCTURE_TREE);
        for (TreeListIterator itr = new TreeListIterator(view.getStructure().getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            writer.writeStartElement(ELEMENT_TREESTRUCTURE_NODE);
            writer.writeAttribute("id", String.valueOf(node.getId()));
            writer.writeAttribute("enabled", String.valueOf(node.isEnabled()));
            writer.writeAttribute("pre", String.valueOf(node.pre));
            writer.writeAttribute("parent", String.valueOf(node.parent.pre));
View Full Code Here
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
        writer.writeAttribute("mutualedgesenabled", String.valueOf(graphView.getMutualEdgesEnabled()));
        writer.writeAttribute("mutualedgestotal", String.valueOf(graphView.getMutualEdgesTotal()));
        writer.writeAttribute("nodesenabled", String.valueOf(graphView.getNodesEnabled()));

        //Nodes
        for (TreeListIterator itr = new TreeListIterator(graphView.getStructure().getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            writer.writeStartElement(ELEMENT_VIEW_NODE);
            writer.writeAttribute("mainpre", String.valueOf(node.getInView(0).pre));
            writer.writeAttribute("enabled", String.valueOf(node.isEnabled()));
            writer.writeAttribute("pre", String.valueOf(node.pre));
            writer.writeAttribute("parent", String.valueOf(node.parent.pre));
            writer.writeAttribute("enabledindegree", String.valueOf(node.getEnabledInDegree()));
            writer.writeAttribute("enabledoutdegree", String.valueOf(node.getEnabledOutDegree()));
            writer.writeAttribute("enabledmutualdegree", String.valueOf(node.getEnabledMutualDegree()));
            writer.writeEndElement();
        }

        //Edges
        ParamAVLIterator<AbstractEdge> edgeIterator = new ParamAVLIterator<AbstractEdge>();
        for (TreeListIterator itr = new TreeListIterator(graphView.getStructure().getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            for (edgeIterator.setNode(node.getEdgesOutTree()); edgeIterator.hasNext();) {
                AbstractEdge edge = edgeIterator.next();
                writer.writeStartElement(ELEMENT_VIEW_EDGE);
                writer.writeAttribute("id", String.valueOf(edge.getId()));
                writer.writeEndElement();
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
    public void writeData(XMLStreamWriter writer, Dhns dhns) throws XMLStreamException {
        writer.writeStartElement(ELEMENT_DATA);

        TreeStructure treeStructure = dhns.getGraphStructure().getMainView().getStructure();
        TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), 1);
        for (; itr.hasNext();) {
            AbstractNode absNode = itr.next();
            NodeDataImpl nodeData = absNode.getNodeData();
            if (nodeData != null) {
                writeNodeData(writer, nodeData);
            }
        }

        EdgeIterator edgeIterator = new EdgeIterator(treeStructure, new TreeListIterator(treeStructure.getTree(), 1), false, Tautology.instance, Tautology.instance);
        for (; edgeIterator.hasNext();) {
            EdgeDataImpl edgeData = edgeIterator.next().getEdgeData();
            if (edgeData != null) {
                writeEdgeData(writer, edgeData);
            }
View Full Code Here
246
247
248
249
250
251
252
253
254
255
256
257
        }
    }

    public void clear() {
        //Clean nodes
        for (TreeListIterator itr = new TreeListIterator(tree); itr.hasNext();) {
            AbstractNode preNode = itr.next();
            preNode.avlNode = null;
            preNode.parent = null;
        }
        tree.clear();
        root = null;
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
    public GraphViewImpl copyView(GraphViewImpl view) {
        GraphViewImpl viewCopy = new GraphViewImpl(dhns, viewId.getAndIncrement());
        TreeStructure newStructure = viewCopy.getStructure();
        dhns.writeLock();

        for (TreeListIterator itr = new TreeListIterator(view.getStructure().getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            AbstractNode nodeCopy = new AbstractNode(node.getNodeData(), viewCopy.getViewId());
            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);
        }

        //Edges
        ParamAVLIterator<AbstractEdge> edgeIterator = new ParamAVLIterator<AbstractEdge>();
        for (TreeListIterator itr = new TreeListIterator(view.getStructure().getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            if (!node.getEdgesOutTree().isEmpty()) {
                for (edgeIterator.setNode(node.getEdgesOutTree()); edgeIterator.hasNext();) {
                    AbstractEdge edge = edgeIterator.next();
                    AbstractNode sourceCopy = newStructure.getNodeAt(edge.getSource().getPre());
                    AbstractNode targetCopy = newStructure.getNodeAt(edge.getTarget().getPre());
View Full Code Here
243
244
245
246
247
248
249
250
251
252
253
254
        private void destroyView(GraphStructure structure, GraphViewImpl view) {
            //Logger.getLogger("").log(Level.WARNING, "Destroy view {0}", view.getViewId());
            structure.dhns.writeLock();
            ParamAVLIterator<AbstractEdge> edgeIterator = new ParamAVLIterator<AbstractEdge>();
            for (TreeListIterator itr = new TreeListIterator(structure.mainView.getStructure().getTree(), 1); itr.hasNext();) {
                AbstractNode node = itr.next();
                AbstractNode nodeInView = node.getNodeData().getNodes().get(view.getViewId());
                if (nodeInView != null) {
                    node.getNodeData().getNodes().remove(view.getViewId());
                    if (!nodeInView.getEdgesOutTree().isEmpty()) {
                        for (edgeIterator.setNode(nodeInView.getEdgesOutTree()); edgeIterator.hasNext();) {
View Full Code Here
568
569
570
571
572
573
574
575
576
577
578
579
        }

        private AbstractNode[] clearAllNodes() {
            AbstractNode[] deletedNodes = new AbstractNode[treeStructure.getTreeSize() - 1];
            int n = 0;
            for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), 1); itr.hasNext();) {
                AbstractNode node = itr.next();
                node.getNodeData().getNodes().remove(view.getViewId());
                dhns.getGraphStructure().removeFromDictionnary(node);
                deletedNodes[n++] = node;
            }
            treeStructure.clear();
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.