@Override public boolean isDirected(Edge edge) { return edge.isDirected(); }
@Override public boolean isDirected(Edge edge) { return edge.isDirected(); }
@Override public boolean isDirected(final Edge edge) { return edge.isDirected(); }
@Override public boolean isDirected(final Edge edge) { return edge.isDirected(); }
@Override public Object getValueFor(Edge edge) { if (edge.isDirected()) { return NbBundle.getMessage(EdgesDataTable.class, "EdgeDataTable.type.column.directed"); } else { return NbBundle.getMessage(EdgesDataTable.class, "EdgeDataTable.type.column.undirected"); } } };
@Override public boolean evaluate(Graph graph, Edge edge) { if(edge.isDirected()) { DirectedGraph directedGraph = (DirectedGraph)graph; return directedGraph.getMutualEdge(edge) != null; } return false; }
@Override public boolean addAllEdges(Collection<? extends Edge> edges) { for (Edge edge : edges) { if (edge.isDirected()) { throw new IllegalArgumentException("Can't add a directed edge to an undirected graph"); } } return store.addAllEdges(edges); }
@Override public boolean addEdge(Edge edge) { if (edge.isDirected()) { throw new IllegalArgumentException("Can't add a directed edge to an undirected graph"); } return store.addEdge(edge); }
@Override public boolean addAllEdges(Collection<? extends Edge> edges) { for (Edge edge : edges) { if (edge.isDirected()) { throw new IllegalArgumentException("Can't add a directed edge to an undirected graph"); } } return store.addAllEdges(edges); }
@Override public boolean addEdge(Edge edge) { if (edge.isDirected()) { throw new IllegalArgumentException("Can't add a directed edge to an undirected graph"); } return store.addEdge(edge); }
@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])); }
if (edge.isDirected() != directed) { sameEdgeDefinition = false; } else { id, source.getId(), target.getId(), directed, edge.getSource().getId(), edge.getTarget().getId(), edge.isDirected() if (edge != null && edge.isDirected() != directed) {
newEdge = createEdge(newEdgeSource, newEdgeTarget, edge.isDirected(), edge.getTypeLabel(), graph);
@Override public Item[] getItems(Graph graph) { EdgeItem[] items = new EdgeItem[graph.getEdgeCount()]; int i = 0; for (Edge e : graph.getEdges()) { EdgeItem item = new EdgeItem(e); item.setData(EdgeItem.WEIGHT, e.getWeight(graph.getView())); item.setData(EdgeItem.DIRECTED, e.isDirected()); if (graph.isDirected(e)) { item.setData(EdgeItem.MUTUAL, ((DirectedGraph) graph).getMutualEdge(e) != null); } item.setData(EdgeItem.SELF_LOOP, e.isSelfLoop()); item.setData(EdgeItem.COLOR, e.alpha() == 0 ? null : e.getColor()); items[i++] = item; } return items; }
for (Iterator<EdgeModel> itr = octree.getEdgeIterator(); itr.hasNext();) { EdgeModel obj = itr.next(); if (obj.getEdge().isDirected() && obj.markTime != markTime) { obj.displayArrow(gl, glu, vizModel); obj.markTime = markTime;
if (edge.isDirected()) { x = (objectModel.getSourceModel().getNode().x() + 2 * objectModel.getTargetModel().getNode().x()) / 3f; y = (objectModel.getSourceModel().getNode().y() + 2 * objectModel.getTargetModel().getNode().y()) / 3f;
b = uni[2]; a = uni[3]; } else if (edge.isDirected()) { Node source = edge.getSource(); r = source.r();