Published July 15, 2022
| Version v1
Journal article
Open
GRAPH TRAVERSALS AND ITS APPLICATIONS
Authors/Creators
- 1. Bharati Vidyapeeth Institute of Management Kolhapur, Maharashtra, India
Description
In this paper we are going to focuses on graph traversal algorithm BFS and DFS. 1) BFS (Breadth First Search) or sometimes it is also known as level order traversal and 2) DFS (Depth First Search). This research paper provides a study of graph and its traversal, based on BFS and DFS briefly. And also defines its applications where these traversals are helpful in graph theory.
Files
V10I701.pdf
Files
(413.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:d462d49239ad685f6ade07122bd3c711
|
413.9 kB | Preview Download |