org.gephi.graph.api.Edge类的使用及代码示例

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

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

Edge介绍

[英]An edge.
[中]边缘。

代码示例

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

  1. @Override
  2. public Node next() {
  3.   Edge e = itr.next();
  4.   return e.getSource() == node ? e.getTarget() : e.getSource();
  5. }

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

  1. private double getEdgeWeight(Edge edge, boolean isDynamicWeight, Interval interval) {
  2.   if (isDynamicWeight) {
  3.     return edge.getWeight(interval);
  4.   } else {
  5.     return edge.getWeight();
  6.   }
  7. }

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

  1. @Override
  2. public boolean evaluate(Graph graph, Edge edge) {
  3.   return !edge.isSelfLoop();
  4. }

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

  1. private void copyEdgeProperties(Edge edge, Edge edgeCopy) {
  2.   edgeCopy.setColor(edge.getColor());
  3.   edgeCopy.setLabel(edge.getLabel());
  4. }

代码示例来源：origin: gephi/gephi-plugins-bootcamp

  1. @Override
  2. public boolean evaluate(Graph graph, Edge edge) {
  3.   DirectedGraph directedGraph = (DirectedGraph) graph;
  4.   //Make sure the edge is not  self loop
  5.   if (!edge.isSelfLoop()) {
  6.     //Get the potential mutual edge
  7.     Edge mutualEdge = directedGraph.getMutualEdge(edge);
  8.     //Remove the mutual edge if exists
  9.     //Make sure only one of the two mutual edges will be removed
  10.     if (mutualEdge != null && mutualEdge.getStoreId() < edge.getStoreId()) {
  11.       return false;
  12.     }
  13.   }
  14.   return true;
  15. }

