Graph algorithms optimisations?
The group you are posting to is a
Usenet group . Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
From:
Benoît Lafontaine <joel1... @gmail.com>
Date: Mon, 1 Oct 2012 03:41:40 -0700 (PDT)
Local: Mon, Oct 1 2012 6:41 am
Subject: Graph algorithms optimisations?
What kind of optimisations does neo4j implements on graph algorithms (A*, dijkstra, ...) ?
You must
Sign in before you can post messages.
You do not have the permission required to post.
From:
Eugeny Kozhanov <ving... @gmail.com>
Date: Mon, 1 Oct 2012 03:54:00 -0700 (PDT)
Subject: Re: Graph algorithms optimisations?
You must
Sign in before you can post messages.
You do not have the permission required to post.
From:
Eugeny Kozhanov <ving... @gmail.com>
Date: Mon, 1 Oct 2012 03:54:55 -0700 (PDT)
Local: Mon, Oct 1 2012 6:54 am
Subject: Re: Graph algorithms optimisations?
Can you write some words about you task?
On Monday, October 1, 2012 2:54:00 PM UTC+4, Eugeny Kozhanov wrote:
> A*, Dijkstra, shortest path by relationship count...
> See http://api.neo4j.org/current/org/neo4j/graphalgo/GraphAlgoFactory.html
> On Monday, October 1, 2012 2:41:40 PM UTC+4, Benoît Lafontaine wrote:
>> What kind of optimisations does neo4j implements on graph algorithms (A*, >> dijkstra, ...) ?
You must
Sign in before you can post messages.
You do not have the permission required to post.
From:
Benoît Lafontaine <joel1... @gmail.com>
Date: Mon, 1 Oct 2012 05:50:39 -0700 (PDT)
Local: Mon, Oct 1 2012 8:50 am
Subject: Re: Graph algorithms optimisations?
Thank for the links, I've already read a lot of the API and sources.
I'm currently working with a client to explain why neo4j might be good for him. And a part of this includes to explain how neo4j achieve great performances and how this solution has already improve some APIs or algorithms and so.
Regards
On Monday, October 1, 2012 12:54:55 PM UTC+2, Eugeny Kozhanov wrote:
> Can you write some words about you task?
> On Monday, October 1, 2012 2:54:00 PM UTC+4, Eugeny Kozhanov wrote:
>> A*, Dijkstra, shortest path by relationship count...
>> See >> http://api.neo4j.org/current/org/neo4j/graphalgo/GraphAlgoFactory.html
>> On Monday, October 1, 2012 2:41:40 PM UTC+4, Benoît Lafontaine wrote:
>>> What kind of optimisations does neo4j implements on graph algorithms >>> (A*, dijkstra, ...) ?
You must
Sign in before you can post messages.
You do not have the permission required to post.