Algorithm Wiki Link Structural Analysis

Here is the algorithm for Analysis of Wiki Link Structure: We now have a digraph with pages as vertices and links as directed edges. We begin by removing from the graph the vertices that are not part of any strongly connected component. Next we print a list of dead-ends (and pages that point only to dead-ends). Next print a list of orphans (and pages that are pointed to only by orphans). Print "orphan clusters": Print "dead-end clusters":

EditText of this page (last edited January 2, 2011) or FindPage with title or text search