代码示例来源：origin: gephi/gephi-plugins-bootcamp

  1. String sourceId = e.getSource().getId().toString();
  2. String targetId = e.getTarget().getId().toString();
  3. String weight = String.valueOf(e.getWeight());
  4. statement.executeUpdate("insert into edges values('" + sourceId + "', '" + targetId + "', '" + weight + "')");
  5. if (cancel) {

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

  1. double totalOutWeight = 0;
  2.   for (Edge e : directedGraph.getEdges(n)) {
  3.     if (e.getSource().equals(n)) {
  4.       totalOutWeight += e.getWeight();
  5.     if (e.getTarget().equals(n)) {
  6.       totalInWeight += e.getWeight();
  7. } else {
  8.   for (Edge e : graph.getEdges(n)) {
  9.     totalWeight += (e.isSelfLoop() ? 2 : 1) * e.getWeight();

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

  1. Node newEdgeSource;
  2. Node newEdgeTarget;
  3. if (edge.getSource() == node) {
  4.   newEdgeSource = newNode;
  5.   if (nodesSet.contains(edge.getTarget())) {
  6.     newEdgeTarget = edge.getTarget();
  7.   if (nodesSet.contains(edge.getSource())) {
  8.     newEdgeSource = edge.getSource();
  9. newEdge = createEdge(newEdgeSource, newEdgeTarget, edge.isDirected(), edge.getTypeLabel(), graph);
  10.       Object value = edge.getAttribute(column);
  11.       if (value == null) {
  12.         newEdge.removeAttribute(column);
  13.       } else {
  14.         newEdge.setAttribute(column, edge.getAttribute(column));

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

  1. float x1 = edge.getSource().x();
  2. float x2 = edge.getTarget().x();
  3. float y1 = edge.getSource().y();
  4. float y2 = edge.getTarget().y();
  5. float t1 = w;
  6. float t2 = w;
  7.   float g;
  8.   float b;
  9.   float a = edge.alpha();
  10.   if (a == 0f) {
  11.     if (vizModel.isEdgeHasUniColor()) {
  12.       b = uni[2];
  13.       a = uni[3];
  14.     } else if (edge.isDirected()) {
  15.       Node source = edge.getSource();
  16.       r = source.r();
  17.       g = source.g();
  18.       a = source.alpha();
  19.     } else {
  20.       Node source = edge.getSource();
  21.       Node target = edge.getTarget();
  22.     r = edge.r();
  23.     g = edge.g();
  24.     b = edge.b();

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

  1. private EdgeImpl verifyEdge(Edge edge) {
  2.   EdgeImpl edgeImpl = (EdgeImpl) edge;
  3.   verifyElement(edgeImpl);
  4.   EdgeImpl existingEdge = store.getEdge(edge.getId());
  5.   if (existingEdge != null && (!existingEdge.getSource().getId().equals(edge.getSource().getId()) || !existingEdge
  6.       .getTarget().getId().equals(edge.getTarget().getId()))) {
  7.     throw new RuntimeException("An edge with a similar id '" + edge.getId() + "' already exists");
  8.   }
  9.   return edgeImpl;
  10. }

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

  1. boolean t = edgeBitVector.get(e.getStoreId());
  2. if (t && (!nodeBitVector.get(e.getSource().getStoreId()) || !nodeBitVector.get(e.getTarget()
  3.     .getStoreId()))) {
  4.   removeEdge((EdgeImpl) e);

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

  1. if (edge.isDirected() != directed) {
  2.   sameEdgeDefinition = false;
  3. } else {
  4.   if (directed) {
  5.     if (edge.getSource() != source || edge.getTarget() != target) {
  6.       sameEdgeDefinition = false;
  7.     if (edge.getSource() == source) {
  8.       if (edge.getTarget() != target) {
  9.         sameEdgeDefinition = false;
  10.     } else if (edge.getTarget() == source) {
  11.       if (edge.getSource() != target) {
  12.         sameEdgeDefinition = false;
  13.         id,
  14.         source.getId(), target.getId(), directed,
  15.         edge.getSource().getId(), edge.getTarget().getId(), edge.isDirected()
  16. if (edge != null && edge.isDirected() != directed) {

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

  1. @Override
  2. public Graph filter(Subgraph[] graphs) {
  3.   if (graphs.length > 1) {
  4.     throw new IllegalArgumentException("Not Filter accepts a single graph in parameter");
  5.   }
  6.   Graph graph = graphs[0];
  7.   Graph mainGraph = graph.getView().getGraphModel().getGraph();
  8.   for (Edge e : mainGraph.getEdges()) {
  9.     Node source = e.getSource();
  10.     Node target = e.getTarget();
  11.     if (graph.contains(source) && graph.contains(target)) {
  12.       Edge edgeInGraph = graph.getEdge(source, target, e.getType());
  13.       if (edgeInGraph == null) {
  14.         //The edge is not in graph
  15.         graph.addEdge(e);
  16.       } else {
  17.         //The edge is in the graph
  18.         graph.removeEdge(edgeInGraph);
  19.       }
  20.     }
  21.   }
  22.   return graph;
  23. }

代码示例来源：origin: gephi/gephi-plugins-bootcamp

  1. for (Edge e : edges) {
  2.   for (Edge f : edges) {
  3.     if (e != f && graph.contains(e) && graph.contains(f) && !e.isSelfLoop() && !f.isSelfLoop()) {
  4.       Node s1 = e.getSource();
  5.       Node t1 = e.getTarget();
  6.       Node s2 = f.getSource();
  7.       Node t2 = f.getTarget();
  8.       double s1x = s1.x();
  9.       double s1y = s1.y();

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

  1. if (edge != null && (edge.getEdge().getStoreId() == -1 || (isView && !graph.contains(edge.getEdge())))) {
  2.     int sourceId = edge.getEdge().getSource().getStoreId();
  3.     int targetId = edge.getEdge().getTarget().getStoreId();
  4.     NodeModel sourceModel = sourceId == -1 ? null : nodes[sourceId];
  5.     NodeModel targetModel = targetId == -1 ? null : nodes[targetId];
  6. float maxWeight = Float.MIN_VALUE;
  7. for (Edge edge : graph.getEdges()) {
  8.   int id = edge.getStoreId();
  9.   EdgeModel model;
  10.   if (id >= edges.length || edges[id] == null) {
  11.     growEdges(id);
  12.     NodeModel sourceModel = nodes[edge.getSource().getStoreId()];
  13.     NodeModel targetModel = nodes[edge.getTarget().getStoreId()];
  14.     model = edgeModeler.initModel(edge, sourceModel, targetModel);
  15.     sourceModel.addEdge(model);
  16.     model = edges[id];
  17.   float w = (float) edge.getWeight(graphView);
  18.   model.setWeight(w);
  19.   minWeight = Math.min(w, minWeight);

代码示例来源：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/desktop-datalab

  1. @Override
  2.   public Object getValueFor(Edge edge) {
  3.     if (showEdgesNodesLabels) {
  4.       return edge.getSource().getId() + " - " + edge.getSource().getLabel();
  5.     } else {
  6.       return edge.getSource().getId();
  7.     }
  8.   }
  9. };

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

  1. Node node = edge.getSource();
  2. float x = node.x();
  3. float y = node.y();
  4.   float g;
  5.   float b;
  6.   float a = edge.alpha();
  7.   if (vizModel.isEdgeHasUniColor()) {
  8.     float[] uni = vizModel.getEdgeUniColor();
  9.     a = uni[3];
  10.   } else if (a == 0f) {
  11.     Node source = edge.getSource();
  12.     r = source.r();
  13.     g = source.g();
  14.     a = source.alpha();
  15.   } else {
  16.     g = edge.g();
  17.     b = edge.b();
  18.     r = edge.r();
  19.     a = edge.alpha();
  20.     r = edge.r();
  21.     g = edge.g();
  22.     b = edge.b();
  23.     if (edge.alpha() == 0f) {
  24.       Node source = edge.getSource();

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

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

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

  1. @Override
  2.   public Object getValueFor(Edge edge) {
  3.     if (showEdgesNodesLabels) {
  4.       return edge.getTarget().getId() + " - " + edge.getTarget().getLabel();
  5.     } else {
  6.       return edge.getTarget().getId();
  7.     }
  8.   }
  9. };

内容来源于网络，如有侵权，请联系作者删除！

Edge

相关文章

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多
    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com