Gen,
I guess there is nothing out of the box right now, but you could get
inspiration from http://jung.sourceforge.net/doc/api/index.html,
especially
http://jung.sourceforge.net/doc/api/edu/uci/ics/jung/algorithms/flows/EdmondsKarpMaxFlow.html
and implement one or just use it on a toy graph to
Hey,
If you want to play with JUNG over Neo4j, you can do it via TinkerPop.
Graph g = new Neo4jGraph(/tmp/neo4j);
GraphJung jung = new GraphJung(g);
That GraphJung object is a implementation of the JUNG Interfaces and can be
processed by the JUNG algorithms package.
On Tue, Aug 30, 2011 at 1:20 PM, Benjamin Gustafsson
benjamingustafs...@gmail.com wrote:
If an item can only be had by one user at a time, then the display,
or
visible_to, relationship could originate from the item.
9. owesItemTo -relation between User, Item, User/Group. (A
3 matches
Mail list logo