News: What’s New and What’s Pending
What's New
- Simplification and unification of comparators and hashers behavior. Developers will only need to define them for values data type (no longer for GraphVertex, TreeNode, MapEntry)
- Complete refactoring of graphs section: support for weighted/unweighted, directed/undirected graphs
- Support for Depth-First-Search and Breadth-First-Search graph traversal
- Decoupling of benchmarking segment to a separate API
- Alignment of all components to a single interface-implementation principle
What's Pending
- Implement: backward and const iterators
- Implement: copy constructors for all structures
- Implement: method isCyclic() @ DirectedWeightedGraph & DirectedUnweightedGraph
- Implement: method unique() @ ArrayList/LinkedList/DoublyLinkedList
- Implement: method unique() @ LinkedHashMap
- Implement shortest path finder algorithm @ DirectedWeightedGraph & UndirectedWeightedGraph
- Refactor: sort has complexity 2N+logN (because changing tail requires full iteration) @ List
- Improve: comparators/hashers for custom data types
- Add support for AVL trees
- All: document everything
