Bug-5644: Fix checkstyle invocation for l2switch builds

[l2switch.git] / loopremover / implementation / src / main / java / org / opendaylight / l2switch / loopremover / topology / NetworkGraphService.java

diff --git a/loopremover/implementation/src/main/java/org/opendaylight/l2switch/loopremover/topology/NetworkGraphService.java b/loopremover/implementation/src/main/java/org/opendaylight/l2switch/loopremover/topology/NetworkGraphService.java
index 824d46e4f70b33e11f4d0bda12eb6ba550e72bf5..c6074de35d08a070b302f92996bd07c2441c0446 100644 (file)
--- a/loopremover/implementation/src/main/java/org/opendaylight/l2switch/loopremover/topology/NetworkGraphService.java
+++ b/loopremover/implementation/src/main/java/org/opendaylight/l2switch/loopremover/topology/NetworkGraphService.java
@@ -7,10 +7,10 @@
  */
 package org.opendaylight.l2switch.loopremover.topology;
 
-import org.opendaylight.yang.gen.v1.urn.tbd.params.xml.ns.yang.network.topology.rev131021.network.topology.topology.Link;
-
 import java.util.List;
 
+import org.opendaylight.yang.gen.v1.urn.tbd.params.xml.ns.yang.network.topology.rev131021.network.topology.topology.Link;
+
 /**
  * Service that allows to build a network graph using Topology links
  * {@link org.opendaylight.yang.gen.v1.urn.tbd.params.xml.ns.yang.network.topology.rev131021.network.topology.topology.Link}
@@ -18,43 +18,49 @@ import java.util.List;
  */
 public interface NetworkGraphService {
 
-  /**
-   * Adds links to existing graph or creates new graph with given links if graph was not initialized.
-   *
-   * @param links
-   */
-  public void addLinks(List<Link> links);
-
-  /**
-   * removes links from existing graph.
-   *
-   * @param links
-   */
-  public void removeLinks(List<Link> links);
-
-  /**
-   * returns a path between 2 nodes. Implementation should ideally return shortest path.
-   * @param sourceNodeId
-   * @param destinationNodeId
-   * @return
-   */
-  //public List<Link> getPath(NodeId sourceNodeId, NodeId destinationNodeId);
-
-  /**
-   * Forms MST(minimum spanning tree) from network graph and returns links that are not in MST.
-   *
-   * @return
-   */
-  public List<Link> getLinksInMst();
-
-  /**
-   * returns all the links in current network graph.
-   * @return
-   */
-  public List<Link> getAllLinks();
-
-  /**
-   * Clears the prebuilt graph, in case same service instance is required to process a new graph.
-   */
-  public void clear();
+    /**
+     * Adds links to existing graph or creates new graph with given links if
+     * graph was not initialized.
+     *
+     * @param links
+     */
+    public void addLinks(List<Link> links);
+
+    /**
+     * removes links from existing graph.
+     *
+     * @param links
+     */
+    public void removeLinks(List<Link> links);
+
+    /**
+     * returns a path between 2 nodes. Implementation should ideally return
+     * shortest path.
+     *
+     * @param sourceNodeId
+     * @param destinationNodeId
+     * @return
+     */
+    // public List<Link> getPath(NodeId sourceNodeId, NodeId destinationNodeId);
+
+    /**
+     * Forms MST(minimum spanning tree) from network graph and returns links
+     * that are not in MST.
+     *
+     * @return
+     */
+    public List<Link> getLinksInMst();
+
+    /**
+     * returns all the links in current network graph.
+     *
+     * @return
+     */
+    public List<Link> getAllLinks();
+
+    /**
+     * Clears the prebuilt graph, in case same service instance is required to
+     * process a new graph.
+     */
+    public void clear();
 }