3. The method of claim 2 , further comprising: classifying each edge; wherein said displaying each edge in the graph as a line connected between a pair of nodes displayed in the graph that correspond to the pair of queries having sets of clicked URLs that both indicate the URL of the edge as clicked further comprises displaying the line to graphically indicate the classification of the edge.
3. The method of claim 2 , further comprising: classifying each edge; wherein said displaying each edge in the graph as a line connected between a pair of nodes displayed in the graph that correspond to the pair of queries having sets of clicked URLs that both indicate the URL of the edge as clicked further comprises displaying the line to graphically indicate the classification of the edge. 4. The method of claim 3 , wherein said classifying each edge comprises: classifying an edge as having a first classification if a first query and a second query of the pair of queries that both indicate the URL of the edge as clicked have substantially equivalent sets of clicked URLs; classifying the edge as having a second classification if the set of clicked URLs of the first query is lesser in size than and substantially included in the set of clicked URLs of the second query; and classifying the edge as having a third classification if the set of clicked URLs of the first query is overlapping with the set of clicked URLs of the second query and the edge is not classifiable according to the first or second classifications.