/** * Used for iterating through all edges of the graph * * @return Array with all graph edges */ private Edge[] getEdgesArray() { return Lookup.getDefault().lookup(GraphController.class).getGraphModel().getGraph().getEdges().toArray(); }
@Override public Edge[] getNodeEdges(Node node) { return getCurrentGraph().getEdges(node).toArray(); }
@Override public void execute() { GraphElementsController gec = Lookup.getDefault().lookup(GraphElementsController.class); Graph graph = Lookup.getDefault().lookup(GraphController.class).getGraphModel().getGraph(); List<Edge> edges = new ArrayList<>(); for (Edge edge : graph.getEdges().toArray()) { if (edge.isDirected()) { if(deleteDirected){ edges.add(edge); } }else if (deleteUndirected) { edges.add(edge); } } gec.deleteEdges(edges.toArray(new Edge[0])); }
/** * Sets edgesToSearch as all edges in the graph if they are null or empty array. * Also only search on visible view if data table is showing visible only. */ private void checkEdgesToSearch() { if (edgesToSearch == null || edgesToSearch.length == 0) { Graph hg; if (Lookup.getDefault().lookup(DataTablesController.class).isShowOnlyVisible()) { hg = Lookup.getDefault().lookup(GraphController.class).getGraphModel().getGraphVisible(); } else { hg = Lookup.getDefault().lookup(GraphController.class).getGraphModel().getGraph(); } edgesToSearch = hg.getEdges().toArray(); } }
@Override public void execute() { //Note that a function to inverse selection directly in the table with DataTablesController //would be more efficient than calculating it here, but this example demonstrates some table selection features. DataTablesController dtc = Lookup.getDefault().lookup(DataTablesController.class); Graph graph = Lookup.getDefault().lookup(GraphController.class).getGraphModel().getGraph(); if (dtc.isNodeTableMode()) { //Get currently selected nodes and calculate inverse set. Node[] selected = dtc.getNodeTableSelection(); ArrayList<Node> nodes = new ArrayList<Node>(); nodes.addAll(Arrays.asList(graph.getNodes().toArray())); for (Node node : selected) { nodes.remove(node); } dtc.setNodeTableSelection(nodes.toArray(new Node[0])); } else if (dtc.isEdgeTableMode()) { //Get currently selected edges and calculate inverse set. Edge[] selected = dtc.getEdgeTableSelection(); ArrayList<Edge> edges = new ArrayList<Edge>(); edges.addAll(Arrays.asList(graph.getEdges().toArray())); for (Edge edge : selected) { edges.remove(edge); } dtc.setEdgeTableSelection(edges.toArray(new Edge[0])); } }
if (onlyVisibleElements) { edges = Lookup.getDefault().lookup(GraphController.class).getGraphModel().getGraphVisible().getEdges().toArray(); } else { edges = new Edge[0];//Search on all edges
edgeTable.refreshModel(graph.getEdges().toArray(), cols, graphModel, dataTablesModel);
for (Edge e : graph.getEdges().toArray()) { String sourceId = e.getSource().getId().toString(); String targetId = e.getTarget().getId().toString();
@Override public void actionPerformed(ActionEvent e) { //Get the current graph model GraphController gc = Lookup.getDefault().lookup(GraphController.class); GraphModel graphModel = gc.getGraphModel(); if (graphModel != null) { //Remove self loops int removed = 0; Graph graph = graphModel.getGraph(); graph.writeLock(); for (Edge edge : graph.getEdges().toArray()) { if (edge.isSelfLoop()) { graph.removeEdge(edge); removed++; } } graph.writeUnlock(); //Notification message NotifyDescriptor d = new NotifyDescriptor.Message(removed + " self-loop have been removed", NotifyDescriptor.INFORMATION_MESSAGE); DialogDisplayer.getDefault().notify(d); } else { //Error message NotifyDescriptor d = new NotifyDescriptor.Message("No active workspace", NotifyDescriptor.ERROR_MESSAGE); DialogDisplayer.getDefault().notify(d); } } }
@Override public void actionPerformed(ActionEvent evt) { GraphController gc = Lookup.getDefault().lookup(GraphController.class); GraphModel gm = gc.getGraphModel(); Graph graph = gm.getGraphVisible(); for (Node n : graph.getNodes().toArray()) { n.getTextProperties().setColor(Color.BLACK); n.getTextProperties().setAlpha(0f); } for (Edge e : graph.getEdges().toArray()) { e.getTextProperties().setColor(Color.BLACK); e.getTextProperties().setAlpha(0f); } } });
Edge[] edges = graph.getEdges().toArray();
try { Node[] nodes = graph.getNodes().toArray(); Edge[] edges = graph.getEdges().toArray();
@Override public Graph filter(Graph graph) { Edge[] edges = graph.getEdges().toArray(); for (Edge e : edges) { for (Edge f : edges) {
Edge[] edges = graph.getEdges().toArray();