// Path: src/main/java/com/github/ferstl/depgraph/graph/Edge.java
// public final class Edge {
// 
//   private final String fromNodeId;
//   private final String toNodeId;
//   private final String name;
//   // Not part of equals()/hashCode()
//   private final boolean permanent;
// 
//   public Edge(String fromNodeId, String toNodeId, String name) {
//     this(fromNodeId, toNodeId, name, false);
//   }
// 
//   public Edge(String fromNodeId, String toNodeId, String name, boolean permanent) {
//     this.fromNodeId = fromNodeId;
//     this.toNodeId = toNodeId;
//     this.name = name;
//     this.permanent = permanent;
//   }
// 
//   public String getFromNodeId() {
//     return this.fromNodeId;
//   }
// 
//   public String getToNodeId() {
//     return this.toNodeId;
//   }
// 
//   public String getName() {
//     return this.name;
//   }
// 
//   public boolean isPermanent() {
//     return this.permanent;
//   }
// 
//   @Override
//   public boolean equals(Object o) {
//     if (this == o) { return true; }
//     if (!(o instanceof Edge)) { return false; }
// 
//     Edge edge = (Edge) o;
//     return Objects.equals(this.fromNodeId, edge.fromNodeId)
//         && Objects.equals(this.toNodeId, edge.toNodeId)
//         && Objects.equals(this.name, edge.name);
//   }
// 
//   @Override
//   public int hashCode() {
//     return Objects.hash(this.fromNodeId, this.toNodeId, this.name);
//   }
// 
//   @Override
//   public String toString() {
//     return this.fromNodeId + " -> " + this.toNodeId + " (" + this.name + ")";
//   }
// }
// 
// Path: src/main/java/com/github/ferstl/depgraph/graph/GraphFormatter.java
// public interface GraphFormatter {
// 
//   String format(String graphName, Collection<Node<?>> nodes, Collection<Edge> edges);
// }
// 
// Path: src/main/java/com/github/ferstl/depgraph/graph/Node.java
// public final class Node<T> {
// 
//   private final String nodeId;
//   private final String nodeName;
//   final T nodeObject;
// 
//   public Node(String nodeId, String nodeName, T nodeObject) {
//     this.nodeId = nodeId;
//     this.nodeName = nodeName;
//     this.nodeObject = nodeObject;
//   }
// 
//   public String getNodeId() {
//     return this.nodeId;
//   }
// 
//   public String getNodeName() {
//     return this.nodeName;
//   }
// 
//   @Override
//   public boolean equals(Object o) {
//     if (this == o) {
//       return true;
//     }
// 
//     if (!(o instanceof Node)) {
//       return false;
//     }
// 
//     Node<?> other = (Node<?>) o;
//     return Objects.equals(this.nodeId, other.nodeId)
//         && Objects.equals(this.nodeName, other.nodeName);
//   }
// 
//   @Override
//   public int hashCode() {
//     return Objects.hash(this.nodeId, this.nodeName);
//   }
// 
//   @Override
//   public String toString() {
//     return this.nodeId + "(" + this.nodeName + ")";
//   }
// }


