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

Edge.alpha介绍

暂无

代码示例

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

public Color getEdgeColor() {
  if (edge.alpha() == 0) {
    return null;//Not specific color for edge
  }
  return new Color(edge.r(), edge.g(), edge.b(), edge.alpha());
}

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

float g;
float b;
float a = edge.alpha();
if (vizModel.isEdgeHasUniColor()) {
  float[] uni = vizModel.getEdgeUniColor();
  b = edge.b();
  r = edge.r();
  a = edge.alpha();
  b = edge.b();
  if (edge.alpha() == 0f) {
    Node source = edge.getSource();
    r = source.r();

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

@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;
}

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

float g;
float b;
float a = edge.alpha();
if (a == 0f) {
  if (vizModel.isEdgeHasUniColor()) {
  b = edge.b();
  if (edge.alpha() == 0f) {
    Node node = sourceModel.isSelected() ? edge.getTarget() : edge.getSource();
    r = node.r();