Anonymous user
User:Margusmartsepp/Contributions/Java/Utils.java: Difference between revisions
User:Margusmartsepp/Contributions/Java/Utils.java (view source)
Revision as of 13:42, 11 November 2010
, 13 years agono edit summary
No edit summary |
No edit summary |
||
Line 81:
public <T> ArrayList<T> tSort(Map<T, ArrayList<T>> g) {
T n; // Current element.
ArrayList<T> L =
new ArrayList<T>(g.size());
new java.util.HashSet<T>();
java.util.Queue<T> S = /* ! Visited leaf nodes */
new java.util.concurrent.LinkedBlockingDeque<T>();
// Find leaf nodes.
Line 125 ⟶ 128:
/**
* Creates a new {@code ArrayList} instance, containing integer sequence
* between form and to. Sequence can be negative.
| |||