HGraph: Use Graph Structure to Travel

It is used to travel graphs, by using DFS and BFS to get the path from node to each leaf node. Depth first traversal(DFS) is a recursive algorithm for searching all the vertices of a graph or tree data structure. Traversal means visiting all the nodes of a graph. Breadth first traversal(BFS) algorithm is used to search a tree or graph data structure for a node that meets a set of criteria. It starts at the tree’s root or graph and searches/visits all nodes at the current depth level before moving on to the nodes at the next depth level. Also, it provides the matrix which is reachable between each node. Implement reference about Baruch Awerbuch (1985) <doi:10.1016/0020-0190(85)90083-3>.

Version: 0.1.0
Depends: R (≥ 3.5.0)
Imports: methods, knitr
Suggests: rmarkdown
Published: 2023-03-22
DOI: 10.32614/CRAN.package.HGraph
Author: JinanPang[aut, cre], HuiLi[ctb]
Maintainer: Jinan Pang <pang.jinan at qq.com>
License: GPL-2
NeedsCompilation: no
Materials: README
CRAN checks: HGraph results


Reference manual: HGraph.pdf
Vignettes: HGraph


Package source: HGraph_0.1.0.tar.gz
Windows binaries: r-devel: HGraph_0.1.0.zip, r-release: HGraph_0.1.0.zip, r-oldrel: HGraph_0.1.0.zip
macOS binaries: r-release (arm64): HGraph_0.1.0.tgz, r-oldrel (arm64): HGraph_0.1.0.tgz, r-release (x86_64): HGraph_0.1.0.tgz, r-oldrel (x86_64): HGraph_0.1.0.tgz


Please use the canonical form https://CRAN.R-project.org/package=HGraph to link to this page.