order_best

optimize

graphs

Improving graphics by ameliorating order effects, using Eulerian tours
and Hamiltonian decompositions of graphs. References for the methods presented
here are C.B. Hurley and R.W. Oldford (2010) <doi:10.1198/jcgs.2010.09136> and
C.B. Hurley and R.W. Oldford (2011) <doi:10.1007/s00180-011-0229-5>.

Catherine Hurley

PairViz

Visualization using Graph Traversal

order_best function

<dl> <dt>d</dt>
<dd>A <code>dist</code>, used to provide edge weights.</dd> <dt>maxexact</dt>
<dd>If the sequence length is <code>&lt;= maxexact</code>, find the overall best hamiltonian, otherwise compares <code>nsamples</code>
randomly generated permutations.</dd> <dt>nsamples</dt>
<dd>If the sequence length is <code>&lt;= maxexact</code>, finds the best of <code>nsamples</code> randomly generated permutations .</dd> <dt>cycle</dt>
<dd>If <code>TRUE</code>, finds the shortest cycle, otherwise the shortest open path.</dd> <dt>path_weight</dt>
<dd>Combines edge weights into a single path/cycle weight.</dd> <dt>path_dir</dt>
<dd>If a function is provided, used to re-orient the cycle/path. Default function is <code>path_cor</code>.</dd> <dt>...</dt>
<dd>Ignored.</dd></dl>

Arguments

Author

Uses brute-force enumeration  to find the best hamiltonian on the complete graph on 1..n. — order_best

<dl>

 <dt>d</dt>
<dd>A <code>dist</code>, used to provide edge weights.</dd>

 <dt>maxexact</dt>
<dd>If the sequence length is <code>&lt;= maxexact</code>, find the overall best hamiltonian, otherwise compares <code>nsamples</code>
randomly generated permutations.</dd>

 <dt>nsamples</dt>
<dd>If the sequence length is <code>&lt;= maxexact</code>, finds the best of <code>nsamples</code> randomly generated permutations .</dd>

 <dt>cycle</dt>
<dd>If <code>TRUE</code>, finds the shortest cycle, otherwise the shortest open path.</dd>

 <dt>path_weight</dt>
<dd>Combines edge weights into a single path/cycle weight.</dd>

 <dt>path_dir</dt>
<dd>If a function is provided, used to re-orient the cycle/path. Default function is <code>path_cor</code>.</dd>

 <dt>...</dt>
<dd>Ignored.</dd>

</dl>

order_best: Uses brute-force enumeration to find the best hamiltonian on the complete graph on 1..n.

Description

Usage

Value

Arguments

Author

Details

References

See Also

Examples