A new interface, extending the TreeModel interface, which describes the kind of data that can be drawn by a TreeTable.
标签： interface extending TreeModel describes
上传时间： 2015-05-04
上传用户：fredguo
A base class for TreeTableModels. This class handles the list of listeners.
标签： class TreeTableModels listeners handles
上传时间： 2013-12-21
上传用户：cazjing
A base class for CellEditors. This class handlers the list of listeners.
标签： class CellEditors listeners handlers
上传时间： 2013-12-08
上传用户：yyq123456789
A subclass of JTable, this class can render data from a TreeTableModel.
标签： TreeTableModel subclass JTable render
上传时间： 2015-05-04
上传用户：dongqiangqiang
An implementation of merge sort.
标签： implementation merge sort An
上传时间： 2015-05-04
上传用户：JasonC
A model of the local file system, implemented as a concrete subclass of AbstractTreeTableModel. This class implements the TreeTableModel interface.
标签： AbstractTreeTableModel implemented concrete subclass
上传时间： 2015-05-04
上传用户：彭玖华
Determine Status of Printer with Explanation.
标签： Explanation Determine Printer Status
上传时间： 2015-05-05
上传用户：CSUSheep
computing singular value of matrix by iteration
标签： computing iteration singular matrix
上传时间： 2014-01-16
上传用户：lx9076
Deleting a node of RB-Tree without recurrence
标签： recurrence Deleting RB-Tree without
上传时间： 2015-05-05
上传用户：yuzsu
For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics: descent. Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations. heuristics: Simulated annealing. Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations. heuristics: based on Simulated Annealing. Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations.
标签： the representation incomplete methods
上传时间： 2015-05-05
上传用户：1159797854
