10. A system for information retrieval in semantic networks, comprising: a data bus system; memory coupled to the data bus system, wherein the memory includes computer usable program code; a processing unit coupled to the data bus system, wherein the processing unit is operable to execute the computer usable program code to: assume a metric regarding an acquired graph, wherein said metric assigns to each edge in the acquired graph a weight that is dependent on degrees of its endpoints; specify a query node of interest on the acquired graph; calculate a shortest-path distance from the query node of interest to a plurality of other nodes on the acquired graph; obtain a ranked list of nodes based on the calculated shortest-path distance, and display for a user the retrieved information.
10. A system for information retrieval in semantic networks, comprising: a data bus system; memory coupled to the data bus system, wherein the memory includes computer usable program code; a processing unit coupled to the data bus system, wherein the processing unit is operable to execute the computer usable program code to: assume a metric regarding an acquired graph, wherein said metric assigns to each edge in the acquired graph a weight that is dependent on degrees of its endpoints; specify a query node of interest on the acquired graph; calculate a shortest-path distance from the query node of interest to a plurality of other nodes on the acquired graph; obtain a ranked list of nodes based on the calculated shortest-path distance, and display for a user the retrieved information. 16. The system according to claim 10 , wherein the processing unit is further operable to execute the computer usable program code to compute the shortest-path distance from the query node to all other nodes for the first task using Dijkstra algorithm.