Version 0.5.1

Author: barakugav

.github/workflows/javadoc.yaml

@@ -38,8 +38,9 @@ jobs:
           mv 0.3.0 ${{ runner.temp }}/docs/
           mv 0.4.0 ${{ runner.temp }}/docs/
           mv 0.5.0 ${{ runner.temp }}/docs/
+          mv 0.5.1 ${{ runner.temp }}/docs/
           mv ${{ runner.temp }}/docs-snapshot/index.html ${{ runner.temp }}/docs-snapshot/index-main.html
-          mv ${{ runner.temp }}/docs-snapshot ${{ runner.temp }}/docs/0.5.1-snapshot
+          mv ${{ runner.temp }}/docs-snapshot ${{ runner.temp }}/docs/0.5.2-snapshot
 
       - name: Deploy to Documentation Branch
         uses: JamesIves/github-pages-deploy-action@v4

README.md

@@ -7,12 +7,15 @@
 
 # JGAlgo
 
-The <b>*J*</b>ava <b>*G*</b>raph <b>*Algo*</b>rithm library is a high-performance library for graph algorithms written in Java. It contains a wide collection of optimized algorithms and data structures for a range of problems on graphs. From calculating shortest paths and maximum flows to computing minimum spanning trees, maximum matchings, vertex covers, and minimum coloring.
+The <b>*J*</b>ava <b>*G*</b>raph <b>*Algo*</b>rithm library is a high-performance library for graph algorithms written in Java.
+It contains a wide collection of optimized algorithms and data structures for a range of problems on graphs.
+From calculating shortest paths and maximum flows to computing minimum spanning trees, maximum matchings, vertex covers, and minimum coloring.
 The library runs on Java 11 or higher, and it is installed using [Maven](https://central.sonatype.com/artifact/com.jgalgo/jgalgo).
 
-JGAlgo offer [unparalleled speed](https://github.com/barakugav/JGAlgo/actions/workflows/benchmarks.yaml) and efficiency by implementing algorithms with theoretically guaranteed running times using the most efficient underlying building blocks and data-structures. A few concrete reasons for the library performance are:
+JGAlgo offer [unparalleled speed](https://github.com/barakugav/JGAlgo/actions/workflows/benchmarks.yaml) and efficiency by implementing algorithms with theoretically guaranteed running times using the most efficient underlying building blocks and data-structures.
+A few concrete reasons for the library performance are:
 - All building blocks of the library are primitives, rather than Objects
-- The underlying [Graph](https://barakugav.github.io/JGAlgo/0.5.0/com/jgalgo/graph/Graph.html) implementations and algorithms do not use costly hash maps, only plain primitive arrays, yielding faster query time, smaller memory footprint and better cache hit rate
+- The underlying [Graph](https://barakugav.github.io/JGAlgo/0.5.1/com/jgalgo/graph/Graph.html) implementations and algorithms do not use costly hash maps, only plain primitive arrays, yielding faster query time, smaller memory footprint and better cache hit rate
 - Extensive use of [fastutil](https://fastutil.di.unimi.it/) for all collections
 - Memory allocations are postpone and reused by algorithms objects
 
@@ -30,12 +33,15 @@ Add the following lines to your `pom.xml`:
 <dependency>
 	<groupId>com.jgalgo</groupId>
 	<artifactId>jgalgo-core</artifactId>
-	<version>0.5.0</version>
+	<version>0.5.1</version>
 </dependency>
 ```
 
 
-The most basic object in the library is a [Graph](https://barakugav.github.io/JGAlgo/0.5.0/com/jgalgo/graph/Graph.html). A graph consist of vertices and edges (directed or undirected) connecting between pairs of vertices, all represented by some hashable objects. Algorithms such as [shortest path algorithm](https://barakugav.github.io/JGAlgo/0.5.0/com/jgalgo/alg/shortestpath/ShortestPathSingleSource.html) accept a graph as an input and perform some computation on it. Here is a snippet creating an undirected graph representing the roads between cities in Germany, and computing the shortest path from a source city to all others with respect to a weight function:
+The most basic object in the library is a [Graph](https://barakugav.github.io/JGAlgo/0.5.1/com/jgalgo/graph/Graph.html).
+A graph consist of vertices and edges (directed or undirected) connecting between pairs of vertices, all represented by some hashable objects.
+Algorithms such as [shortest path algorithm](https://barakugav.github.io/JGAlgo/0.5.1/com/jgalgo/alg/shortestpath/ShortestPathSingleSource.html) accept a graph as an input and perform some computation on it.
+Here is a snippet creating an undirected graph representing the roads between cities in Germany, and computing the shortest path from a source city to all others with respect to a weight function:
 
 ```java
 /* Create an undirected graph with three vertices and edges between them */

jgalgo-adapt-guava/pom.xml

@@ -6,7 +6,7 @@
   <parent>
     <groupId>com.jgalgo</groupId>
     <artifactId>jgalgo</artifactId>
-    <version>0.5.1-SNAPSHOT</version>
+    <version>0.5.1</version>
   </parent>
   <artifactId>jgalgo-adapt-guava</artifactId>
   <name>JGAlgo - Guava Adapters</name>

jgalgo-adapt-jgrapht/pom.xml

@@ -6,7 +6,7 @@
   <parent>
     <groupId>com.jgalgo</groupId>
     <artifactId>jgalgo</artifactId>
-    <version>0.5.1-SNAPSHOT</version>
+    <version>0.5.1</version>
   </parent>
   <artifactId>jgalgo-adapt-jgrapht</artifactId>
   <name>JGAlgo - JGraphT Adapters</name>

jgalgo-bench/pom.xml

@@ -6,7 +6,7 @@
   <parent>
     <groupId>com.jgalgo</groupId>
     <artifactId>jgalgo</artifactId>
-    <version>0.5.1-SNAPSHOT</version>
+    <version>0.5.1</version>
   </parent>
   <artifactId>jgalgo-bench</artifactId>
   <name>JGAlgo - Benchmarks</name>

jgalgo-core/pom.xml

@@ -6,7 +6,7 @@
   <parent>
     <groupId>com.jgalgo</groupId>
     <artifactId>jgalgo</artifactId>
-    <version>0.5.1-SNAPSHOT</version>
+    <version>0.5.1</version>
   </parent>
   <artifactId>jgalgo-core</artifactId>
   <name>JGAlgo - Core</name>

jgalgo-example/pom.xml

@@ -6,7 +6,7 @@
   <parent>
     <groupId>com.jgalgo</groupId>
     <artifactId>jgalgo</artifactId>
-    <version>0.5.1-SNAPSHOT</version>
+    <version>0.5.1</version>
   </parent>
   <artifactId>jgalgo-example</artifactId>
   <name>JGAlgo - Examples</name>

jgalgo-io/pom.xml

@@ -6,7 +6,7 @@
   <parent>
     <groupId>com.jgalgo</groupId>
     <artifactId>jgalgo</artifactId>
-    <version>0.5.1-SNAPSHOT</version>
+    <version>0.5.1</version>
   </parent>
   <artifactId>jgalgo-io</artifactId>
   <name>JGAlgo - IO</name>

pom.xml

@@ -7,7 +7,7 @@
   <groupId>com.jgalgo</groupId>
   <artifactId>jgalgo</artifactId>
   <name>JGAlgo - Parent</name>
-  <version>0.5.1-SNAPSHOT</version>
+  <version>0.5.1</version>
   <packaging>pom</packaging>
   <url>https://www.jgalgo.com/</url>
   <description>A performant Java library for graph algorithms</description>
@@ -23,7 +23,7 @@
     <url>https://github.com/barakugav/JGAlgo.git</url>
     <connection>scm:git:git@github.com:barakugav/JGAlgo.git</connection>
     <developerConnection>scm:git:git@github.com:barakugav/JGAlgo.git</developerConnection>
-    <tag>jgalgo-0.5.0</tag>
+    <tag>v0.5.1</tag>
   </scm>
 
   <developers>
@@ -76,7 +76,6 @@
     <module>jgalgo-io</module>
     <module>jgalgo-adapt-guava</module>
     <module>jgalgo-adapt-jgrapht</module>
-    <module>jgalgo-bench</module>
     <module>jgalgo-example</module>
   </modules>