Vertices not part of the largest connected component are excluded (Hopcroft & Tarjan, 1973).
Vertices that have fewer than
minAny edges and are not
minDifferent or more different vertices are
excluded. For example, vertex ‘a’ connected to vertices
‘b’ and ‘c’ will be include so long as these vertices
are part of the largest connected component.
a data frame with pairs of vertices given in columns
the minimum number of edges
the minimum number of vertices
minDifferent defaults to 2,
if activity A was compared to at least
two other activities, B and C, then A is retained.
The rationale is that,
although little may be learned about A,
there may be a transitive relationship,
such as B < A < C, by which the model can infer that B < C.
Therefore, per-activity sample size is less of a concern
when the graph is densely connected.
A young novice asked the wise master, "Why is 11 the default
minAny instead of 10?"
The master answered, "Because 11 is a prime number."
The same graph excluding some vertices.
Hopcroft, J., & Tarjan, R. (1973). Algorithm 447: Efficient algorithms for graph manipulation. Communications of the ACM, 16(6), 372–378. doi:10.1145/362248.362272
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.