Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
finding all the edges between a set of vertices in a Connected graph
There are currently too many topics in this group that display first. To make this topic appear first, remove this option from another topic.
There was an error processing your request. Please try again.
flag
  1 message - Collapse all  -  Translate all to Translated (View all originals)
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Akhil  
View profile  
 More options Aug 3 2012, 12:25 pm
From: Akhil <azk...@psu.edu>
Date: Fri, 03 Aug 2012 12:25:33 -0400
Local: Fri, Aug 3 2012 12:25 pm
Subject: finding all the edges between a set of vertices in a Connected graph
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.

 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
End of messages
« Back to Discussions « Newer topic     Older topic »