Eulerian tours and Hamiltonian decompositions of complete graphs are used to ameliorate order effects in statistical graphics.
|Author||C.B. Hurley and R.W. Oldford|
|Date of publication||2011-12-09 15:56:11|
|Maintainer||Catherine Hurley <email@example.com>|
best_orientation: Re-orients a path to be weight-decreasing
cancer: Cancer Survival data
desaturate_color: Desaturates colors
eseq: Construct eulerian paths on the complete graph where nodes...
etour: Constructs eulerian tours on a graph.
eulerian: ~~ Methods for Function eulerian ~~
even_graph: Class of graphs where all nodes have even degree
find_path: Constructs a path from a matrix of edge weights.
guided_pcp: Guided parallel coordinate plot.
hpaths: Hamiltonian paths on the complete graph on 1..n, using...
mc_plot: Multiple comparison plot.
mk_complete_graph: Constructs a complete graph.
mk_even_graph: Constructs an even graph
order_best: Uses brute-force enumeration to find the best hamiltonian on...
order_tsp: Uses tsp to find the best hamiltonian on the complete graph...
overlayci: Function to overlay confidence intervals on the current plot.
overview: Overview of PairViz package
path_cor: Measures the tendency of edge weights to increase.
pathweights: Utility functions to manipulate pairwise information.
pcp: Enhanced parallel coordinate plots.
specialg: Functions to construct graphs.
spreadout: Functions to prepare for categorical parallel coordinates,...
tableplot: Plots rectangles on a grid
whpaths: Constructs weight decreasing hamiltonian paths