org.gephi.graph.api.Edge.isDirected()方法的使用及代码示例

x33g5p2x  于2022-01-19 转载在 其他  
字(4.2k)|赞(0)|评价(0)|浏览(244)

本文整理了Java中org.gephi.graph.api.Edge.isDirected()方法的一些代码示例,展示了Edge.isDirected()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。Edge.isDirected()方法的具体详情如下:
包路径:org.gephi.graph.api.Edge
类名称:Edge
方法名:isDirected

Edge.isDirected介绍

[英]Returns true if this edge is directed.
[中]如果此边是定向的,则返回true。

代码示例

代码示例来源:origin: org.gephi/graphstore

  1. @Override
  2. public boolean isDirected(Edge edge) {
  3. return edge.isDirected();
  4. }

代码示例来源:origin: gephi/graphstore

  1. @Override
  2. public boolean isDirected(Edge edge) {
  3. return edge.isDirected();
  4. }

代码示例来源:origin: org.gephi/graphstore

  1. @Override
  2. public boolean isDirected(final Edge edge) {
  3. return edge.isDirected();
  4. }

代码示例来源:origin: gephi/graphstore

  1. @Override
  2. public boolean isDirected(final Edge edge) {
  3. return edge.isDirected();
  4. }

代码示例来源:origin: org.gephi/desktop-datalab

  1. @Override
  2. public Object getValueFor(Edge edge) {
  3. if (edge.isDirected()) {
  4. return NbBundle.getMessage(EdgesDataTable.class, "EdgeDataTable.type.column.directed");
  5. } else {
  6. return NbBundle.getMessage(EdgesDataTable.class, "EdgeDataTable.type.column.undirected");
  7. }
  8. }
  9. };

代码示例来源:origin: org.gephi/filters-plugin

  1. @Override
  2. public boolean evaluate(Graph graph, Edge edge) {
  3. if(edge.isDirected()) {
  4. DirectedGraph directedGraph = (DirectedGraph)graph;
  5. return directedGraph.getMutualEdge(edge) != null;
  6. }
  7. return false;
  8. }

代码示例来源:origin: org.gephi/graphstore

  1. @Override
  2. public boolean addAllEdges(Collection<? extends Edge> edges) {
  3. for (Edge edge : edges) {
  4. if (edge.isDirected()) {
  5. throw new IllegalArgumentException("Can't add a directed edge to an undirected graph");
  6. }
  7. }
  8. return store.addAllEdges(edges);
  9. }

代码示例来源:origin: gephi/graphstore

  1. @Override
  2. public boolean addEdge(Edge edge) {
  3. if (edge.isDirected()) {
  4. throw new IllegalArgumentException("Can't add a directed edge to an undirected graph");
  5. }
  6. return store.addEdge(edge);
  7. }

代码示例来源:origin: gephi/graphstore

  1. @Override
  2. public boolean addAllEdges(Collection<? extends Edge> edges) {
  3. for (Edge edge : edges) {
  4. if (edge.isDirected()) {
  5. throw new IllegalArgumentException("Can't add a directed edge to an undirected graph");
  6. }
  7. }
  8. return store.addAllEdges(edges);
  9. }

代码示例来源:origin: org.gephi/graphstore

  1. @Override
  2. public boolean addEdge(Edge edge) {
  3. if (edge.isDirected()) {
  4. throw new IllegalArgumentException("Can't add a directed edge to an undirected graph");
  5. }
  6. return store.addEdge(edge);
  7. }

代码示例来源:origin: org.gephi/datalab-plugin

  1. @Override
  2. public void execute() {
  3. GraphElementsController gec = Lookup.getDefault().lookup(GraphElementsController.class);
  4. Graph graph = Lookup.getDefault().lookup(GraphController.class).getGraphModel().getGraph();
  5. List<Edge> edges = new ArrayList<>();
  6. for (Edge edge : graph.getEdges().toArray()) {
  7. if (edge.isDirected()) {
  8. if(deleteDirected){
  9. edges.add(edge);
  10. }
  11. }else if (deleteUndirected) {
  12. edges.add(edge);
  13. }
  14. }
  15. gec.deleteEdges(edges.toArray(new Edge[0]));
  16. }

代码示例来源:origin: org.gephi/datalab-api

  1. if (edge.isDirected() != directed) {
  2. sameEdgeDefinition = false;
  3. } else {
  4. id,
  5. source.getId(), target.getId(), directed,
  6. edge.getSource().getId(), edge.getTarget().getId(), edge.isDirected()
  7. if (edge != null && edge.isDirected() != directed) {

代码示例来源:origin: org.gephi/datalab-api

  1. newEdge = createEdge(newEdgeSource, newEdgeTarget, edge.isDirected(), edge.getTypeLabel(), graph);

代码示例来源:origin: org.gephi/preview-plugin

  1. @Override
  2. public Item[] getItems(Graph graph) {
  3. EdgeItem[] items = new EdgeItem[graph.getEdgeCount()];
  4. int i = 0;
  5. for (Edge e : graph.getEdges()) {
  6. EdgeItem item = new EdgeItem(e);
  7. item.setData(EdgeItem.WEIGHT, e.getWeight(graph.getView()));
  8. item.setData(EdgeItem.DIRECTED, e.isDirected());
  9. if (graph.isDirected(e)) {
  10. item.setData(EdgeItem.MUTUAL, ((DirectedGraph) graph).getMutualEdge(e) != null);
  11. }
  12. item.setData(EdgeItem.SELF_LOOP, e.isSelfLoop());
  13. item.setData(EdgeItem.COLOR, e.alpha() == 0 ? null : e.getColor());
  14. items[i++] = item;
  15. }
  16. return items;
  17. }

代码示例来源:origin: org.gephi/visualization

  1. for (Iterator<EdgeModel> itr = octree.getEdgeIterator(); itr.hasNext();) {
  2. EdgeModel obj = itr.next();
  3. if (obj.getEdge().isDirected() && obj.markTime != markTime) {
  4. obj.displayArrow(gl, glu, vizModel);
  5. obj.markTime = markTime;

代码示例来源:origin: org.gephi/visualization

  1. if (edge.isDirected()) {
  2. x = (objectModel.getSourceModel().getNode().x() + 2 * objectModel.getTargetModel().getNode().x()) / 3f;
  3. y = (objectModel.getSourceModel().getNode().y() + 2 * objectModel.getTargetModel().getNode().y()) / 3f;

代码示例来源:origin: org.gephi/visualization

  1. b = uni[2];
  2. a = uni[3];
  3. } else if (edge.isDirected()) {
  4. Node source = edge.getSource();
  5. r = source.r();

相关文章