I did something similar by storing my query as a property withing a new node and connecting the node with the result nodes. I also store additional contextual information in the connecting edges.
Akhil On 11/30/2011 3:14 PM, Paul A. Jackson wrote: > Suppose I have a graph and I run a community detection algorithm on it. These > algorithms usually return a dendrogram, representing the division of the > graph from whole network to individual nodes. Does anyone have experience > persisting these results? I suppose it could be stored as a separate graph, > but is there a way to store it within the graph itself? > > Paul Jackson, Principal Software Engineer > Pitney Bowes Business Insight > 4200 Parliament Place | Suite 600 | Lanham, MD 20706-1844 USA > O: 301.918.0850 | M: 703.862.0120 | www.pb.com > paul.jack...@pb.com > > Every connection is a new opportunity(tm) > > > > Please consider the environment before printing or forwarding this email. If > you do print this email, please recycle the paper. > > This email message may contain confidential, proprietary and/or privileged > information. It is intended only for the use of the intended recipient(s). If > you have received it in error, please immediately advise the sender by reply > email and then delete this email message. Any disclosure, copying, > distribution or use of the information contained in this email message to or > by anyone other than the intended recipient is strictly prohibited. Any views > expressed in this message are those of the individual sender, except where > the sender specifically states them to be the views of the Company. > > _______________________________________________ > Neo4j mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user