Examples of org.gephi.graph.api.Edge

org.gephi.graph.api.Edge
Edge interface. An edge connects two nodes and can be directed or not.
If working with several {@link GraphView}, note that source and target are always nodes in the main view. To obtain nodes in other views, do:
```
 GraphView view = ...; Node node = node.getNodeData().getNode(view.getViewId()); 
```
@author Mathieu Bastian

                p.setName("color");
                set.put(p);


                return set;
            } else {
                Edge edge = edges[0];
                Sheet.Set set = new Sheet.Set();
                set.setName("properties");
                set.setDisplayName(NbBundle.getMessage(EditEdges.class, "EditEdges.properties.text", edge.getEdgeData().getLabel()));


                Property p;


                //Color:
                SingleEdgePropertiesWrapper EdgeWrapper = new SingleEdgePropertiesWrapper(edge);

View Full Code Here

                }
                if (nodeRanking) {
                    Node n = (Node) line.getTarget();
                    labels.add(n.getNodeData().getLabel());
                } else {
                    Edge e = (Edge) line.getTarget();
                    labels.add(e.getEdgeData().getLabel());
                }
            }
        }


        ResultListTableModel model = new ResultListTableModel(cells.toArray(new RankCell[0]), labels.toArray(new String[0]));

View Full Code Here

                    color = edgePencilPanel.getColor();
                    weight = edgePencilPanel.getWeight();
                    GraphController gc = Lookup.getDefault().lookup(GraphController.class);
                    Graph graph = gc.getModel().getGraph();
                    boolean directed = graph instanceof DirectedGraph;
                    Edge edge = gc.getModel().factory().newEdge(sourceNode, n, weight, directed);
                    edge.getEdgeData().setR(color.getRed() / 255f);
                    edge.getEdgeData().setG(color.getGreen() / 255f);
                    edge.getEdgeData().setB(color.getBlue() / 255f);
                    graph.addEdge(edge);
                    sourceNode = null;
                    edgePencilPanel.setStatus(NbBundle.getMessage(EdgePencil.class, "EdgePencil.status1"));
                }
            }

