HGraph
0.1.0Use Graph Structure to Travel
Overview
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.
Install
Health
- NOTE r-devel-linux-x86_64-debian-clang
- NOTE r-devel-linux-x86_64-debian-gcc
- NOTE r-devel-linux-x86_64-fedora-clang
- NOTE r-devel-linux-x86_64-fedora-gcc
- NOTE2026-03-1010 OK · 4 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
Documentation
- Examples that run
- 100%
- Documented parameters
- 100%
- Return-value docs
- 100%
- References docs
- 0%
Downloads
Dependencies
Nothing depends on this yet.
Code & Tests
People & History
Author records are not tracked yet for this package.
1 release. R releases are shown for context.
- RR 4.6.0 released · 2026-04-24
- 0.1.0Latest2026-03-10 · current release
- RR 4.5.0 released · 2025-04-11
Package metadata
- First published
- 2023-03-22
- Total releases
- 1 / 3 yrs
- License
- GPL-2 OSI
- Minimum R
- ≥ 3.5.0
- Bundled data
- 0.1 KB / 1 file
- Download size
- 7.5 KB
- Installed size
- not tracked yet
- With dependencies
- not tracked yet