PairViz
Visualization using Graph Traversal
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.
- Version1.3.6
- R versionunknown
- LicenseGPL-2
- Needs compilation?No
- C.B. Hurley and R.W. Oldford (2010) doi:10.1198/jcgs.2010.09136
- C.B. Hurley and R.W. Oldford (2011) doi:10.1007/s00180-011-0229-5
- Last release08/12/2022
Documentation
Team
C.B. Hurley and R.W. Oldford
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends2 packages
- Suggests10 packages
- Reverse Depends1 package
- Reverse Imports1 package
- Reverse Suggests1 package