7. A computer-implemented method comprising: under control of one or more processors configured with executable instructions: receiving a search query; identifying visible nodes responsive to the search query and visible edges connecting one visible node to another visible node, each visible node representing a web page and each visible edge representing a hyperlink; identifying non-visible nodes connected to the visible nodes by edges, each non-visible node representing a web page; identifying non-visible edges connecting a non-visible node to a visible node or connecting the non-visible node to another non-visible node, each non-visible edge representing a hyperlink; creating an undirected graph comprising nodes and edges, the nodes comprising the visible nodes and the non-visible nodes and the edges comprising the visible edges and the non-visible edges; detecting connected components in the undirected graph; creating a list of the visible nodes such that the visible nodes belonging to a same connected component are listed in a contiguous cluster; enhancing the list by including information on the visible edges; changing a designation of a node from non-visible to visible based on an indication received from the user: when the indication is to show nodes directly connected by an edge to a certain visible node, the designation of non-visible nodes directly connected by an edge to the certain visible node is changed from non-visible to visible; or when the indication is show more nodes with a similarity to the certain visible node, the designation of a predetermined number of the non-visible nodes directly connected by and edge to the certain visible node is changed from non-visible to visible, wherein the similarity is based on at least one of: an algorithm to identify relevance to the search query; a Hyperlink-Induced Topic Search algorithm; or a comparison of textual similarity of each non-visible node within one-hop of the certain visible node to each visible node for which the user has indicated subjective relevance; and regenerating the list to include one or more non-visible nodes designated as visible nodes; and transmitting the list for display to a user such that the visible nodes are list items and the visible edges are arcs between the list items.
7. A computer-implemented method comprising: under control of one or more processors configured with executable instructions: receiving a search query; identifying visible nodes responsive to the search query and visible edges connecting one visible node to another visible node, each visible node representing a web page and each visible edge representing a hyperlink; identifying non-visible nodes connected to the visible nodes by edges, each non-visible node representing a web page; identifying non-visible edges connecting a non-visible node to a visible node or connecting the non-visible node to another non-visible node, each non-visible edge representing a hyperlink; creating an undirected graph comprising nodes and edges, the nodes comprising the visible nodes and the non-visible nodes and the edges comprising the visible edges and the non-visible edges; detecting connected components in the undirected graph; creating a list of the visible nodes such that the visible nodes belonging to a same connected component are listed in a contiguous cluster; enhancing the list by including information on the visible edges; changing a designation of a node from non-visible to visible based on an indication received from the user: when the indication is to show nodes directly connected by an edge to a certain visible node, the designation of non-visible nodes directly connected by an edge to the certain visible node is changed from non-visible to visible; or when the indication is show more nodes with a similarity to the certain visible node, the designation of a predetermined number of the non-visible nodes directly connected by and edge to the certain visible node is changed from non-visible to visible, wherein the similarity is based on at least one of: an algorithm to identify relevance to the search query; a Hyperlink-Induced Topic Search algorithm; or a comparison of textual similarity of each non-visible node within one-hop of the certain visible node to each visible node for which the user has indicated subjective relevance; and regenerating the list to include one or more non-visible nodes designated as visible nodes; and transmitting the list for display to a user such that the visible nodes are list items and the visible edges are arcs between the list items. 10. The computer-implemented method of claim 7 , further comprising: sorting the visible nodes within the contiguous cluster based on, for a given one of the visible nodes, at least one of: a unique first result position indicating a relevance to the search query; a total number of the visible edges and the non-visible edges; a number of incoming visible edges and non-visible edges minus a number of outgoing visible edges and non-visible edges; a number of the visible edges with a directionality to a visible node listed higher in the list than the given one of the visible nodes; or an algorithm to minimize an edge length of the visible edges between the visible nodes within the contiguous cluster.