View Full Code Here


                    double distance;
                    if ((distance = algorithm.getDistances().get(targetNode)) != Double.POSITIVE_INFINITY) {
                        targetNode.getNodeData().setColor(colorArray[0], colorArray[1], colorArray[2]);
                        VizController.getInstance().selectNode(targetNode);
                        Edge predecessorEdge = algorithm.getPredecessorIncoming(targetNode);
                        Node predecessor = algorithm.getPredecessor(targetNode);
                        while (predecessorEdge != null && predecessor != sourceNode) {
                            predecessorEdge.getEdgeData().setColor(colorArray[0], colorArray[1], colorArray[2]);
                            VizController.getInstance().selectEdge(predecessorEdge);
                            predecessor.getNodeData().setColor(colorArray[0], colorArray[1], colorArray[2]);
                            VizController.getInstance().selectNode(predecessor);
                            predecessorEdge = algorithm.getPredecessorIncoming(predecessor);
                            predecessor = algorithm.getPredecessor(predecessor);
                        }
                        predecessorEdge.getEdgeData().setColor(colorArray[0], colorArray[1], colorArray[2]);
                        VizController.getInstance().selectEdge(predecessorEdge);
                        sourceNode.getNodeData().setColor(colorArray[0], colorArray[1], colorArray[2]);
                        VizController.getInstance().selectNode(sourceNode);
                        shortestPathPanel.setResult(NbBundle.getMessage(ShortestPath.class, "ShortestPath.result", distance));
                    } else {

View Full Code Here

                if (!dataTablesController.isNodeTableMode()) {
                    dataTablesController.selectNodesTable();
                }
                value = node.getNodeData().getAttributes().getValue(searchResult.getFoundColumnIndex());
            } else {
                Edge edge = searchResult.getFoundEdge();
                dataTablesController.setEdgeTableSelection(new Edge[]{edge});
                if (!dataTablesController.isEdgeTableMode()) {
                    dataTablesController.selectEdgesTable();
                }
                value = edge.getEdgeData().getAttributes().getValue(searchResult.getFoundColumnIndex());
            }


            String columnName;
            if (mode == Mode.NODES_TABLE) {
                columnName = Lookup.getDefault().lookup(AttributeController.class).getModel().getNodeTable().getColumn(searchResult.getFoundColumnIndex()).getTitle();

View Full Code Here

        int i = 0;
        System.out.print("testGetEdges: ");
        for (Edge e : graphGlobal.getEdges()) {
            Node s = e.getSource();
            Node t = e.getTarget();
            Edge ed = edgeMap.get((s.getId() - 1) + "-" + (t.getId() - 1));
            assertSame("edge iterator", e, ed);
            System.out.print("#" + s.getId() + "-" + t.getId() + " ");
            actual[i++] = e;
        }
        System.out.println();
        assertArrayEquals(expected, actual);
        assertEquals("edge count", i, graphGlobal.getEdgeCount());




        graphGlobal.removeNode(nodeMap.get("Node 5"));


        //Test2
        expected = new Edge[2];
        expected[0] = edgeMap.get("4-4");
        expected[1] = edgeMap.get("7-7");
        actual = new Edge[2];
        i = 0;
        System.out.print("testGetEdges: ");
        for (Edge e : graphGlobal.getEdges()) {
            Node s = e.getSource();
            Node t = e.getTarget();
            Edge ed = edgeMap.get((s.getId() - 1) + "-" + (s.getId() - 1));
            assertSame("edge iterator", e, ed);
            System.out.print("#" + s.getId() + "-" + t.getId() + " ");
            actual[i++] = e;
        }
        System.out.println();

View Full Code Here

    public void testGetUndirecteEdge() {


        Node node5 = nodeMap.get("Node 5");
        Node node6 = nodeMap.get("Node 6");


        Edge edge1 = graphGlobal.getEdge(node5, node6);
        Edge edge2 = graphGlobal.getEdge(node5, node6);
        assertSame(edge1, edge2);
        assertSame(edgeMap.get("5-6"), edge1);


        assertNull(graphGlobal.getEdge(nodeMap.get("Node 1"), nodeMap.get("Node 2")));
        assertNull(graphGlobal.getEdge(nodeMap.get("Node 5"), nodeMap.get("Node 5")));

View Full Code Here


    @Test
    public void testOpposite() {
        Node node4 = nodeMap.get("Node 4");
        Node node5 = nodeMap.get("Node 5");
        Edge edge1 = edgeMap.get("4-5");
        Edge edge2 = edgeMap.get("4-4");


        assertEquals(node5, graphGlobal.getOpposite(node4, edge1));
        assertEquals(node4, graphGlobal.getOpposite(node4, edge2));
    }

View Full Code Here

    @Test
    public void testAdjacent() {
        Node node4 = nodeMap.get("Node 4");
        Node node5 = nodeMap.get("Node 5");
        Node node6 = nodeMap.get("Node 6");
        Edge edge1 = edgeMap.get("4-5");
        Edge edge2 = edgeMap.get("5-6");
        Edge edge3 = edgeMap.get("6-5");


        //assertTrue(graphGlobal.isAdjacent(node4, node4));
        assertTrue(graphGlobal.isAdjacent(node5, node6));
        assertFalse(graphGlobal.isAdjacent(node4, node6));
        assertTrue(graphGlobal.isAdjacent(edge1, edge2));

View Full Code Here

        graph.addNode(node3, node1);
        graph.addNode(node5, node4);
        graph.addNode(node6);


        //Add edge
        Edge edge23 = factory.newEdge(node2, node3);
        Edge edge35 = factory.newEdge(node3, node5);
        Edge edge34 = factory.newEdge(node3, node4);
        Edge edge15 = factory.newEdge(node1, node5);
        Edge edge36 = factory.newEdge(node3, node6);
        graph.addEdge(edge23);
        graph.addEdge(edge35);
        graph.addEdge(edge34);
        graph.addEdge(edge15);
        graph.addEdge(edge36);

View Full Code Here

0 1 2 3 4 5 6 7 8 9

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

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.