code: public static <T extends Comparable<? super T>> @NonNull List<T> orderedTopologicalSort(final @NonNull Graph<T> graph) {
      return topologicalSort(graph, SortType.comparable());
    }
docs: Sorts a directed acyclic graph into a list.
  
  <p>The particular order of elements without prerequisites is determined by the natural order.</p>
  
  @param graph the graph to be sorted
  @param <T> the node type, implementing {@link Comparable}
  @return the sorted list
  @throws CyclePresentException if the graph has cycles
  @throws IllegalArgumentException if the graph is not directed or allows self loops