Method for representing nodes in network
AssigneeInfosys Limited
InventorTrichur Easwaran Hariharan
Life of this patent
Estimating the term…
Abstract
A method and computer program product for creating a data structure for representing a plurality of nodes in a network. One or more data fields are created corresponding to the plurality of nodes for storing information related to the nodes. One or more references are also created for each node such that each reference refers to a node adjacent to the corresponding node. The data fields and the references are then stored in a plurality of secondary data structures. Thereafter, each node is associated with a secondary data structure which includes the data fields and the references corresponding to the associated node. Subsequently, the data structure may be created for storing the secondary data structures.
Claims16
A method for creating a primary data structure for representing a plurality of nodes in a network, the method comprising:
- a. creating one or more data fields for storing information related to the plurality of nodes, each of the one or more data fields being created corresponding to a node from the plurality of nodes;
- b. creating one or more references corresponding to one or more of the plurality of nodes, each of the one or more references referring to a node adjacent to the corresponding one or more nodes;
- c. associating each of the plurality of nodes with at least one secondary data structure from a plurality of secondary data structures, the at least one secondary data structure comprising the one or more data fields and two sets of references, each set of references comprising one or more references corresponding to two sets of nodes connected to the nodes by a set of outgoing edges and a set of incoming edges;
- and
- d. storing the plurality of secondary data structures, wherein the primary data structure is created using the stored plurality of secondary data structures, wherein the references corresponding to each of the one or more nodes are stored in one or more tertiary data structures, the one or more tertiary data structures being stored in one or more secondary data structures corresponding to the one or more nodes;
- and each of the one or more tertiary data structures is a circular linked list.
A computer program product for use with a computer, the computer program product comprising a non-transitory computer usable device having a computer readable program code embodied therein for creating a primary data structure for representing a plurality of nodes in a network, the computer readable program code performing:
- a. creating one or more data fields for storing information related to the plurality of nodes, each of the one or more data fields being created corresponding to a node from the plurality of nodes;
- b. creating one or more references corresponding to one or more of the plurality of nodes, each of the one or more references referring to a node adjacent to the corresponding one or more nodes;
- c. associating each of the plurality of nodes with at least one secondary data structure from a plurality of secondary data structures, the at least one secondary data structure comprising the one or more data fields and two sets of references, each set of references comprising one or more references corresponding to two sets of nodes connected to the nodes by a set of outgoing edges and a set of incoming edges;
- and
- d. storing the plurality of secondary data structures, wherein the primary data structure is created using the stored plurality of secondary data structures, wherein the references corresponding to each of the one or more nodes are stored in one or more tertiary data structures, the one or more tertiary data structures being stored in one or more secondary data structures corresponding to the one or more nodes;
- and each of the one or more tertiary data structures is a circular linked list.
Dependencies are inferred from the claim text.