add line break

google · Jun 26, 2020 · d94b214 · d94b214
1 parent 8c3b9dd
commit d94b214
Showing 1 changed file with 6 additions and 2 deletions.
diff --git a/core/src/main/java/com/google/mu/util/graph/GraphWalker.java b/core/src/main/java/com/google/mu/util/graph/GraphWalker.java
@@ -115,7 +115,9 @@ public final Optional<Stream<N>> detectCycleFrom(Iterable<? extends N> startNode
 
   /**
    * Fully traverses the graph by starting from {@code startNodes}, and returns an immutable list of
-   * nodes in topological order. Unlike the other {@code Walker} utilities, this method is not lazy:
+   * nodes in topological order.
+   *
+   * <p>Unlike the other {@code Walker} utilities, this method is not lazy:
    * it has to traverse the entire graph in order to figure out the topological order.
    *
    * @param startNodes the entry point nodes to start traversing the graph.
@@ -128,7 +130,9 @@ public final Optional<Stream<N>> detectCycleFrom(Iterable<? extends N> startNode
 
   /**
    * Fully traverses the graph by starting from {@code startNodes}, and returns an immutable list of
-   * nodes in topological order. Unlike the other {@code Walker} utilities, this method is not lazy:
+   * nodes in topological order.
+   *
+   * <p>Unlike the other {@code Walker} utilities, this method is not lazy:
    * it has to traverse the entire graph in order to figure out the topological order.
    *
    * @param startNodes the entry point nodes to start traversing the graph.