Fast component enumeration in graphs with implicit edges
First Claim
1. A method for enumerating a graph, the method comprising:
- creating, by a processor, a graph for a set of data records, each data record represented as a vertex in the graph, each data record comprising a unique index and one or more data elements;
creating a key for each unique value of each data element represented by the vertices in the graph, each key representing an implicit edge in the graph, wherein two vertices sharing a key implicitly share an edge;
partitioning the vertices in the graph into a plurality of subsets, each subset comprising a list of vertices, wherein vertices in a list share a same key; and
for each list of vertices;
determining a vertex with a least valued index in the list based on the vertices in the list and vertices pointed to by the vertices in the list; and
associating all vertices in a list of vertices with a vertex having the least valued index.
1 Assignment
0 Petitions
Accused Products
Abstract
A method and system for graphical enumeration. The method includes creating an ordered set of vertices for a graph such that each vertex is associated with a corresponding index, and wherein each vertex in the ordered set of vertices includes information. A plurality of keys is created for defining the information. A plurality of lists of vertices is created, each of which is associated with a corresponding key such that vertices in a corresponding list include information associated with the corresponding key. For a first list of vertices, a least valued index is determined from a group of associated vertices based on vertices in the first list and vertices pointed to by the vertices in the first list. Also, all associated vertices are pointed to a root vertex associated with the least valued index.
51 Citations
20 Claims
-
1. A method for enumerating a graph, the method comprising:
-
creating, by a processor, a graph for a set of data records, each data record represented as a vertex in the graph, each data record comprising a unique index and one or more data elements; creating a key for each unique value of each data element represented by the vertices in the graph, each key representing an implicit edge in the graph, wherein two vertices sharing a key implicitly share an edge; partitioning the vertices in the graph into a plurality of subsets, each subset comprising a list of vertices, wherein vertices in a list share a same key; and for each list of vertices; determining a vertex with a least valued index in the list based on the vertices in the list and vertices pointed to by the vertices in the list; and associating all vertices in a list of vertices with a vertex having the least valued index. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A non-transitory computer-readable storage medium storing executable computer program instructions for providing electronic money transfer, the computer program instructions comprising instructions for:
-
creating, by a processor, a graph for a set of data records, each data record represented as a vertex in the graph, each data record comprising a unique index and one or more data elements; creating a key for each unique value of each data element represented by the vertices in the graph, each key representing an implicit edge in the graph, wherein two vertices sharing a key implicitly share an edge; partitioning the vertices in the graph into a plurality of subsets, each subset comprising a list of vertices, wherein vertices in a list share a same key; and for each list of vertices; determining a vertex with a least valued index in the list based on the vertices in the list and vertices pointed to by the vertices in the list; and associating all vertices in a list of vertices with a vertex having the least valued index. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
Specification