问如何让列表像队列一样工作，同时仍然返回值？

EN

private static List<Job> topologicalSortBFS(final List<Job> jobs) //Kahn's
    {
        final List<Job> sorted = new ArrayList<>(jobs.size());
        final Map<Job, Integer> inCount = new HashMap<>(jobs.size());
        final Queue<Job> queue = new ArrayDeque<>();

        for (final Job j : jobs)
        {
            /* Associate every node with the amount of nodes it requires. */
            final int in = j.inbound.size();
            inCount.put(j, in);
            /* If the node requires nothing, then add to queue and sorted list. */
            if (in == 0)
            {
                sorted.add(j);
                queue.add(j);
            }
        }

        while (!queue.isEmpty())
        {
            final Job current = queue.poll(); // poll = pop
            for (final Job neighbor : current.outbound)
            {
                /* Remove an outgoing connection without modifying the node. */
                final int updatedIncount = inCount.get(neighbor) - 1;
                inCount.put(neighbor, updatedIncount);
                /* If node is now considered a leaf, its requirements were met. */
                if (updatedIncount == 0)
                {
                    sorted.add(neighbor);
                    queue.add(neighbor);
                }
            }
        }       
        return sorted;
    }