# -------------------------------------------- # CITATION file created with {cffr} R package # See also: https://docs.ropensci.org/cffr/ # -------------------------------------------- cff-version: 1.2.0 message: 'To cite package "HGraph" in publications use:' type: software license: GPL-2.0-only title: 'HGraph: Use Graph Structure to Travel' version: 0.1.0 doi: 10.32614/CRAN.package.HGraph abstract: 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) . authors: - family-names: Pang given-names: Jinan email: pang.jinan@qq.com - name: JinanPang repository: https://stongan.r-universe.dev commit: eb22fe8424259b3cf5972c8425795338f64debfb date-released: '2023-03-22' contact: - family-names: Pang given-names: Jinan email: pang.jinan@qq.com - name: JinanPang