Grph: High Performance Graph Library for Java

Thanks for your comments. You are 100% right. However I'm now working on a replacement software

Dear Akanksha, If you plan to use Grph in order to deal with large graphs, you'd better off using

Hello, I'm trying to make a quick test of the BellmanFordAlgorithm with a simple directed graph

Hi. I am working on small project wich used graph algo. I decided to use Grph. I have small

Hello ! When I try to get a shortest path between two nodes, i get the following result : Code :

The recent migration to Fastutil allows better serialization. On Wednesday, August 12, 2015 at 10:11:

That's actually not a bug of Grph. This is the result of interpreting as double a set of bits

The source code of Toools is included in the file toools-xxx.jar. Best, Luc. On Thursday, January 8,

Hi, Sorry for the long delay. This clever change will be available in the next release. On Thursday,

Hi Josh, Such a release is already provided. It's the first link on the download page: http://www

Hello, the homepage seems to be very slow and the offered resources like documentation (http://www.

Solved. If someone runs into the same issue : make sure the Grph subclass has a default constructor.

Hi, thanks for sharing your work! I have two suggestions to your maven setup: The maven dependency

Hi, If you work with RDF graph in the context of web semantics, I suggest you to take a look at the

I'm sorry there is no implementation of such algorithm in Grph. However, it has subgraph matching

Hi Michael, Did you find a program for extracting the maximum common subgraph? Thanks,

Hi, Stats about vertices degrees are available through dedicated methods of the Grph class.

Hi, is there any support for muliple minimal vertex covers of hypergraph ? I was not able to find in

Hi Joshua, Grph is a datastructure. It uses GraphStream for rendering, but it in no away focuses on

Hi Andrew, Glad to know that Grph is useful to you. :) Best, Luc On Fri, Jul 3, 2015 at 8:30 AM, <

Unfortunately we don't have video presentations of Grph. On Thu, Jun 11, 2015 at 9:58 AM, <

On Monday, June 8, 2015 at 1:45:06 PM UTC-4, Luc Hogie wrote: > Hi Sushdir, > > > I'

Hi, Of course you can. I suggest you to take a look at the work of the "Wimmics" team at

Hi, I tried to compute all pairs shortest paths as follows: FloydWarshallAlgorithm alg = new

For sure we are! Any fruitful collaboration is highly welcome :) By the way, what is your research

Hello. Could you please upload grph-1.5.27-javadoc.jar grph-1.5.27-sources.jar to http://www.i3s.

Hi, I am trying to use GRPH to build a weighted graph having approximately 1M of nodes. The graph

In fact, I do not get the error with 538 vertices, but I do get it with 539. Any guesses?

Il giorno mercoledì 14 gennaio 2015 21:25:43 UTC+1, ivan.gu...@gmail.com ha scritto: > Hi all,

Hi, I'm planning to put the GITize the source before Xmas so that anyone can contribute. Thanks

I think the isMixed function is not correctly implemented: /** * Checks if this graph is mixed or not