Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
Graph algorithms optimisations?
There are currently too many topics in this group that display first. To make this topic appear first, remove this option from another topic.
There was an error processing your request. Please try again.
flag
  4 messages - Collapse all  -  Translate all to Translated (View all originals)
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:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Benoît Lafontaine  
View profile  
 More options Oct 1 2012, 6:41 am
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.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Eugeny Kozhanov  
View profile  
 More options Oct 1 2012, 6:54 am
From: Eugeny Kozhanov <ving...@gmail.com>
Date: Mon, 1 Oct 2012 03:54:00 -0700 (PDT)
Subject: Re: Graph algorithms optimisations?

A*, Dijkstra, shortest path by relationship count...
See http://api.neo4j.org/current/org/neo4j/graphalgo/GraphAlgoFactory.html


 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Eugeny Kozhanov  
View profile  
 More options Oct 1 2012, 6:54 am
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?


 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Benoît Lafontaine  
View profile  
 More options Oct 1 2012, 8:50 am
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


 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
End of messages
« Back to Discussions « Newer topic     Older topic »