A GraphBLAS implementation in pure Java

Analyzing connected data in forms of graphs is more relevant than ever. To allow users to write their own custom graph algorithms, graph computation models such as GraphBLAS have been developed. Unfortunately, the popular Java programming language was mostly neglected by existing GraphBLAS implementations so far. To overcome that issue, we present our implementation of essential GraphBLAS concepts in the Java programming language in this paper. For our purpose, we extended the linear algebra library Efficient Java Matrix Library (EJML). To show the benefits of our implementation, we compare us against existing graph algorithm libraries in Java using real world graphs and three graph algorithms.