Releases: tdebatty/java-graphs
Releases · tdebatty/java-graphs
v0.28
- stronglyConnectedComponents now supports very large graphs (iterative instead of recursion)
- Uses EPSILON to compare similarities
v0.26
Added support for distributed processing (see spark-knn-graphs)
v0.25
Add support for StatisticsContainer in Graph.fastSearch, Graph.fastAdd and Graph.fastRemove
Allows to get the real number of computed similarities, restarts etc.
v0.24
Added a parameter "number of long jumps" to graph.fastAdd
v0.23
Added long jumps in fastSearch (to simulate small world graph)
v0.21
Added multi-threaded brute force graph builder
v0.20
Graph is now serializable (to be embedded in spark-knn-graphs)
v0.18
- OnlineGraph
- Multi-threaded exhaustive search
v0.17
- Improved graph search
- node now has getAttribute() and setAttribute()