finding all the edges between a set of vertices in a Connected graph
23 views
Skip to first unread message
Akhil
Aug 3, 2012, 12:25:33 PM8/3/12
to ne...@googlegroups.com
Is there a Cypher or gremlin query out there that can help me find the
maximal number of vertices and edges from a set of vertices that will
form a Fully Connected graph.
My idea for an approach was to find a spanning tree and then loop
through finding all the remaining edges for that set of vertices. The
number of vertices i am talking about is around 10,000 and two vertices
might have more than one edge between then.
maximal number of vertices and edges from a set of vertices that will
form a Fully Connected graph.
My idea for an approach was to find a spanning tree and then loop
through finding all the remaining edges for that set of vertices. The
number of vertices i am talking about is around 10,000 and two vertices
might have more than one edge between then.
Reply all
Reply to author
Forward
0 new messages