Java GraphvizNode.getId方法代码示例

本文整理汇总了Java中com.google.javascript.jscomp.graph.GraphvizGraph.GraphvizNode.getId方法的典型用法代码示例。如果您正苦于以下问题：Java GraphvizNode.getId方法的具体用法？Java GraphvizNode.getId怎么用？Java GraphvizNode.getId使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类com.google.javascript.jscomp.graph.GraphvizGraph.GraphvizNode的用法示例。

在下文中一共展示了GraphvizNode.getId方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: toDot

import com.google.javascript.jscomp.graph.GraphvizGraph.GraphvizNode; //导入方法依赖的package包/类
/**
 * Outputs a string in DOT format that presents the graph.
 * 
 * @param graph Input graph.
 * @return A string in Dot format that presents the graph.
 */
public static String toDot(GraphvizGraph graph) { 
  StringBuilder builder = new StringBuilder ();
  builder.append(graph.isDirected() ? "digraph" : "graph");
  builder.append(INDENT);
  builder.append(graph.getName());
  builder.append(" {\n");
  builder.append(INDENT);
  builder.append("node [color=lightblue2, style=filled];\n");

  final String edgeSymbol = graph.isDirected() ? ARROW : LINE;
  
  List<GraphvizNode> nodes = graph.getGraphvizNodes();
  
  String[] nodeNames = new String[nodes.size()];
  
  for (int i = 0; i < nodeNames.length; i++) {
    GraphvizNode gNode = nodes.get(i);
    nodeNames[i] = gNode.getId() + " [label=\"" + gNode.getLabel() + 
        "\" color=\"" + gNode.getColor() + "\"]";
  }
  
  // We sort the nodes so we get a deterministic output every time regardless
  // of the implementation of the graph data structure.
  Arrays.sort(nodeNames);
  
  for (String nodeName : nodeNames) {
    builder.append(INDENT);
    builder.append(nodeName);
    builder.append(";\n");
  }

  List<GraphvizEdge> edges = graph.getGraphvizEdges();
  
  String[] edgeNames = new String[edges.size()];
  
  for (int i = 0; i < edgeNames.length; i++) {
    GraphvizEdge edge = edges.get(i);
    edgeNames[i] = edge.getNode1Id() + edgeSymbol + edge.getNode2Id();
  }
  
  // Again, we sort the edges as well.
  Arrays.sort(edgeNames);
  
  for (String edgeName : edgeNames) {
    builder.append(INDENT);
    builder.append(edgeName);
    builder.append(";\n");
  }

  builder.append("}\n");
  return builder.toString();
}

开发者ID:andyjko，项目名称:feedlack，代码行数:59，代码来源:DotFormatter.java

示例2: toDot

import com.google.javascript.jscomp.graph.GraphvizGraph.GraphvizNode; //导入方法依赖的package包/类
/**
 * Outputs a string in DOT format that presents the graph.
 *
 * @param graph Input graph.
 * @return A string in Dot format that presents the graph.
 */
public static String toDot(GraphvizGraph graph) {
  StringBuilder builder = new StringBuilder ();
  builder.append(graph.isDirected() ? "digraph" : "graph");
  builder.append(INDENT);
  builder.append(graph.getName());
  builder.append(" {\n");
  builder.append(INDENT);
  builder.append("node [color=lightblue2, style=filled];\n");

  final String edgeSymbol = graph.isDirected() ? ARROW : LINE;

  List<GraphvizNode> nodes = graph.getGraphvizNodes();

  String[] nodeNames = new String[nodes.size()];

  for (int i = 0; i < nodeNames.length; i++) {
    GraphvizNode gNode = nodes.get(i);
    nodeNames[i] = gNode.getId() + " [label=\"" + gNode.getLabel() +
        "\" color=\"" + gNode.getColor() + "\"]";
  }

  // We sort the nodes so we get a deterministic output every time regardless
  // of the implementation of the graph data structure.
  Arrays.sort(nodeNames);

  for (String nodeName : nodeNames) {
    builder.append(INDENT);
    builder.append(nodeName);
    builder.append(";\n");
  }

  List<GraphvizEdge> edges = graph.getGraphvizEdges();

  String[] edgeNames = new String[edges.size()];

  for (int i = 0; i < edgeNames.length; i++) {
    GraphvizEdge edge = edges.get(i);
    edgeNames[i] = edge.getNode1Id() + edgeSymbol + edge.getNode2Id();
  }

  // Again, we sort the edges as well.
  Arrays.sort(edgeNames);

  for (String edgeName : edgeNames) {
    builder.append(INDENT);
    builder.append(edgeName);
    builder.append(";\n");
  }

  builder.append("}\n");
  return builder.toString();
}

开发者ID:ehsan，项目名称:js-symbolic-executor，代码行数:59，代码来源:DotFormatter.java

示例3: toDot

import com.google.javascript.jscomp.graph.GraphvizGraph.GraphvizNode; //导入方法依赖的package包/类
/**
 * Outputs a string in DOT format that presents the graph.
 *
 * @param graph Input graph.
 * @return A string in Dot format that presents the graph.
 */
public static String toDot(GraphvizGraph graph) {
  StringBuilder builder = new StringBuilder();
  builder.append(graph.isDirected() ? "digraph" : "graph");
  builder.append(INDENT);
  builder.append(graph.getName());
  builder.append(" {\n");
  builder.append(INDENT);
  builder.append("node [color=lightblue2, style=filled];\n");

  final String edgeSymbol = graph.isDirected() ? ARROW : LINE;

  List<GraphvizNode> nodes = graph.getGraphvizNodes();

  String[] nodeNames = new String[nodes.size()];

  for (int i = 0; i < nodeNames.length; i++) {
    GraphvizNode gNode = nodes.get(i);
    nodeNames[i] =
        gNode.getId()
            + " [label=\""
            + gNode.getLabel()
            + "\" color=\""
            + gNode.getColor()
            + "\"]";
  }

  // We sort the nodes so we get a deterministic output every time regardless
  // of the implementation of the graph data structure.
  Arrays.sort(nodeNames);

  for (String nodeName : nodeNames) {
    builder.append(INDENT);
    builder.append(nodeName);
    builder.append(";\n");
  }

  List<GraphvizEdge> edges = graph.getGraphvizEdges();

  String[] edgeNames = new String[edges.size()];

  for (int i = 0; i < edgeNames.length; i++) {
    GraphvizEdge edge = edges.get(i);
    edgeNames[i] = edge.getNode1Id() + edgeSymbol + edge.getNode2Id();
  }

  // Again, we sort the edges as well.
  Arrays.sort(edgeNames);

  for (String edgeName : edgeNames) {
    builder.append(INDENT);
    builder.append(edgeName);
    builder.append(";\n");
  }

  builder.append("}\n");
  return builder.toString();
}

开发者ID:google，项目名称:closure-compiler，代码行数:64，代码来源:DotFormatter.java

注：本文中的com.google.javascript.jscomp.graph.GraphvizGraph.GraphvizNode.getId方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。