Graph algorithms optimisations?

34 views

Skip to first unread message

Benoît Lafontaine

unread,

Oct 1, 2012, 6:41:40 AM10/1/12

to ne...@googlegroups.com

What kind of optimisations does neo4j implements on graph algorithms (A*, dijkstra, ...) ?

Eugeny Kozhanov

unread,

Oct 1, 2012, 6:54:00 AM10/1/12

to ne...@googlegroups.com

A*, Dijkstra, shortest path by relationship count...

See http://api.neo4j.org/current/org/neo4j/graphalgo/GraphAlgoFactory.html

Eugeny Kozhanov

unread,

Oct 1, 2012, 6:54:55 AM10/1/12

to ne...@googlegroups.com

Can you write some words about you task?

Benoît Lafontaine

unread,

Oct 1, 2012, 8:50:39 AM10/1/12

to ne...@googlegroups.com

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.