1. A method of ranking a plurality of nodes in a graph with a superimposed hierarchy of logical directories, comprising: collapsing the logical directories into a plurality of group nodes, wherein at least some of the logical directories comprise the graph with at least one node; assigning a node weight to at least some of the plurality of group nodes that corresponds to a count of the nodes that each of the plurality of group nodes represents; forming an edge between collapsed members of the group nodes, the edge corresponding to a plurality of links between each of the collapsed members of the group nodes; assigning an edge weight to the edge, wherein the edge weight corresponds to a count of the links between the collapsed members of the group nodes; assigning scores and ranks to at least some of the plurality of group nodes using graph ranking on the edge and node weighted graph of the plurality of group nodes; and applying a ranking level of the at least some of the plurality of group nodes to some of the nodes of the logical directories, wherein the ranking level is used to selectively rank at least some of the collapsed members of the group nodes.