Package org.gephi.graph.api

Examples of org.gephi.graph.api.HierarchicalGraph.removeNode()

99
100
101
102
103
104
105
106
107
108
109
            }
            for (Node n : minHGraph.getNodes().toArray()) {
                for (int i = 0; i < graphs.length; i++) {
                    if ((HierarchicalGraph)graphs[i] != minHGraph) {
                        if (!((HierarchicalGraph)graphs[i]).contains(n)) {
                            minHGraph.removeNode(n);
                            break;
                        }
                    }
                }
            }
View Full Code Here
147
148
149
150
151
152
153
154
155
156
157
                        }
                    }
                }

                for (Node n : nodesToRemove) {
                    hgraph.removeNode(n);
                }

                for (NodeFilter nf : nodeFilters) {
                    nf.finish();
                }
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
                result.removeAll(nodes);
            }

            for (Node node : hgraph.getNodes().toArray()) {
                if (!result.contains(node)) {
                    hgraph.removeNode(node);
                }
            }

            return hgraph;
        }
View Full Code Here
123
124
125
126
127
128
129
130
131
    }

    public void delete() {
        HierarchicalGraph hg=Lookup.getDefault().lookup(GraphController.class).getModel().getHierarchicalGraph();
        for (Node n : nodes) {
            hg.removeNode(n);
        }
    }
}
View Full Code Here
141
142
143
144
145
146
147
148
149
150
151
                        nodesToRemove.add(n);
                    }
                }

                for (Node n : nodesToRemove) {
                    hgraph.removeNode(n);
                }
                for (NodeFilter nf : nodeFilters) {
                    nf.finish();
                }
            }
View Full Code Here
123
124
125
126
127
128
129
130
131
132
133
            Filter filter = filters[0];
            if (filter instanceof NodeFilter && ((NodeFilter) filter).init(hgraph)) {
                NodeFilter nodeFilter = (NodeFilter) filter;
                for (Node n : hgraph.getNodes().toArray()) {
                    if (nodeFilter.evaluate(hgraph, n)) {
                        hgraph.removeNode(n);
                    }
                }
                nodeFilter.finish();
            }
View Full Code Here
162
163
164
165
166
167
168
169
170
171
172
                        nodesToRemove.add(n);
                    }
                }

                for (Node n : nodesToRemove) {
                    hgraph.removeNode(n);
                }
                for (NodeFilter nf : nodeFilters) {
                    nf.finish();
                }
            }
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
                    if (nodeFilter.evaluate(hgraph, n)) {
                        nodeToRemove.add(n);
                    }
                }
                for (Node n : nodeToRemove) {
                    hgraph.removeNode(n);
                }
                nodeFilter.finish();
            }
           
            if (filter instanceof AttributableFilter && ((AttributableFilter) filter).getType()==AttributableFilter.Type.NODE && ((AttributableFilter) filter).init(hgraph)) {
View Full Code Here
166
167
168
169
170
171
172
173
174
175
176
                    if (attributableFilter.evaluate(hgraph, n)) {
                        nodeToRemove.add(n);
                    }
                }
                for (Node n : nodeToRemove) {
                    hgraph.removeNode(n);
                }
                attributableFilter.finish();
            }

            return hgraph;
View Full Code Here
120
121
122
123
124
125
126
127
128
129
130
            }
            for (Node n : minHGraph.getNodes().toArray()) {
                for (int i = 0; i < graphs.length; i++) {
                    if ((HierarchicalGraph)graphs[i] != minHGraph) {
                        if (!((HierarchicalGraph)graphs[i]).contains(n)) {
                            minHGraph.removeNode(n);
                            break;
                        }
                    }
                }
            }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.