[Neo4j] Neo4j: Now or Later

if our app is a success? The data structure we want a graph for is a Directed Acyclic Graph). We can implement the basics fairly easily in postgres, but recursive lookups will be a pain to write and costly to run. Thanks, Ben Sand ___ Neo4j mailing list

[Neo4j] Reference Implementation for Sugiyama Graph Layout

At the front end of our project we're using Prefuse Flare, and wish to display a DAG using the Sugiyama layout, which isn't currently implemented in Flare. The Sugiyama layout algorithm is a way to display a graph hierarchically in a clear fashion that minimises edge crossings without being too

Re: [Neo4j] Reference Implementation for Sugiyama Graph Layout

://www.linkedin.com/in/neubauer Twitter      http://twitter.com/peterneubauer http://www.neo4j.org               - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Tue, Dec 14, 2010 at 8:04 AM, Ben Sand b...@bensand.com wrote

Re: [Neo4j] Implementing disambiguation algorithms in Neo4j

I was working on a project that used matching algorithms a while back. What you have is an n-dimensional matching problem. I can't remember specifically what the last project were using, but this and the linked algos may be what you're looking for: