Class | Description |
---|---|
HittingSets |
This class implements a collection of hitting sets.
|
HittingSetsMain | |
Knapsack01DynamicAllSolutions | |
Knapsack01DynamicOneSolution |
Compilation: javac Knapsack.java
Execution: java Knapsack N W
Generates an instance of the 0/1 knapsack problem with N items
and maximum weight W and solves it in time and space proportional
to N * W using dynamic programming.
|
Partition | |
PartitionWithDuplicates | |
Permutation | |
Permutations<E> |
http://code.google.com/p/google-collections/
Apache License 2.0
The Permutations class provides an iteration of all permutations of an list
of objects.
|