News

A PriorityQueue is a list that always keeps its items sorted based on some rule, like smallest to largest. So, when you take an item out, you always get the one with the highest (or lowest) priority.
We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We also show that our bound can be better than Lovász theta number and Haemers minimum rank bound.
A 3D Graphing Calculator App made entirely in Java, using the game-engine jMonkeyEngine.