sorted by: recent | see : popular

Content Tagged with algorithms + Java

* directed and undirected graphs. * graphs with weighted / unweighted / labeled or any user-defined edges. * various edge multiplicity options, including: simple-graphs, multigraphs, pseudographs. * unmodifiable graphs - allow modules to provide "read-only" access to internal graphs. * listenable graphs - allow external listeners to track modification events. * subgraphs graphs that are auto-updating subgraph views on other graphs. * all compositions of above graphs.

A rope is a high performance replacement for Strings. The datastructure, described in detail in "Ropes: an Alternative to Strings", provides asymptotically better performance than both String and StringBuffer for common string modifications like prepend

a collection of machine learning algorithms for data mining tasks. The algorithms can either be applied directly to a dataset or called from your own Java code.