and 4 others joined a min ago.
1
6.2kviews
Write algorithm to traverse a graph using: Breadth First Search, Depth First Search.
1 Answer
0
183views
written 9.9 years ago by
yashbeer
★ 11k
|
Graph is a non-linear data structure which contains a set on vertices and edges that connect them. Traversing a graph means visiting each node individually and processing it. There are two methods of graph traversal i.e. Breadth first search and Depth first search. These algorithms are specified below.
Breadth first …
and 3 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.