# Visualization using Graph Traversal

## Documentation for package ‘PairViz’ version 1.3.8

- DESCRIPTION file.
- User guides, package vignettes and other documentation.
- Code demos. Use demo() to run them.

## Help Pages

PairViz-package | Overview of PairViz package
best_orientation | Re-orients a path to be weight-decreasing
bipartite_graph | Functions to construct graphs.
cancer | Cancer Survival data
catpcp | Enhanced parallel coordinate plots.
desaturate_color | Desaturates colors
dist2edge | Utility functions to manipulate pairwise information.
dn_graph | Functions to construct graphs.
edge2dist | Utility functions to manipulate pairwise information.
edge_index | Utility functions to manipulate pairwise information.
eseq | Construct eulerian paths on the complete graph where nodes are integers 1..n.
eseqa | Construct eulerian paths on the complete graph where nodes are integers 1..n.
etour | Constructs eulerian tours on a graph.
eulerian | ~~ Methods for Function eulerian ~~
eulerian-method | ~~ Methods for Function eulerian ~~
eulerian-methods | ~~ Methods for Function eulerian ~~
even_graph-class | Class of graphs where all nodes have even degree
factor_spreadout | Functions to prepare for categorical parallel coordinates, drawn by catpcp.
find_path | Constructs a path from a matrix of edge weights.
graph_compose | Functions to construct graphs.
graph_NEL-class | Class of graphs where all nodes have even degree
graph_product | Functions to construct graphs.
graph_sum | Functions to construct graphs.
guided_pcp | Guided parallel coordinate plot.
hpaths | Hamiltonian paths on the complete graph on 1..n, using Lucas-Walecki constructions.
is_even_graph | Class of graphs where all nodes have even degree
is_even_graph-method | Class of graphs where all nodes have even degree
iterated_line_graph | Functions to construct graphs.
knn_graph | Functions to construct graphs.
kntour_add | Construct eulerian paths on the complete graph where nodes are integers 1..n.
kntour_drop | Construct eulerian paths on the complete graph where nodes are integers 1..n.
kspace_graph | Functions to construct graphs.
mc_plot | Multiple comparison plot.
mk_binary_graph | Functions to construct graphs.
mk_complete_graph | Constructs a complete graph.
mk_even_graph | Constructs an even graph
mk_even_graph-method | Constructs an even graph
mk_even_graph-methods | Constructs an even graph
mk_hypercube_graph | Functions to construct graphs.
mk_line_graph | Functions to construct graphs.
nnodes | Utility functions to manipulate pairwise information.
order_best | Uses brute-force enumeration to find the best hamiltonian on the complete graph on 1..n.
order_tsp | Uses tsp to find the best hamiltonian on the complete graph on 1..n
overlayCI | Function to overlay confidence intervals on the current plot.
overview | Overview of PairViz package
path_cis | Utility functions to manipulate pairwise information.
path_cor | Measures the tendency of edge weights to increase.
path_weights | Utility functions to manipulate pairwise information.
pcp | Enhanced parallel coordinate plots.
permute_hpaths | Hamiltonian paths on the complete graph on 1..n, using Lucas-Walecki constructions.
rater_spreadout | Functions to prepare for categorical parallel coordinates, drawn by catpcp.
table_plot | Plots rectangles on a grid
weighted_hpaths | Constructs weight decreasing hamiltonian paths
zigzag | Hamiltonian paths on the complete graph on 1..n, using Lucas-Walecki constructions.