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.