Patent ID: 7392482

Claim:
A computer implemented method comprising: receiving a primary node selection corresponding to a primary node; setting a branch counter to one and a level counter to one in response to receiving the primary node selection; identifying one or more related nodes corresponding to the primary node, the identifying further comprising: selecting a first branch that corresponds to the primary node; selecting a first level that corresponds to the primary node; identifying nodes that correspond to the first branch and the first level; storing one or more node identifiers that correspond to both the first branch and the first level; in response to determining that there are additional levels, incrementing the level counter to a next level; identifying additional nodes that correspond to both the first branch and the next level; storing one or more relationship node identifiers that correspond to both the first branch and the next level; in response to determining that there are additional branches, incrementing the branch counter to a next branch; identifying additional nodes that correspond to both the next branch and the first level; storing one or more relationship node identifiers that correspond to both the next branch and the first level; receiving a related nodes selection corresponding to one of the relationship level identifiers, wherein an intermediate node level exists between the primary node and the node selection level, the intermediate node level including a plurality of intermediate nodes; and highlighting the primary node and the related nodes that correspond to each node level up to and including the related nodes selection level, which includes each of the plurality of intermediate nodes.