search

DhanushNehru / Hacktoberfest2024

Hacktoberfest 2024 OPEN FIRST Pull Request - SUPPORT OPEN SOURCE - Don't forget to spread love and if you like give us a ⭐️
83 stars 520 forks source link

Adding BFS in C++ #40

Open Mohitbagul opened 1 month ago

Mohitbagul commented 1 month ago

Given a directed graph. The task is to do Breadth First Traversal of this graph starting from 0. Note: One can move from node u to node v only if there's an edge from u to v. Find the BFS traversal of the graph starting from the 0th vertex, from left to right according to the input graph. Also, you should only take nodes directly or indirectly connected from Node 0 in consideration.

image image

Please assign me this issue under Hacktoberfest label

anu098jaiswal commented 1 month ago

can i get this assigned?

Aashana101 commented 1 month ago

kindly assign this task to me. I want to contribute to it