Apply review feedback: improve ChronologicalGraphPath Javadoc

Author: vpaturet

application/src/main/java/org/opentripplanner/routing/graphfinder/ChronologicalGraphPath.java

@@ -14,9 +14,11 @@
  * This utility encapsulates the direction-dependent ordering: for depart-after searches the chain
  * yields edges in reverse chronological order (newest first), while for arriveBy searches the chain
  * already yields edges in chronological order.
+ * <p>
  * Implementation note: an earlier design relied on {@link org.opentripplanner.astar.model.GraphPath}
- * to extract the list of edges in chronological order / reverse chronological order.
- * The current implementation is optimized for reducing memory allocation.
+ * which allocates a {@code LinkedList<State>} and, for depart-after searches, a full reversed copy
+ * of the state chain via {@code State.reverse()}. This implementation avoids both by collecting
+ * only the edges into a single {@code ArrayList} and reversing it in place.
  */
 class ChronologicalGraphPath {