Package org.gephi.graph.api

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

109
110
111
112
113
114
115
116
117
118
119
            }
            for (Edge e : minHGraph.getEdges().toArray()) {
                for (int i = 0; i < graphs.length; i++) {
                    if ((HierarchicalGraph)graphs[i] != minHGraph) {
                        if (!((HierarchicalGraph)graphs[i]).contains(e)) {
                            minHGraph.removeEdge(e);
                            break;
                        }
                    }
                }
            }
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
                        }
                    }
                }

                for (Edge e : edgesToRemove) {
                    hgraph.removeEdge(e);
                }

                for (EdgeFilter ef : edgeFilters) {
                    ef.finish();
                }
View Full Code Here
131
132
133
134
135
136
137
138
139
140
141
                    edgesToRemove.add(e);
                }
            }

            for (Edge e : edgesToRemove) {
                hgraph.removeEdge(e);
            }
            edgesToRemove.clear();

            for (Edge e : hgraph.getMetaEdges()) {
                if (!edgeFilter.evaluate(hgraph, e)) {
View Full Code Here
182
183
184
185
186
187
188
189
190
191
192
                        case ANY:
                            remove = !filter.evaluate(hgraph, source) && !filter.evaluate(hgraph, target);
                            break;
                    }
                    if (remove) {
                        hgraph.removeEdge(e);
                    }
                }
                filter.finish();
            }
            return hgraph;
View Full Code Here
117
118
119
120
121
122
123
124
125
126
127
            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
168
169
170
171
172
173
174
175
176
177
178
                        edgesToRemove.add(e);
                    }
                }

                for (Edge e : edgesToRemove) {
                    hgraph.removeEdge(e);
                }
                for (EdgeFilter ef : edgeFilters) {
                    ef.finish();
                }
            }
View Full Code Here
145
146
147
148
149
150
151
152
153
154
155
                    if (edgeFilter.evaluate(hgraph, e)) {
                        edgesToRemove.add(e);
                    }
                }
                for (Edge e : edgesToRemove) {
                    hgraph.removeEdge(e);
                }
                edgeFilter.finish();
            }

            return hgraph;
View Full Code Here
189
190
191
192
193
194
195
196
197
198
199
                        edgesToRemove.add(e);
                    }
                }

                for (Edge e : edgesToRemove) {
                    hgraph.removeEdge(e);
                }
                for (EdgeFilter ef : edgeFilters) {
                    ef.finish();
                }
            }
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
            }
            for (Edge e : minHGraph.getEdges().toArray()) {
                for (int i = 0; i < graphs.length; i++) {
                    if ((HierarchicalGraph)graphs[i] != minHGraph) {
                        if (!((HierarchicalGraph)graphs[i]).contains(e)) {
                            minHGraph.removeEdge(e);
                            break;
                        }
                    }
                }
            }
View Full Code Here
193
194
195
196
197
198
199
200
201
202
203
                        }
                    }
                }

                for (Edge e : edgesToRemove) {
                    hgraph.removeEdge(e);
                }

                for (EdgeFilter ef : edgeFilters) {
                    ef.finish();
                }
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.