Method Detail

• sort

  public static <T> List<T> sort(Collection<T> vertices,
                 EdgeRelation<? super T> edgeRelation)

  Apply topological ordering to a given collection.

  Type Parameters:

  T - the vertex type

  Parameters:

  vertices - the vertices of the directed acyclic graph

  edgeRelation - the relation defining the edges of the graph

  Returns:

  the topologically sorted list of vertices, where the vertices with no incoming edges come first