Package org.gephi.filters.spi

Examples of org.gephi.filters.spi.EdgeFilter.evaluate()

164
165
166
167
168
169
170
171
172
173
174
                    }
                }
                List<Edge> edgesToRemove = new ArrayList<Edge>();
                for (Edge e : hgraph.getEdges()) {
                    for (EdgeFilter ef : edgeFilters) {
                        if (!ef.evaluate(hgraph, e)) {
                            edgesToRemove.add(e);
                            break;
                        }
                    }
                }
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
            HierarchicalGraph hgraph = (HierarchicalGraph) graph;
            Filter filter = filters[0];
            if (filter instanceof EdgeFilter && ((EdgeFilter) filter).init(hgraph)) {
                EdgeFilter edgeFilter = (EdgeFilter) filter;
                for (Edge e : hgraph.getEdgesAndMetaEdges().toArray()) {
                    if (edgeFilter.evaluate(hgraph, e)) {
                        hgraph.removeEdge(e);
                    }
                }
                edgeFilter.finish();
            }
View Full Code Here
158
159
160
161
162
163
164
165
166
167
168
                }
                List<Edge> edgesToRemove = new ArrayList<Edge>();
                for (Edge e : hgraph.getEdgesAndMetaEdges()) {
                    boolean remove = true;
                    for (EdgeFilter ef : edgeFilters) {
                        if (ef.evaluate(hgraph, e)) {
                            remove = false;
                        }
                    }
                    if (remove) {
                        edgesToRemove.add(e);
View Full Code Here
179
180
181
182
183
184
185
186
187
188
189
                }
                List<Edge> edgesToRemove = new ArrayList<Edge>();
                for (Edge e : hgraph.getEdgesAndMetaEdges()) {
                    boolean remove = true;
                    for (EdgeFilter ef : edgeFilters) {
                        if (ef.evaluate(hgraph, e)) {
                            remove = false;
                        }
                    }
                    if (remove) {
                        edgesToRemove.add(e);
View Full Code Here
185
186
187
188
189
190
191
192
193
194
195
                    }
                }
                List<Edge> edgesToRemove = new ArrayList<Edge>();
                for (Edge e : hgraph.getEdges()) {
                    for (EdgeFilter ef : edgeFilters) {
                        if (!ef.evaluate(hgraph, e)) {
                            edgesToRemove.add(e);
                            break;
                        }
                    }
                }
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
            Filter filter = filters[0];
            if (filter instanceof EdgeFilter && ((EdgeFilter) filter).init(hgraph)) {
                EdgeFilter edgeFilter = (EdgeFilter) filter;
                List<Edge> edgesToRemove = new ArrayList<Edge>();
                for (Edge e : hgraph.getEdgesAndMetaEdges().toArray()) {
                    if (edgeFilter.evaluate(hgraph, e)) {
                        edgesToRemove.add(e);
                    }
                }
                for (Edge e : edgesToRemove) {
                    hgraph.removeEdge(e);
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.