Package org.gephi.graph.api

Examples of org.gephi.graph.api.Edge

239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
        directedGraph.addNode(node2);
        directedGraph.addNode(node3);
        directedGraph.addNode(node4);
        directedGraph.addNode(node5);

        Edge edge14 = graphModel.factory().newEdge(node1, node4);
        Edge edge15 = graphModel.factory().newEdge(node1, node5);
        Edge edge24 = graphModel.factory().newEdge(node2, node4);
        Edge edge25 = graphModel.factory().newEdge(node2, node5);
        Edge edge34 = graphModel.factory().newEdge(node3, node4);
        Edge edge35 = graphModel.factory().newEdge(node3, node5);

        directedGraph.addEdge(edge14);
        directedGraph.addEdge(edge15);
        directedGraph.addEdge(edge24);
        directedGraph.addEdge(edge25);
View Full Code Here
297
298
299
300
301
302
303
304
305
306
307
        Node firstNode = graphModel.factory().newNode("0");
        directedGraph.addNode(firstNode);
        for (int i = 1; i <= 5; i++) {
            Node currentNode = graphModel.factory().newNode(((Integer) i).toString());
            directedGraph.addNode(currentNode);
            Edge currentEdge = graphModel.factory().newEdge(firstNode, currentNode);
            directedGraph.addEdge(currentEdge);
        }

        DirectedGraph hgraph = graphModel.getDirectedGraph();
View Full Code Here
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
        directedGraph.addNode(node3);
        directedGraph.addNode(node4);
        directedGraph.addNode(node5);
        directedGraph.addNode(node6);

        Edge edge21 = graphModel.factory().newEdge(node2, node1);
        Edge edge31 = graphModel.factory().newEdge(node3, node1);
        Edge edge41 = graphModel.factory().newEdge(node4, node1);
        Edge edge51 = graphModel.factory().newEdge(node5, node1);
        Edge edge36 = graphModel.factory().newEdge(node3, node6);
        Edge edge46 = graphModel.factory().newEdge(node4, node6);
        Edge edge56 = graphModel.factory().newEdge(node5, node6);

        directedGraph.addEdge(edge21);
        directedGraph.addEdge(edge31);
        directedGraph.addEdge(edge41);
        directedGraph.addEdge(edge51);
View Full Code Here
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
        directedGraph.addNode(node3);
        directedGraph.addNode(node4);
        directedGraph.addNode(node5);
        directedGraph.addNode(node6);

        Edge edge15 = graphModel.factory().newEdge(node1, node5);
        Edge edge25 = graphModel.factory().newEdge(node2, node5);
        Edge edge35 = graphModel.factory().newEdge(node3, node5);
        Edge edge45 = graphModel.factory().newEdge(node4, node5);
        Edge edge56 = graphModel.factory().newEdge(node5, node6);

        directedGraph.addEdge(edge15);
        directedGraph.addEdge(edge25);
        directedGraph.addEdge(edge35);
        directedGraph.addEdge(edge45);
View Full Code Here
108
109
110
111
112
113
114
115
116
117
118
            duplicateNode(n);
        }
    }

    public Edge createEdge(Node source, Node target, boolean directed) {
        Edge newEdge;
        if (directed) {
            newEdge = buildEdge(source, target, true);
            if (getDirectedGraph().addEdge(newEdge)) {//The edge will be created if it does not already exist.
                return newEdge;
            } else {
View Full Code Here
127
128
129
130
131
132
133
134
135
136
137
            }
        }
    }

    public Edge createEdge(String id, Node source, Node target, boolean directed) {
        Edge newEdge;
        if (source != target) {//Cannot create self-loop
            if (directed) {
                newEdge = buildEdge(id, source, target, true);
                if (getDirectedGraph().addEdge(newEdge)) {//The edge will be created if it does not already exist.
                    return newEdge;
View Full Code Here
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
        Set<Node> nodesSet=new HashSet<Node>();
        nodesSet.addAll(Arrays.asList(nodes));
       
        //Assign edges to the new node:
        Edge newEdge;
        for (Node node : nodes) {
            for (Edge edge : getNodeEdges(node)) {
                if (edge.getSource() == node) {
                    if (nodesSet.contains(edge.getTarget())) {
                        newEdge = createEdge(newNode, newNode, edge.isDirected());//Self loop because of edge between merged nodes
                    } else {
                        newEdge = createEdge(newNode, edge.getTarget(), edge.isDirected());
                    }
                } else {
                    if (nodesSet.contains(edge.getSource())) {
                        newEdge = createEdge(newNode, newNode, edge.isDirected());//Self loop because of edge between merged nodes
                    } else {
                        newEdge = createEdge(edge.getSource(), newNode, edge.isDirected());
                    }
                }

                if (newEdge != null) {//Edge may not be created if repeated
                    //Copy edge attributes:
                    AttributeRow row = (AttributeRow) edge.getAttributes();
                    for (int i = 0; i < row.countValues(); i++) {
                        if (row.getAttributeValueAt(i).getColumn().getIndex() != PropertiesColumn.EDGE_ID.getIndex()) {
                            newEdge.getAttributes().setValue(i, row.getValue(i));
                        }
                    }
                }
            }
        }
View Full Code Here
534
535
536
537
538
539
540
541
        newNode.getNodeData().setLabel(label);
        return newNode;
    }

    private Edge buildEdge(Node source, Node target, boolean directed) {
        Edge newEdge = Lookup.getDefault().lookup(GraphController.class).getModel().factory().newEdge(source, target, DEFAULT_EDGE_WEIGHT, directed);
        return newEdge;
    }
View Full Code Here
539
540
541
542
543
544
545
546
        Edge newEdge = Lookup.getDefault().lookup(GraphController.class).getModel().factory().newEdge(source, target, DEFAULT_EDGE_WEIGHT, directed);
        return newEdge;
    }

    private Edge buildEdge(String id, Node source, Node target, boolean directed) {
        Edge newEdge = Lookup.getDefault().lookup(GraphController.class).getModel().factory().newEdge(id, source, target, DEFAULT_EDGE_WEIGHT, directed);
        return newEdge;
    }
View Full Code Here
314
315
316
317
318
319
320
321
322
323
324
325
            }
        }

        @Override
        public void drawTextEdge(EdgeModel objectModel) {
            Edge edge = objectModel.getEdge();
            TextProperties textData = (TextProperties) edge.getTextProperties();
            if (textData != null) {
                String txt = textData.getText();
                if (edgeRefresh) {
                    txt = buildText(edge, objectModel, model.getEdgeTextColumns());
                    if (txt == null || txt.isEmpty()) {
View Full Code Here
TOP

Related Classes of org.gephi.graph.api.Edge

  • org.gephi.algorithms.shortestpath.BellmanFordShortestPathAlgorithm
  • org.gephi.algorithms.shortestpath.DijkstraShortestPathAlgorithm
  • org.gephi.data.attributes.serialization.AttributeRowSerializer
  • org.gephi.datalab.impl.AttributeColumnsControllerImpl
  • org.gephi.datalab.impl.GraphElementsControllerImpl
  • org.gephi.datalab.plugin.manipulators.general.ui.AddEdgeToGraphUI
  • org.gephi.datalab.plugin.manipulators.general.ui.SearchReplaceUI
  • org.gephi.datalab.plugin.manipulators.ui.GeneralChooseColumnsAndRowUI
  • org.gephi.desktop.datalab.EdgeDataTable$PopupAdapter
  • org.gephi.desktop.ranking.ResultListPanel
    • 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.