the grapes of wrath
cannery row

the grapes of wrath
cannery row

the grapes of wrath
cannery row

the grapes of wrath
cannery row

the grapes of wrath
cannery row

the grapes of wrath
cannery row

	"golfing_man":                          "\U0001f3cc\ufe0f\u200d\u2642\ufe0f",
	"golfing_woman":                        "\U0001f3cc\ufe0f\u200d\u2640\ufe0f",
	"gorilla":                              "\U0001f98d",
	"grapes":                               "\U0001f347",
	"greece":                               "\U0001f1ec\U0001f1f7",
	"green_apple":                          "\U0001f34f",
	"green_book":                           "\U0001f4d7",

   */
  public static <N> Graph<N> transpose(Graph<N> graph) {
    if (!graph.isDirected()) {
      return graph; // the transpose of an undirected graph is an identical graph
    }

    if (graph instanceof TransposedGraph) {
      return ((TransposedGraph<N>) graph).graph;
    }

    return new TransposedGraph<>(graph);
  }

  /**

// NodePtrSet is a collection of nodes. Trimming a graph or tree requires a set
// of objects which uniquely identify the nodes to keep. In a graph, NodeInfo
// works as a unique identifier; however, in a tree multiple nodes may share
// identical NodeInfos. A *Node does uniquely identify a node so we can use that
// instead. Though a *Node also uniquely identifies a node in a graph,
// currently, during trimming, graphs are rebuilt from scratch using only the

   */
  public static <N> Graph<N> transpose(Graph<N> graph) {
    if (!graph.isDirected()) {
      return graph; // the transpose of an undirected graph is an identical graph
    }

    if (graph instanceof TransposedGraph) {
      return ((TransposedGraph<N>) graph).graph;
    }

    return new TransposedGraph<>(graph);
  }

  /**