import java.util.Collection;
import com.github.ferstl.depgraph.graph.Edge;
import com.github.ferstl.depgraph.graph.GraphFormatter;
import com.github.ferstl.depgraph.graph.Node;
import static org.apache.commons.lang3.StringUtils.isNotBlank;
/*
 * Copyright (c) 2014 - 2019 the original author or authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.github.ferstl.depgraph.graph.gml;



public class GmlGraphFormatter implements GraphFormatter {

  @Override
  public String format(String graphName, Collection<Node<?>> nodes, Collection<Edge> edges) {
    StringBuilder result = new StringBuilder();
    result.append("graph [\n");

    //output nodes
    for (Node<?> node : nodes) {
      result.append("node [\n");
      result.append("id \"").append(node.getNodeId()).append("\"\n");
      if (isNotBlank(node.getNodeName())) {
        result.append(node.getNodeName()).append("\n");
      }
      result.append("]\n\n");
    }

    //output edges
    for (Edge edge : edges) {
      result.append("edge [\n");
      result.append("source \"").append(edge.getFromNodeId()).append("\"\n");
      result.append("target \"").append(edge.getToNodeId()).append("\"\n");
// Path: src/main/java/com/github/ferstl/depgraph/graph/Edge.java
// public final class Edge {
// 
//   private final String fromNodeId;
//   private final String toNodeId;
//   private final String name;
//   // Not part of equals()/hashCode()
//   private final boolean permanent;
// 
//   public Edge(String fromNodeId, String toNodeId, String name) {
//     this(fromNodeId, toNodeId, name, false);
//   }
// 
//   public Edge(String fromNodeId, String toNodeId, String name, boolean permanent) {
//     this.fromNodeId = fromNodeId;
//     this.toNodeId = toNodeId;
//     this.name = name;
//     this.permanent = permanent;
//   }
// 
//   public String getFromNodeId() {
//     return this.fromNodeId;
//   }
// 
//   public String getToNodeId() {
//     return this.toNodeId;
//   }
// 
//   public String getName() {
//     return this.name;
//   }
// 
//   public boolean isPermanent() {
//     return this.permanent;
//   }
// 
//   @Override
//   public boolean equals(Object o) {
//     if (this == o) { return true; }
//     if (!(o instanceof Edge)) { return false; }
// 
//     Edge edge = (Edge) o;
//     return Objects.equals(this.fromNodeId, edge.fromNodeId)
//         && Objects.equals(this.toNodeId, edge.toNodeId)
//         && Objects.equals(this.name, edge.name);
//   }
// 
//   @Override
//   public int hashCode() {
//     return Objects.hash(this.fromNodeId, this.toNodeId, this.name);
//   }
// 
//   @Override
//   public String toString() {
//     return this.fromNodeId + " -> " + this.toNodeId + " (" + this.name + ")";
//   }
// }
// 
// Path: src/main/java/com/github/ferstl/depgraph/graph/GraphFormatter.java
// public interface GraphFormatter {
// 
//   String format(String graphName, Collection<Node<?>> nodes, Collection<Edge> edges);
// }
// 
// Path: src/main/java/com/github/ferstl/depgraph/graph/Node.java
// public final class Node<T> {
// 
//   private final String nodeId;
//   private final String nodeName;
//   final T nodeObject;
// 
//   public Node(String nodeId, String nodeName, T nodeObject) {
//     this.nodeId = nodeId;
//     this.nodeName = nodeName;
//     this.nodeObject = nodeObject;
//   }
// 
//   public String getNodeId() {
//     return this.nodeId;
//   }
// 
//   public String getNodeName() {
//     return this.nodeName;
//   }
// 
//   @Override
//   public boolean equals(Object o) {
//     if (this == o) {
//       return true;
//     }
// 
//     if (!(o instanceof Node)) {
//       return false;
//     }
// 
//     Node<?> other = (Node<?>) o;
//     return Objects.equals(this.nodeId, other.nodeId)
//         && Objects.equals(this.nodeName, other.nodeName);
//   }
// 
//   @Override
//   public int hashCode() {
//     return Objects.hash(this.nodeId, this.nodeName);
//   }
// 
//   @Override
//   public String toString() {
//     return this.nodeId + "(" + this.nodeName + ")";
//   }
// }


// Path: src/main/java/com/github/ferstl/depgraph/graph/gml/GmlGraphFormatter.java
import java.util.Collection;
import com.github.ferstl.depgraph.graph.Edge;
import com.github.ferstl.depgraph.graph.GraphFormatter;
import com.github.ferstl.depgraph.graph.Node;
import static org.apache.commons.lang3.StringUtils.isNotBlank;

/*
 * Copyright (c) 2014 - 2019 the original author or authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.github.ferstl.depgraph.graph.gml;



public class GmlGraphFormatter implements GraphFormatter {

  @Override
  public String format(String graphName, Collection<Node<?>> nodes, Collection<Edge> edges) {
    StringBuilder result = new StringBuilder();
    result.append("graph [\n");

    //output nodes
    for (Node<?> node : nodes) {
      result.append("node [\n");
      result.append("id \"").append(node.getNodeId()).append("\"\n");
      if (isNotBlank(node.getNodeName())) {
        result.append(node.getNodeName()).append("\n");
      }
      result.append("]\n\n");
    }

    //output edges
    for (Edge edge : edges) {
      result.append("edge [\n");
      result.append("source \"").append(edge.getFromNodeId()).append("\"\n");
      result.append("target \"").append(edge.getToNodeId()).append("\"\n");
      if (isNotBlank(edge.getName())) {