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

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

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

Edge.isSelfLoop介绍

[英]Returns true if this edge is a self-loop.
[中]如果此边是自循环，则返回true。

代码示例

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

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

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

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

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

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

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

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

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

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

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

  1. @Override
  2. public boolean evaluate(Graph graph, Node node) {
  3.   EdgeIterable edgeIterable = graph.getEdges(node);
  4.   for (Edge e : edgeIterable) {
  5.     if (e.isSelfLoop()) {
  6.       edgeIterable.doBreak();
  7.       return true;
  8.     }
  9.   }
  10.   return false;
  11. }

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

  1. public EdgeModel initModel(Edge edge, NodeModel sourceModel, NodeModel targetModelImpl) {
  2.   EdgeModel edgeModel;
  3.   if (edge.isSelfLoop()) {
  4.     edgeModel = new SelfLoopModel(edge, sourceModel);
  5.   } else {
  6.     edgeModel = new Edge2dModel(edge, sourceModel, targetModelImpl);
  7.   }
  8.   return edgeModel;
  9. }

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

  1. void updateAutorithy(Graph graph, double[] newValues, double[] hubValues, boolean isDirected, Map<Node, Integer> indices) {
  2.   double norm = 0;
  3.   for (Node q : indices.keySet()) {
  4.     double auth = 0;
  5.     EdgeIterable edge_iter;
  6.     if (isDirected) {
  7.       edge_iter = ((DirectedGraph) graph).getInEdges(q);
  8.     } else {
  9.       edge_iter = graph.getEdges(q);
  10.     }
  11.     for (Edge edge : edge_iter) {
  12.       if (!edge.isSelfLoop()) {
  13.         Node p = graph.getOpposite(q, edge);
  14.         auth += hubValues[indices.get(p)];
  15.       }
  16.     }
  17.     newValues[indices.get(q)] = auth;
  18.     norm += auth * auth;
  19.     if (isCanceled) {
  20.       return;
  21.     }
  22.   }
  23.   norm = Math.sqrt(norm);
  24.   if (norm > 0) {
  25.     for (int i = 0; i < newValues.length; i++) {
  26.       newValues[i] = newValues[i] / norm;
  27.     }
  28.   }
  29. }

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

  1. void updateHub(Graph graph, double[] newValues, double[] authValues, boolean isDirected, Map<Node, Integer> indices) {
  2.   double norm = 0;
  3.   for (Node p : indices.keySet()) {
  4.     double hub = 0;
  5.     EdgeIterable edge_iter;
  6.     if (isDirected) {
  7.       edge_iter = ((DirectedGraph) graph).getOutEdges(p);
  8.     } else {
  9.       edge_iter = graph.getEdges(p);
  10.     }
  11.     for (Edge edge : edge_iter) {
  12.       if (!edge.isSelfLoop()) {
  13.         Node r = graph.getOpposite(p, edge);
  14.         hub += authValues[indices.get(r)];
  15.       }
  16.     }
  17.     newValues[indices.get(p)] = hub;
  18.     norm += hub * hub;
  19.     if (isCanceled) {
  20.       return;
  21.     }
  22.   }
  23.   norm = Math.sqrt(norm);
  24.   if (norm > 0) {
  25.     for (int i = 0; i < newValues.length; i++) {
  26.       newValues[i] = newValues[i] / norm;
  27.     }
  28.   }
  29. }

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

  1. @Override
  2. public void execute(GraphModel graphModel) {
  3.   Graph graph = graphModel.getGraphVisible();
  4.   selfLoopCount = 0;
  5.   totalEdgeCount = graph.getEdgeCount();
  6.   for (Edge e : graph.getEdges()) {
  7.     if (e.isSelfLoop()) {
  8.       selfLoopCount++;
  9.     }
  10.   }
  11. }

