User:Margusmartsepp/Contributions/Java/Utils.java: Difference between revisions

Content added Content deleted
No edit summary
No edit summary
Line 81: Line 81:
public <T> ArrayList<T> tSort(Map<T, ArrayList<T>> g) {
public <T> ArrayList<T> tSort(Map<T, ArrayList<T>> g) {
T n; // Current element.
T n; // Current element.
ArrayList<T> L = new ArrayList<T>(g.size()); // Answer.
ArrayList<T> L = /* Answer */
new ArrayList<T>(g.size());
HashSet<T> V = new HashSet<T>(); // Visited elements.
Queue<T> S = new LinkedBlockingDeque<T>(); // !Visited leaf nodes
java.util.HashSet<T> V = /* ! Visited elements */
new java.util.HashSet<T>();
java.util.Queue<T> S = /* ! Visited leaf nodes */
new java.util.concurrent.LinkedBlockingDeque<T>();


// Find leaf nodes.
// Find leaf nodes.
Line 125: Line 128:


/**
/**
*
* Creates a new {@code ArrayList} instance, containing integer sequence
* Creates a new {@code ArrayList} instance, containing integer sequence
* between form and to. Sequence can be negative.
* between form and to. Sequence can be negative.
Retrieved from "https://rosettacode.org/wiki/User:Margusmartsepp/Contributions/Java/Utils.java"