To reverse a data structure like a priority queue, use Collections.reverseOrder() comparator; to reverse a list, use Collections.reverse() which only works for lists. Graph coloring is a useful technique for solving graph problems.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
192 views
CS2040 CheatSheet
To reverse a data structure like a priority queue, use Collections.reverseOrder() comparator; to reverse a list, use Collections.reverse() which only works for lists. Graph coloring is a useful technique for solving graph problems.