代码示例来源：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: org.gephi/statistics-plugin

  1. private void setInitialValues(Graph graph, Map<Node, Integer> indicies, double[] pagerankValues, double[] weights, boolean directed, boolean useWeights) {
  2.   final int N = graph.getNodeCount();
  3.   for (Node s : graph.getNodes()) {
  4.     final int index = indicies.get(s);
  5.     pagerankValues[index] = 1.0 / N;
  6.     if (useWeights) {
  7.       double sum = 0;
  8.       EdgeIterable eIter;
  9.       if (directed) {
  10.         eIter = ((DirectedGraph) graph).getOutEdges(s);
  11.       } else {
  12.         eIter = ((UndirectedGraph) graph).getEdges(s);
  13.       }
  14.       for (Edge edge : eIter) {
  15.         if(!edge.isSelfLoop()){
  16.           sum += edge.getWeight();
  17.         }
  18.       }
  19.       weights[index] = sum;
  20.     }
  21.   }
  22. }

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

  1. @Override
  2.   public void actionPerformed(ActionEvent e) {
  3.     //Get the current graph model
  4.     GraphController gc = Lookup.getDefault().lookup(GraphController.class);
  5.     GraphModel graphModel = gc.getGraphModel();
  7.     if (graphModel != null) {
  8.       //Remove self loops
  9.       int removed = 0;
  10.       Graph graph = graphModel.getGraph();
  11.       graph.writeLock();
  12.       for (Edge edge : graph.getEdges().toArray()) {
  13.         if (edge.isSelfLoop()) {
  14.           graph.removeEdge(edge);
  15.           removed++;
  16.         }
  17.       }
  18.       graph.writeUnlock();
  20.       //Notification message
  21.       NotifyDescriptor d = new NotifyDescriptor.Message(removed + " self-loop have been removed", NotifyDescriptor.INFORMATION_MESSAGE);
  22.       DialogDisplayer.getDefault().notify(d);
  23.     } else {
  24.       //Error message
  25.       NotifyDescriptor d = new NotifyDescriptor.Message("No active workspace", NotifyDescriptor.ERROR_MESSAGE);
  26.       DialogDisplayer.getDefault().notify(d);
  27.     }
  29.   }
  30. }

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

  1. private Map<Node, Set<Node>> calculateInNeighborsPerNode(Graph graph, boolean directed) {
  2.   Map<Node, Set<Node>> inNeighborsPerNode = new Object2ObjectOpenHashMap<>();
  3.   NodeIterable nodesIterable = graph.getNodes();
  4.   for (Node node : nodesIterable) {
  5.     Set<Node> nodeInNeighbors = new ObjectOpenHashSet<>();
  6.     EdgeIterable edgesIterable;
  7.     if (directed) {
  8.       edgesIterable = ((DirectedGraph) graph).getInEdges(node);
  9.     } else {
  10.       edgesIterable = graph.getEdges(node);
  11.     }
  12.     for (Edge edge : edgesIterable) {
  13.       if (!edge.isSelfLoop()) {
  14.         Node neighbor = graph.getOpposite(node, edge);
  15.         nodeInNeighbors.add(neighbor);
  16.       }
  17.       if (isCanceled) {
  18.         edgesIterable.doBreak();
  19.         break;
  20.       }
  21.     }
  22.     inNeighborsPerNode.put(node, nodeInNeighbors);
  23.     if (isCanceled) {
  24.       nodesIterable.doBreak();
  25.       break;
  26.     }
  27.   }
  28.   return inNeighborsPerNode;
  29. }

代码示例来源：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();

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

  1. } else {
  2.   for (Edge e : graph.getEdges(n)) {
  3.     totalWeight += (e.isSelfLoop() ? 2 : 1) * e.getWeight();

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

  1. if (!edge.isSelfLoop()) {
  2.   Node neighbor = graph.getOpposite(node, edge);
  3.   inWeightPerNeighbor.addTo(neighbor, edge.getWeight());

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

  1. (Color) targetItem.getData(NodeItem.COLOR));
  2. item.setData(EDGE_COLOR, color);
  3. if (edge.isSelfLoop()) {

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

Edge

相关文章

    查看更多

    热门标签

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

    最新文章

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