might be off topic, does anyone know of a network analysis (e.g. centrality, page rank, etc) in the JVM world that ideally also works with sparse adjacency matrixes?

I know there’s JUNG, but I was hoping for something more recent (NetworkX) like

https://github.com/jgrapht/jgrapht seems to where all the development is these days, I’ll take a look but still open to suggestions 🙂