Method adjacentNodesString

output/java_guava/1.4.17/Graphs.java:417–427

Returns a String of the adjacent node relationships for graph.

(final Graph<N> graph)

  private static <N> String adjacentNodesString(final Graph<N> graph) {
    checkNotNull(graph, "graph");
    List<String> adjacencies = new ArrayList<String>();
    // This will list each undirected edge twice (once as [n1, n2] and once as [n2, n1]); this is OK
    for (N node : graph.nodes()) {
      for (N successor : graph.successors(node)) {
        adjacencies.add(String.format(graph.isDirected() ? DIRECTED_FORMAT : UNDIRECTED_FORMAT, node, successor));
      }
    }
    return String.format("{%s}", Joiner.on(", ").join(adjacencies));
  }

  /**
   * Returns a map that is a live view of {@code graph}, with nodes as keys