# 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)

- Version0.1.0
- R version≥ 3.5.0
- LicenseGPL-2
- Needs compilation?No
- Last release03/22/2023

## Documentation

## Team

### Jinan Pang

### JinanPang[aut

Show author detailsRolesMaintainer### HuiLi[ctb

## 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

- Depends1 package
- Imports2 packages
- Suggests1 package