This might help you:
https://github.com/besil/Neo4jSNA https://github.com/besil/Neo4jSNA
Michael
Am 12.03.2015 um 11:46 schrieb Mohana Krishna, IIT Bombay, India
mohana...@gmail.com:
I have a graph with nodes representing persons and edges representing their
associations. I wish to find
Hi Mohana,
Your question is vague, hence no one is able to respond.
Please help us understand your use case by giving examples and telling us
what you hope to achieve.
Cheers.
-- Thanks and Regards
Mahesh Lal
On 12 March 2015 at 14:24, Mohana Krishna, IIT Bombay, India
Someone please respond. Thanks.
--
You received this message because you are subscribed to the Google Groups
Neo4j group.
To unsubscribe from this group and stop receiving emails from it, send an email
to neo4j+unsubscr...@googlegroups.com.
For more options, visit
I have a graph with nodes representing persons and edges representing their
associations. I wish to find all maximally connected sub-graphs (maximal
cliques) - which represent the maximal group of persons such that each
person in the group knows everyone else and if we add any more nodes the
Can someone please tell if there is a way to formulate query so that all
maximal cliques in the graph represented in Neo4j are obtained? (Direct
query (if any) or composite query).
Thanks in advance.
--
You received this message because you are subscribed to the Google Groups
Neo4j group.
