Efficiently finding collaborations on a network

A computer-implemented method for finding a collaboration in a network, comprising:

• under control of one or more computer systems configured with executable instructions,
• receiving a request for collaboration information for an individual;
• in response to the request, analyzing collaboration data to determine relationships between a source node corresponding to the individual and at least one target node in a search tree, the search tree optimized by condensing multiple paths from a set of nodes at a first level to a same node at a second level to a single path to the same node;
• and
• providing the collaboration information for at least one collaboration when the at least one collaboration is a solution for locating one shortest path from the source node to the at least one target node in the search tree.

A computer-implemented method for finding collaborations in a network, comprising:

• under control of one or more computer systems configured with executable instructions,
• obtaining collaboration data for a plurality of nodes;
• receiving a request to locate at least one collaboration from a user;
• generating a first search tree starting with a source node, the first search tree including at least two levels and optimized by condensing first multiple paths from a first set of nodes at a first level of the first search tree to a first same graph node at a second level of the first search tree to a first single path to the first same graph node;
• and
• generating a second search tree starting with a target node, the second search tree including at least two levels and optimized by condensing second multiple paths from a second set of nodes at a third level of the second search tree to a second same graph node at a fourth level of the second search tree to a second single path to the second same graph node,
• wherein an additional level of each of the first search tree and the second search tree is generated until a common node is found in both the first search tree and the second search tree, and
• wherein one of the first search tree and the second search tree having the fewest number of nodes at a current level generates the additional level until the common node is found.

A system for finding collaborations in a network, comprising:

• a processor;
• and
• a memory device including instructions that, when executed by the processor, cause the system to:
• obtain first collaboration data for a plurality of nodes;
• receive a request to locate at least one collaboration from a user;
• optimize a graph of the collaboration data by condensing multiple paths from a set of the graph nodes at a first level of the graph to a same graph node at a second level of the graph to a single path to the same graph node;
• generate an adjacency list of adjacent nodes in the optimized graph;
• generate a search tree starting by determining a source node of the collaboration data, the search tree including at least two levels, and expanding the search tree until at least one target node is located that corresponds to a solution for the request;
• search the adjacency list to locate at least one shortest path from the source node to the target node;
• and
• generate second collaboration data that is associated with the at least one shortest path from the source node to the target node.

A non-transitory computer-readable storage medium including instructions when executed by at least one processor causing the processor to:

• obtain first collaboration data for a plurality of nodes;
• receive a request to locate at least one collaboration from a user;
• optimize a graph of the collaboration data by condensing multiple paths from a set of the graph nodes at a first level of the graph to a same graph node at a second level of the graph to a single path to the same graph node;
• generate an adjacency list of adjacent nodes in the graph;
• generate a search tree starting by determining a source node of the collaboration data, the search tree including at least two levels, and expanding the search tree until at least one target node is located that corresponds to a solution for the request;
• search the adjacency list to locate at least one shortest path to the target node;
• and
• generate a list of collaboration data that is associated with the at least one shortest path from the source node to the target node.